Maximal Degrees for Young Diagrams in the (k,l) Hook
نویسندگان
چکیده
منابع مشابه
Asymptotics of Young Diagrams and Hook Numbers
Asymptotic calculations are applied to study the degrees of certain sequences of characters of symmetric groups. Starting with a given partition μ, we deduce several skew diagrams which are related to μ. To each such skew diagram there corresponds the product of its hook numbers. By asymptotic methods we obtain some unexpected arithmetic properties between these products. The authors do not kno...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اول3 Explicit formulas for hook walks on continual Young diagrams ∗ † Dan
We consider, following the work of S. Kerov, random walks which are continuous-space generalizations of the Hook Walks defined by GreeneNijenhuis-Wilf, performed under the graph of a continual Young diagram. The limiting point of these walks is a point on the graph of the diagram. We present several explicit formulas giving the probability densities of these limiting points in terms of the shap...
متن کاملMaximal Contiguous Degrees
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many maximal contiguous degrees. Since the contiguous degrees are definable, the class of maximal contiguous degrees provides the first example of a definable infinite anti-chain in the c.e. degrees. In addition, we show t...
متن کاملThin Maximal Antichains in the Turing Degrees
We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of a thin Π1 maximal antichains in the Turing degrees in terms of (relatively) constructible reals. A corollary of our main result gives a negative solution to a question of Jockusch under the assumption that every real is constructible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1998
ISSN: 0195-6698
DOI: 10.1006/eujc.1997.0200