English
Related papers

Related papers: Log-Concavity of the Partition Function

200 papers

Following Boros--Moll, a sequence $(a_n)$ is $m$-log-concave if $\mathcal{L}^j (a_n) \geq 0$ for all $j = 0, 1, \ldots, m$. Here, $\mathcal{L}$ is the operator defined by $\mathcal{L} (a_n) = a_n^2 - a_{n - 1} a_{n + 1}$. By a criterion of…

Combinatorics · Mathematics 2014-05-09 Luis A. Medina , Armin Straub

A classical result of Kahn and Saks states that given any partially ordered set with two distinguished elements, the number of linear extensions in which the ranks of the distinguished elements differ by $k$ is log-concave as a function of…

Combinatorics · Mathematics 2024-07-02 Ramon van Handel , Alan Yan , Xinmeng Zeng

We introduce the notion of Loewner (ellipsoid) function for a log concave function and show that it is an extension of the Loewner ellipsoid for convex bodies. We investigate its duality relation to the recently defined John (ellipsoid)…

Functional Analysis · Mathematics 2019-08-22 Ben Li , Carsten Schuett , Elisabeth M. Werner

Every symmetric polynomial $h(x)$ with center of symmetry $n/2$ can be expressed as a linear combination in the basis $x^i(1+x)^{n-2i}$. The $\gamma$-polynomial of $h(x)$, which we denote $\gamma_h(x)$, records the coefficients of this…

Combinatorics · Mathematics 2025-06-17 Luis Ferroni , Greta Panova , Lorenzo Venturello

Stability version of the Prekopa-Leindler inequality for log-concave functions on the n-dimensional Euclidean space is established.

Classical Analysis and ODEs · Mathematics 2021-04-07 Karoly J. Boroczky , Apratim De

Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…

Combinatorics · Mathematics 2007-05-23 Tomislav Došlić , Darko Veljan

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

It is a basic property of the entropy in statistical physics that is concave as a function of energy. The analog of this in representation theory would be the concavity of the logarithm of the multiplicity of an irreducible representation…

Representation Theory · Mathematics 2007-05-23 Andrei Okounkov

Let $\mathfrak{p}_{\mathbb{P}_r}(n)$ denote the number of partitions of $n$ into $r$-full primes. We use the Hardy-Littlewood circle method to find the asymptotic of $\mathfrak{p}_{\mathbb{P}_r}(n)$ as $n \to \infty$. This extends previous…

Number Theory · Mathematics 2025-05-01 Anji Dong , Nicolas Robles , Alexandru Zaharescu , Dirk Zeindler

A partition of a positive integer $n$ is said to be $t$-core if none of its hook lengths are divisible by $t$. Recently, two analogues, $\overline{a}_t(n)$ and $\overline{b}_t(n)$, of the $t$-core partition function, $c_t(n)$, have been…

Number Theory · Mathematics 2024-05-10 Pranjal Talukdar

In this paper, we investigate decompositions of the partition function $p(n)$ from the additive theory of partitions considering the famous M\"{o}bius function $\mu(n)$ from multiplicative number theory. Some combinatorial interpretations…

Combinatorics · Mathematics 2023-10-23 Mircea Merca , Maxie D. Schmidt

We prove that if a triplet of functions satisfies almost equality in the Pr\'ekopa-Leindler inequality, then these functions are close to a common log-concave function, up to multiplication and rescaling. Our result holds for general…

Functional Analysis · Mathematics 2022-01-28 Károly J. Böröczky , Alessio Figalli , João P. G. Ramos

Let $P_{n,k}$ be the number of permutations $\pi$ on [n]={1, 2,..., n} such that the length of the longest increasing subsequences of $\pi$ equals k, and let $M_{2n, k}$ be the number of matchings on [2n] with crossing number k. Define…

Combinatorics · Mathematics 2008-06-23 William Y. C. Chen

For primes $\ell$ and nonnegative integers $a$, we study the partition functions $$p_\ell(a;n):= \#\{\lambda \vdash n : \text{ord}_\ell(H(\lambda))=a\},$$ where $H(\lambda)$ denotes the product of hook lengths of a partition $\lambda$.…

Number Theory · Mathematics 2023-06-05 Annemily G. Hoganson , Thomas Jaklitsch

In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We…

Combinatorics · Mathematics 2012-02-16 June Huh , Eric Katz

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

Number Theory · Mathematics 2023-01-09 Ernie Croot , Hamed Mousavi , Maxie Schmidt

We study the Pascal determinantal arrays $\PD_k$, whose entries $\PD_k(i,j)$ are the $k\times k$ minors of the lower-triangular Pascal matrix $P=( \binom{a}{b} )_{a,b\ge 0}$. We prove an exact factorization of the row-wise log-concavity…

Combinatorics · Mathematics 2026-01-27 Hossein Teimoori Faal , Hasan Khodakarami

We study multivariate entire functions and polynomials with non-negative coefficients. A class of {\bf Strongly Log-Concave} entire functions, generalizing {\it Minkowski} volume polynomials, is introduced: an entire function $f$ in $m$…

Combinatorics · Mathematics 2009-05-14 Leonid Gurvits

Let m be a positive integer, and let A be the set of all positive integers that belong to a union of r distinct congruence classes modulo m. We assume that the elements of A are relatively prime, that is, gcd(A) = 1. Let p_A(n) denote the…

Number Theory · Mathematics 2007-05-23 Melvyn B. Nathanson

Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for $k$-colored partition functions $p_{-k}(n)$ for all $k\geq2$. This enables us to extend the $k$-colored partition function multiplicatively to a…

Combinatorics · Mathematics 2017-12-21 Shane Chern , Shishuo Fu , Dazhao Tang