Kuru kings, Tura Kāvaseya, and the -tvāya gerund
نویسندگان
چکیده
منابع مشابه
On the 3-kings and 4-kings in multipartite tournaments
Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171–183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n 3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996)...
متن کاملRainfall and Dragon-Kings
Previous studies have found broad distributions, resembling power laws for different measures of the size of rainfall events. We investigate the large-event tail of these distributions and find in one measure that tropical cyclones account for a large proportion of the very largest events outside the scaling regime, i.e., beyond the cutoff of the power law. Tropical cyclones are sufficiently ra...
متن کاملThe Complexity of Kings
A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all tournaments have at least one king [Lan53]. Recently, kings have proven useful in theoretical computer science, in particular in the study of t...
متن کاملCannibalism, kuru and anthropology.
This essay discusses the image and practice of cannibalism in a wide range of studies. It also presents the anthropological research on kuru which led to the proposal that cannibalism had enabled transmission of the infectious agent, as well as doubts about the hypothesis, and the assertion by some that cannibalism as a socially approved custom did not exist. The figure of the cannibal as an ic...
متن کاملThe Problem of the Kings
On a 2m 2n chessboard, the maximum number of nonattacking kings that can be placed is mn, since each 22 cell can have at most one king. Let f m (n) denote the number of ways that mn nonattacking kings can be placed on a 2m 2n chessboard. The purpose of this paper is to prove the following result. such that f m (n) = (c m n + d m)(m + 1) n + O(n m) (n ! 1): For every such placement of kings, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the School of Oriental and African Studies
سال: 2003
ISSN: 0041-977X,1474-0699
DOI: 10.1017/s0041977x03000120