English
Related papers

Related papers: Schur partition theorems via perfect crystal

200 papers

For a set of positive integers $A$, let $p_A(n)$ denote the number of ways to write $n$ as a sum of integers from $A$, and let $p(n)$ denote the usual partition function. In the early 40s, Erd\H{o}s extended the classical Hardy--Ramanujan…

Number Theory · Mathematics 2021-04-07 Asaf Cohen Antonir , Asaf Shapira

Let $k$ be a perfect field of characteristic $p \geq 3$. We classify $p$-divisible groups over regular local rings of the form $W(k)[[t_1,...,t_r,u]]/(u^e+pb_{e-1}u^{e-1}+...+pb_1u+pb_0)$, where $b_0,...,b_{e-1}\in W(k)[[t_1,...,t_r]]$ and…

Number Theory · Mathematics 2012-07-25 Adrian Vasiu , Thomas Zink

In 2010, Andrews considers a variety of parity questions connected to classical partition identities of Euler, Rogers, Ramanujan and Gordon. As a large part in his paper, Andrews considered the partitions by restricting the parity of…

Combinatorics · Mathematics 2018-01-08 Doris D. M. Sang , Diane Y. H. Shi

We generalize the theory of linked partition ideals due to Andrews using finite automata in formal language theory and apply it to prove three Rogers--Ramanujan type identities of modulo 14 that were posed by Nandi through vertex operator…

Combinatorics · Mathematics 2020-09-04 Motoki Takigiku , Shunsuke Tsuchioka

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

Number Theory · Mathematics 2020-06-09 Maxwell Schneider , Robert Schneider

We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and…

Combinatorics · Mathematics 2016-07-01 Jehanne Dousse

We prove a constant term conjecture of Robbins and Zeilberger (J. Combin. Theory Ser. A 66 (1994), 17-27), by translating the problem into a determinant evaluation problem and evaluating the determinant. This determinant generalizes the…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

Let $p$ be an odd prime. We describe a method to compute the Schur multiplier of finite $p$-groups $G$ of nilpotency class $2$ such that $G/[G,G]$ is isomorphic to direct product of copies of $\mathbb{Z}_{p^s}$ for $s \in \mathbb{N}$,…

Group Theory · Mathematics 2026-05-04 Sumana Hatui , Tony Nixon Mavely , Sahanawaj Sabnam

We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…

Dynamical Systems · Mathematics 2012-12-07 Artur Siemaszko , Maciej P. Wojtkowski

The equality between the number of odd spin structures on a Riemann surface of genus g, with $2^g - 1$ being a Mersenne prime, and the even perfect numbers, is an indication that the action of the modular group on the set of spin structures…

Mathematical Physics · Physics 2007-05-23 Simon Davis

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

Number Theory · Mathematics 2007-05-23 Pieter Moree , Peter Stevenhagen

Bernoulli-$p$ thinning has been well-studied for point processes. Here we consider three other cases: (1) sequences $(X_1,X_2,...)$; (2) gaps of such sequences $(X_{n+1}-X_1)_{n\in\mathbb{N}}$; (3) partition structures. For the first case…

Probability · Mathematics 2015-09-29 Shannon Starr , Brigitta Vermesi , Ang Wei

A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…

Number Theory · Mathematics 2007-05-23 Dohoon Choi , Soon-Yi Kang , Jeremy Lovejoy

In this paper, we consider the set of partitions $ped(n)$ which counts the number of partitions of $n$ wherein the even parts are distinct (and the odd parts are unrestricted). Using an algorithm developed by Radu, we prove congruences…

Number Theory · Mathematics 2025-03-11 Hemjyoti Nath , Abhishek Sarma

Let $G$ be a reductive group over a field $k$ which is algebraically closed of characteristic $p \neq 0$. We prove a structure theorem for a class of subgroup schemes of $G$, for $p$ bounded below by the Coxeter number of $G$. As…

Algebraic Geometry · Mathematics 2023-06-22 V. Balaji , P. Deligne , A. J. Parameswaran

A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…

Combinatorics · Mathematics 2015-08-26 Andrew Timothy Wilson

A set $A$ is MSTD (more-sum-than-difference) if $|A+A|>|A-A|$. Though MSTD sets are rare, Martin and O'Bryant proved that there exists a positive constant lower bound for the proportion of MSTD subsets of $\{1,2,\ldots ,r\}$ as…

Number Theory · Mathematics 2019-10-23 Hung Viet Chu , Noah Luntzlara , Steven J. Miller , Lily Shao

Let $A_k(n)$ denote the set of $k$-distinct partitions of $n$, and let $B_k(n)$ be the set of $k$-regular partitions of $n$. Glaisher showed that $\# A_k(n) = \# B_k(n)$. For $k=2$, this equality yields the celebrated Euler's partition…

Combinatorics · Mathematics 2025-11-19 Hongshu Lin , Wenston J. T. Zang

Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly characterizes the number of partitions with designated summands…

We present a new proof of Stembridge's theorem about the enumeration of totally symmetric plane partitions using the methodology suggested in the recent Koutschan-Kauers-Zeilberger semi-rigorous proof of the Andrews-Robbins q-TSPP…

Symbolic Computation · Computer Science 2009-06-08 Christoph Koutschan