the iranian-islamic sources have testified to the importance of gundishapour as the largest scientific center, having a medical school and one of the largest hospitals of ancient world in which renown physicians and the scholars of age, from various nationalities, were employed to teach, to do research, and to treat patients. in this scientific centre, greek medicine linked with indian medicine...

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)...

We show that in any n-partite tournament, where n/> 3, with no transmitters and no 3-kings, the number of 4-kings is at least eight. All n-partite tournaments, where n/>3, having eight 4-kings and no 3-kings are completely characterized. This solves the problem proposed in Koh and Tan (accepted).

A tournament Tn is an orientation of a complete graph on n vertices. A king in a tournament is a vertex from which every other vertex is reachable by a path of length at most 2. A sorted sequence of kings in a tournament Tn is an ordered list of its vertices u1, u2, . . . , un such that ui dominates ui+1 (ui → ui+1) and ui is a king in the subtournament induced by {uj : i ≤ j ≤ n} for each i = ...

Crystal River/Kings Bay is a spring-fed estuarine system located on the west coast of the Florida peninsula. During 2008-2009, a field investigation was conducted to measure submarine groundwater discharges (SGDs) from numerous spring vents in Kings Bay. Based on directly measured real-time SGD data, an empirical relationship that links SGD with tides in Kings Bay and the groundwater level meas...

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...

MAIKE HEINING,a,b ANDREW W. YOUNG,c GLAVKOS IOANNOU,a CHRIS M. ANDREW,d MICHAEL J. BRAMMER,e JEFFREY A. GRAY,a AND MARY L. PHILLIPSb aDepartment of Psychology, Institute of Psychiatry, Kings College London, London, UK bSection of Neuroscience and Emotion, Division of Psychological Medicine, Institute of Psychiatry and GKT School of Medicine, London, UK cDepartment of Psychology, University of Y...

Let f(n) denote the number of conngurations of n 2 mutually non-attacking kings on a 2n 2n chessboard. We show that log f(n) grows like 2n log n 2n log 2, with an error term of O(n 4=5 log n). The result depends on an estimate for the sum of the entries of a high power of a matrix with positive entries. In chess, two kings can attack one another if their squares are horizontally, vertically, or...