✦ LIBER ✦

A probabilistic proof of a formula for the number of Young tableaux of a given shape

✍ Scribed by Curtis Greene; Albert Nijenhuis; Herbert S Wilf

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 241 KB
Volume: 31
Category: Article
ISSN: 0001-8708
DOI: 10.1016/0001-8708(79)90023-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of Boolean functions computed

The number of Boolean functions computed by formulas of a given size

✍ Petr Savický; Alan R. Woods 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB 👁 2 views

Estimates are given of the number B n, L of distinct functions computed by propositional formulas of size L in n variables, constructed using only literals and n, k Ž connectives. L is the number of occurrences of variables. L y 1 is the number of binary ns Ž . and ks. B n, L is also the number of f

A Geometric Proof of the Fintushel–Stern

A Geometric Proof of the Fintushel–Stern Formula

✍ Olivier Collin; Nikolai Saveliev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 141 KB

The Fintushel Stern formula asserts that the Casson invariant of a Brieskorn homology sphere 7( p, q, r) equals 1Â8 the signature of its Milnor fiber. We give a geometric proof of this formula, as opposite to computational methods used in the original proof. The formula is also refined to relate equ

The Computer-aided Discovery of a Theore

The Computer-aided Discovery of a Theorem about Young Tableaux

✍ Herbert S. Wilf 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Recently a relationship was discovered between the number of permutations of \(n\) letters that have no increasing subsequence of length \(>k\), on the one hand, and the number of Young tableaux of \(n\) cells whose first row is of length \(\leq k\), on the other. The proof seemed quite unmotivated

Elementary proof of a counting formula f

Elementary proof of a counting formula for acyclic bipartite tournaments

✍ C. C. Rousseau 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

The Proof of a Conjecture of Additive Nu

The Proof of a Conjecture of Additive Number Theory

✍ Alexandru Gica 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 94 KB

The aim of this paper is to show that for any n ¥ N, n > 3, there exist a, b ¥ N\* such that n=a+b, the ''lengths'' of a and b having the same parity (see the text for the definition of the ''length'' of a natural number). Also we will show that for any n ¥ N, n > 2, n ] 5, 10, there exist a, b ¥ N\

A labeling scheme for young tableaux spa

A labeling scheme for young tableaux spanning representations of permutation groupS(N)

✍ Sarma, C. R.; Nampoothiri, A. V. V. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 377 KB

A structure-dependent labeling scheme for the Standard Young Tableaux spanning the representations of the permutation group is outlined in the present work. This scheme is used to generate the representations of a select class of permutations such as dense cycles and general transpositions of the gr