Results 51 to 60 of about 90 (78)
On cycles in monotone grid classes of permutations
We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle.
David Bevan +5 more
core +1 more source
Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type
New short and easy computer proofs of finite versions of the Rogers-Ramanujan identities and of similar type are given. These include a very short proof of the first Rogers-Ramanujan identity that was missed by computers, and a new proof of the well ...
Peter Paule
core
A Note on Major Sequences and External Activity in Trees
A bijection is given from major sequences of length n (a variant of parking functions) to trees on f0; : : : ; ng that maps a sequence with sum \Gamma n+1 2 \Delta + k to a tree with external activity k. Key Words: Major sequence, external activity,
Janet S. Beissinger, Uri N. Peled
core
Diagonal operators, \(q\)-Whittaker functions and rook theory
We discuss the problem posed by Bender, Coley, Robbins and Rumsey of enumerating the number of subspaces which have a given profile with respect to a linear operator over the finite field \(\mathbb{F}_q\).
Ram, Samrith, Schlosser, Michael J.
core +1 more source
ON THE SIZE OF MINIMUM SUPER ARROVIAN DOMAINS ∗
. Arrow’s celebrated impossibility theorem states that a sufficiently diverse domain of voter preference profiles cannot be mapped into social orders of the alternatives without violating at least one of three appealing conditions. Following Fishburn and
Samit Dasgupta
core
Monotonic Subsequences in Dimensions Higher Than One
The 1935 result of Erdos and Szekeres that any sequence of n 2 +1 real numbers contains a monotonic subsequence of n + 1 terms has stimulated extensive further research, including a paper of J. B. Kruskal that defined an extension of monotonicity for
A. M. Odlyzko, J. B. Shearer, R. Siders
core
Capacities: From Information Theory to Extremal Set Theory
Generalizing the concept of zero--error capacity beyond its traditional links to any sort of information transmission we give an asymptotic solution to several hard problems in extremal set theory within a unified, formally information--theoretic ...
J. Körner, L. Gargano, U. Vaccaro
core
Magic N-Cubes Form a Free Monoid
In this paper we prove a conjecture stated in an earlier paper [A-L]. The conjecture states that with respect to a rather natural operation, the set of N-dimensional magic cubes forms a free monoid for every integer N ? 1.
Allan Adler
core
Generalizations of Two Identities of Guo and Yang
In this paper, we provide generalizations of two identities of Guo and Yang [2] for the q-binomial coefficients. This approach allows us to derive new convolution identities for the complete and elementary symmetric functions.
Mircea Merca
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations
College Mathematics Journal, 2021Enrique Treviño
exaly

