English
Related papers

Related papers: Crystal rules for $(\ell,0)$-JM partitions

200 papers

The first lattice QCD calculation of the form factors governing $\Lambda_c \to \Lambda \ell^+ \nu_\ell$ decays is reported. The calculation was performed with two different lattice spacings and includes one ensemble with a pion mass of…

High Energy Physics - Lattice · Physics 2017-02-24 Stefan Meinel

Let n be a positive integer and let Sigma_n be the symmetric group of degree n. Let S^lambda be the Specht module for Sigma_n corresponding to a partition lambda of n, defined over a field F of odd characteristic. We find the indecomposable…

Representation Theory · Mathematics 2007-05-23 Harald Ellers , John Murray

For $d\geq 1$, we define semibricks and wide subcategories in the $d$-extended hearts of bounded $t$-structures on a triangulated category. We show that these semibricks are in bijection with finite-length wide subcategories. When the…

Representation Theory · Mathematics 2025-11-12 Esha Gupta , Yu Zhou

If kappa is strongly compact, lambda > kappa is regular, then (2^{< lambda})^+ --> (lambda+eta)^2_theta holds for eta,theta<kappa.

Logic · Mathematics 2007-05-23 Saharon Shelah

A {\it vector space partition} is here a collection $\mathcal P$ of subspaces of a finite vector space $V(n,q)$, of dimension $n$ over a finite field with $q$ elements, with the property that every non zero vector is contained in a unique…

Combinatorics · Mathematics 2011-03-08 Olof Heden

These are lecture notes prepared for London Mathematical Society Symposium "Quantum Groups" held in Durham 19-29 July 1999. We give a survey on cyclotomic Hecke algebras. These algebras have been studied by Dipper, James, Malle, Mathas and…

Quantum Algebra · Mathematics 2007-05-23 Susumu Ariki

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

Combinatorics · Mathematics 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

A partition of $n$ is $l$-regular if none of its parts is divisible by $l$. Let $b_l(n)$ denote the number of $l$-regular partitions of $n$. In this paper, using the theory of Hecke eigenforms explored by J.-P. Serre, we establish exact…

Number Theory · Mathematics 2020-06-30 Sarma Abinash

The partition relation N \to (n)_{\ell}^k means that whenever the k-tuples of an N-element set are \ell-colored, there is a monochromatic set of size n, where a set is called monochromatic if all its k-tuples have the same color. The…

Combinatorics · Mathematics 2009-07-03 David Conlon , Jacob Fox , Benny Sudakov

The parity of the partition function $p(n)$ remains strikingly mysterious. Beyond a handful of fragmentary results, essentially nothing is known about the distribution of parity. We prove a uniform result on quadratic progressions. If…

Number Theory · Mathematics 2025-10-06 Ken Ono

Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…

Combinatorics · Mathematics 2010-06-29 William Y. C. Chen , Kathy Q. Ji , Albert J. W. Zhu

Matrix rigidity is a notion put forth by Valiant as a means for proving arithmetic circuit lower bounds. A matrix is rigid if it is far, in Hamming distance, from any low rank matrix. Despite decades of efforts, no explicit matrix rigid…

Computational Complexity · Computer Science 2017-08-08 Zeev Dvir , Benjamin Edelman

We prove an identity about partitions, previously conjectured in the study of shifted Jack polynomials (math.CO/9903020). The proof given is using $\lambda$-ring techniques. It would be interesting to obtain a bijective proof.

Combinatorics · Mathematics 2007-05-23 Alain Lascoux , Michel Lassalle

In recent work with Raum the authors considered congruences for the ordinary partition function $p(n)$ of the form $p(\ell Q^r n+\beta)\equiv 0\pmod\ell$ where $\ell, Q\geq 5$ are prime and $r\in \{1,2\}$, and proved a number of results…

Number Theory · Mathematics 2025-10-10 Scott Ahlgren , Olivia Beckwith

A {\em pointed partition} of $n$ is a pair $(\lambda, v)$ where $\lambda\vdash n$ and $v$ is a cell in its Ferrers diagram. We construct an involution on pointed partitions of $n$ exchanging "hook length" and "part length". This gives a…

Combinatorics · Mathematics 2022-03-22 Heesung Shin , Jiang Zeng

We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…

Logic in Computer Science · Computer Science 2018-05-07 Alexis Bès , Christian Choffrut

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

Combinatorics · Mathematics 2021-03-08 Matthieu Latapy , Thi Ha Duong Phan

The purpose of this memoir is to study pre-Lie algebras up to homotopy with divided powers, and to use this algebraic structure for the study of mapping spaces in the category of operads. We define a new notion of algebra called…

Algebraic Topology · Mathematics 2025-10-29 Marvin Verstraete

Let $S=(s_n)_{n\geq 1}$ be a sequence with elements in a commutative monoid $(\mathcal{M},+,0)$. In this paper, we provide an explicit formula for $$\sum_{\la} C(\la) q^{\sum_{n\geq 1} \la_n\cdot s_n}$$ where $\la=(\la_1,\ldots)$ run…

Combinatorics · Mathematics 2023-02-14 Isaac Konan

Let c^{k,l}(n) be the number of compositions (ordered partitions) of the integer n whose Ferrers diagram fits inside a k-by-l rectangle. The purpose of this note is to give a simple, algebraic proof of a conjecture of Vatter that the…

Combinatorics · Mathematics 2007-07-10 Bruce E. Sagan