English
Related papers

Related papers: Inequalities between Littlewood-Richardson Coeffic…

200 papers

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

Combinatorics · Mathematics 2024-06-04 Cristina Ballantine , Amanda Welch

The $p$-adic Littlewood Conjecture due to De Mathan and Teuli\'e asserts that for any prime number $p$ and any real number $\alpha$, the equation $$\inf_{|m|\ge 1} |m|\cdot |m|_p\cdot |\langle m\alpha \rangle|\, =\, 0 $$ holds. Here, $|m|$…

Number Theory · Mathematics 2020-10-13 Faustin Adiceam , Erez Nesharim , Fred Lunnon

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

Computational Complexity · Computer Science 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé

We prove Okounkov's conjecture, a conjecture of Fomin-Fulton-Li-Poon, and a special case of Lascoux-Leclerc-Thibon's conjecture on Schur positivity and give several more general statements using a recent result of Rhoades and Skandera. An…

Combinatorics · Mathematics 2009-09-29 Thomas Lam , Alexander Postnikov , Pavlo Pylyavskyy

We reformulate several known results about continued fractions in combinatorial terms. Among them the theorem of Conway and Coxeter and that of Series, both relating continued fractions and triangulations. More general polygon dissections…

Combinatorics · Mathematics 2019-01-28 Sophie Morier-Genoud , Valentin Ovsienko

An unresolved conjecture by Graham Higman states that for all $n\geq 1$ the number of conjugacy classes of the group of $n \times n$ unitriangular matrices with entries in the finite field $\mathbb{F}_q$ is a polynomial in $q$. In this…

Representation Theory · Mathematics 2022-08-17 Lucien Hennecart , Nikolai Perry

Raimi's classical theorem establishes a partition of the natural numbers with a remarkable unavoidability property: for every finite coloring of $\mathbb{N}$, there is a color class whose translate meets both parts of the partition in…

Combinatorics · Mathematics 2026-05-12 Dung The Tran

Motivated in part by hook-content formulas for certain restricted partitions in representation theory, we consider the total number of hooks of fixed length in odd versus distinct partitions. We show that there are more hooks of length $2$,…

Combinatorics · Mathematics 2023-08-30 Cristina Ballantine , Hannah Burson , William Craig , Amanda Folsom , Boya Wen

We prove that the PPT$^2$ conjecture holds for linear maps between matrix algebras which are covariant under the action of the diagonal unitary group. Many salient examples, like the Choi-type maps, depolarizing maps, dephasing maps,…

Quantum Physics · Physics 2022-04-19 Satvik Singh , Ion Nechita

The goal of this paper is to prove that a random polynomial with i.i.d. random coefficients taking values uniformly in $\{1,\ldots, 210\}$ is irreducible with probability tending to $1$ as the degree tends to infinity. Moreover, we prove…

Number Theory · Mathematics 2020-03-18 Lior Bary-Soroker , Gady Kozma

We show that the shifted rank, or srank, of any partition $\lambda$ with distinct parts equals the lowest degree of the terms appearing in the expansion of Schur's $Q_{\lambda}$ function in terms of power sum symmetric functions. This gives…

Combinatorics · Mathematics 2008-05-20 William Y. C. Chen , Donna Q. J. Dou , Robert L. Tang , Arthur L. B. Yang

A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

Combinatorics · Mathematics 2024-05-30 James A. Sellers

We prove the volume conjecture for an infinite family of links called Whitehead chains that generalizes both the Whitehead link and the Borromean rings.

Geometric Topology · Mathematics 2009-09-29 Roland van der Veen

Recently, Amdeberhan et al. proved congruences for the number of hooks of fixed even length among the set of self-conjugate partitions of an integer $n$, therefore answering positively a conjecture raised by Ballantine et al.. In this…

Combinatorics · Mathematics 2026-01-26 Frédéric Jouhet , David Wahiche

For $d \ge 4$, the Noether-Lefschetz locus $\mathrm{NL}_d$ parametrizes smooth, degree $d$ surfaces in $\mathbb{P}^3$ with Picard number at least $2$. A conjecture of Harris states that there are only finitely many irreducible components of…

Algebraic Geometry · Mathematics 2022-04-19 Ananyo Dan

Let $\mathbf{v}_i$ be vectors in $\mathbb{R}^d$ and $\{\varepsilon_i\}$ be independent Rademacher random variables. Then the Littlewood-Offord problem entails finding the best upper bound for $\sup_{\mathbf{x} \in \mathbb{R}^d}…

Combinatorics · Mathematics 2020-09-03 Kyle Luh , David Xiang

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

Computational Geometry · Computer Science 2008-06-12 Timothy G. Abbott , Zachary Abel , David Charlton , Erik D. Demaine , Martin L. Demaine , Scott D. Kominers

We examine the value distributions of coefficients in certain $q$-series related to half Appell sums in higher-level and the first moment of the Garvan's $k$-rank of partitions. We prove that these coefficients equal certain restricted…

Number Theory · Mathematics 2025-09-09 Meng-Juan Tian , Nian Hong Zhou

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

Combinatorics · Mathematics 2011-11-10 W. M. B. Dukes