𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalization of a Pinsker problem

✍ Scribed by V. V. Prelov


Book ID
110179877
Publisher
SP MAIK Nauka/Interperiodica
Year
2011
Tongue
English
Weight
493 KB
Volume
47
Category
Article
ISSN
0032-9460

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Generalization of a problem of Lehmer
✍ Cristian Cobeli; Alexandru Zaharescu πŸ“‚ Article πŸ“… 2001 πŸ› Springer 🌐 English βš– 62 KB
A generalization of the Oberwolfach prob
✍ S. I. El-Zanati; S. K. Tipnis; C. Vanden Eynden πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract Let __n__ > 1 be an integer and let __a__~2~,__a__~3~,…,__a__~__n__~ be nonnegative integers such that $\sum\_{i=2}^{n} a\_i=2^{n-1} - 1$. Then $K\_{2^n}$ can be factored into $a\_2 C\_{2^2}$‐factors, $a\_3 C\_{2^3}$‐factors,…,$a\_n C\_{2^n}$‐factors, plus a 1‐factor. Β© 2002 Wiley Perio

q-generalization of a ballot problem
✍ C. Krattenthaler; S.G. Mohanty πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 721 KB

n-dimensional lattice paths which do not touch the hyperplanes xi-xi + I = -1, i = 1,2, , n -1, and x,-x1 = -1 -K arc enumerated by certain statistics, one of which is MacMahon's major index, the others being variations of it. By a reflection-like proof, a formula involving determinants is obtained.