Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA lecture hall theorem for $m$-falling partitions
55
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
For an integer $mge 2$, a partition $lambda=(lambda_1,lambda_2,ldots)$ is called $m$-falling, a notion introduced by Keith, if the least nonnegative residues mod $m$ of $lambda_i$s form a nonincreasing sequence. We extend a bijection originally due to the third author to deduce a lecture hall theorem for such $m$-falling partitions. A special case of this result gives rise to a finite version of Pak-Postnikovs $(m,c)$-generalization of Eulers theorem. Our work is partially motivated by a recent extension of Eulers theorem for all moduli, due to Keith and Xiong. We note that their result actually can be refined with one more parameter.
rate research
Read More
First-Fit is a greedy algorithm for partitioning the elements of a poset into chains. Let $textrm{FF}(w,Q)$ be the maximum number of chains that First-Fit uses on a $Q$-free poset of width $w$. A result due to Bosek, Krawczyk, and Matecki states that $textrm{FF}(w,Q)$ is finite when $Q$ has width at most $2$. We describe a family of posets $mathcal{Q}$ and show that the following dichotomy holds: if $Qinmathcal{Q}$, then $textrm{FF}(w,Q) le 2^{c(log w)^2}$ for some constant $c$ depending only on $Q$, and if $Q otinmathcal{Q}$, then $textrm{FF}(w,Q) ge 2^w - 1$.
Let $mge 2$ be a fixed positive integer. Suppose that $m^j leq n< m^{j+1}$ is a positive integer for some $jge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this paper, we show that $b_m(n)$ can be represented as a $j$-fold summation by constructing a one-to-one correspondence between the $m$-ary partitions and a special class of integer sequences rely only on the base $m$ representation of $n$. It directly reduces to Andrews, Fraenkel and Sellers characterization of the values $b_{m}(mn)$ modulo $m$. Moreover, denote $c_{m}(n)$ the number of $m$-ary partitions of $n$ without gaps, wherein if $m^i$ is the largest part, then $m^k$ for each $0leq k<i$ also appears as a part. We also obtain an enumeration formula for $c_m(n)$ which leads to an alternative representation for the congruences of $c_m(mn)$ due to Andrews, Fraenkel, and Sellers.
We introduce a geometric generalization of Halls marriage theorem. For any family $F = {X_1, dots, X_m}$ of finite sets in $mathbb{R}^d$, we give conditions under which it is possible to choose a point $x_iin X_i$ for every $1leq i leq m$ in such a way that the points ${x_1,...,x_m}subset mathbb{R}^d$ are in general position. We give two proofs, one elementary proof requiring slightly stronger conditions, and one proof using topological techniques in the spirit of Aharoni and Haxells celebrated generalization of Halls theorem.
A generalized crank ($k$-crank) for $k$-colored partitions is introduced. Following the work of Andrews-Lewis and Ji-Zhao, we derive two results for this newly defined $k$-crank. Namely, we first obtain some inequalities between the $k$-crank counts $M_{k}(r,m,n)$ for $m=2,3$ and $4$, then we prove the positivity of symmetrized even $k$-crank moments weighted by the parity for $k=2$ and $3$. We conclude with several remarks on furthering the study initiated here.
We study two families of probability measures on integer partitions, which are Schur measures with parameters tuned in such a way that the edge fluctuations are characterized by a critical exponent different from the generic $1/3$. We find that the first part asymptotically follows a higher-order analogue of the Tracy-Widom GUE distribution, previously encountered by Le Doussal, Majumdar and Schehr in quantum statistical physics. We also compute limit shapes, and discuss an exact mapping between one of our families and the multicritical unitary matrix models introduced by Periwal and Shevitz.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
