相关论文: Lattice points and simultaneous core partitions

Dyson's rank function and the Andrews--Garvan crank function famously give combinatorial witnesses for Ramanujan's partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of…

For a positive integer $r$, George Andrews proved that the set of partitions of $n$ in which odd multiplicities are at least $2r + 1$ is equinumerous with the set of partitions of $n$ in which odd parts are congruent to $2r + 1$ modulo $4r…

We consider random integer partitions $\lambda$ that follow the Poissonized Plancherel measure of parameter $t^2$. Using Riemann$-$Hilbert techniques, we establish the asymptotics of the multiplicative averages $$Q(t,s)=\mathbb{E} \left[…

Recently, Andrews and El Bachraoui (2024) proved three very interesting $q$-series identities, from which three simple looking identities involving certain restricted partitions into distinct even parts and $4$-regular partitions follow. In…

Let $\mathcal{T}$ be a collection of 3-element subsets $S$ of $\{1, \ldots,n\}$ with the property that if $i<j<k$ and $a<b<c$ are two 3-element subsets in $S$, then there exists an integer sequence $x_1 < x_2 < \cdots < x_n$ such that $x_i,…

Fomin and Zelevinsky show that a certain two-parameter family of rational recurrence relations, here called the (b,c) family, possesses the Laurentness property: for all b,c, each term of the (b,c) sequence can be expressed as a Laurent…

In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

It is well-known that Catalan numbers $C_n = \frac{1}{n+1} \binom{2n}{n}$ count the number of dominant regions in the Shi arrangement of type $A$, and that they also count partitions which are both $n$-cores as well as $(n+1)$-cores. These…

We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…

This work is devoted to the analysis of a Gibbs partition model, also known as a composition scheme. We consider a natural new condition on the component weights. It leads to a new behavior for the total number of components. We discover a…

We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…

In this paper we give a generalization of the main results in \cite{ab,ab1} about $b$-ary expansions of algebraic numbers. As a byproduct we get a large class of new transcendence criteria. One of our corollaries implies that $b$-ary…

We study the number of $k \times r$ plane partitions, weighted on the sum of the first row. Using Erhart reciprocity, we prove an identity for the generating function. For the special case $k=1$ this result follows from the classical theory…

Partition theory abounds with bijections between different types of partitions. One of the most famous partition bijections maps each self-conjugate partition of a positive integer $n$ to a partition of $n$ into distinct odd parts, and vice…

Let $(X,B)$ be a pair, and let $f \colon X \rightarrow S$ be a contraction with $-(K_X + B)$ nef over $S$. A conjecture, known as the Shokurov-Koll\'{a}r connectedness principle, predicts that $f^{-1} (s) \cap \mathrm{Nklt}(X,B)$ has at…

We consider equally-weighted Cantor measures $\mu_{q,b}$ arising from iterated function systems of the form ${b^{-1}(x+i)}$, $i=0,1,...,q-1$, where $q<b$. We classify the $(q,b)$ so that they have infinitely many mutually orthogonal…

It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…

In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…

Ferroni and Larson gave a combinatorial interpretation of the braid Kazhdan-Lusztig polynomials in terms of series-parallel matroids. As a consequence, they confirmed an explicit formula for the leading Kazhdan-Lusztig coefficients of braid…

The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which are Nielsen transformations augmented by arbitrary…