English
Related papers

Related papers: Log-Concavity of Infinite Product Generating Funct…

200 papers

We state and prove product formulae for several generating functions for sequences $(a_n)_{n\ge0}$ that are defined by the property that $Pa_n+b^2$ is a square, where $P$ and $b$ are given integers. In particular, we prove corresponding…

Number Theory · Mathematics 2021-11-30 Christian Krattenthaler , Mircea Merca , Cristian-Silviu Radu

Let X_{d,n} be an n-element subset of {0,1}^d chosen uniformly at random, and denote by P_{d,n} := conv X_{d,n} its convex hull. Let D_{d,n} be the density of the graph of P_{d,n} (i.e., the number of one-dimensional faces of P_{d,n}…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel , Anja Remshagen

In this note prove the following Berwald-type inequality, showing that for any integrable log-concave function $f:\mathbb R^n\rightarrow[0,\infty)$ and any concave function $h:L\rightarrow\mathbb [0,\infty)$, where $L$ is the epigraph of…

Functional Analysis · Mathematics 2019-08-06 David Alonso-Gutiérrez , Julio Bernués , Bernardo González Merino

Mullineux defined an involution on the set of $e$-regular partitions of $n$. When $e=p$ is prime, these partitions label irreducible symmetric group modules in characteristic $p$. Mullineux's conjecture, since proven, was that this…

Combinatorics · Mathematics 2025-02-24 David J. Hemmer

The number of partitions of $n$ wherein odd parts are distinct and even parts are unrestricted, often denoted by $pod(n)$. In this paper, we provide linear recurrence relations for $pod(n)$, and the connections of $pod(n)$ with other…

Combinatorics · Mathematics 2024-01-30 Hemjyoti Nath

It is widely believed that the parity of the partition function $p(n)$ is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free…

Number Theory · Mathematics 2022-12-15 Ken Ono

For a real polynomial $p = \sum_{i=0}^{n} c_ix^i$ with no negative coefficients and $n\geq 6$, let $\beta (p) = \inf_{i=1}^{n-1} c_i^2/c_{i+1}c_{i-1}$ (so $\beta (p) \geq 1$ entails that $p$ is log concave). If $\beta(p) > 1.45...$, then…

Classical Analysis and ODEs · Mathematics 2010-10-01 David Handelman

Let $p$ be an odd prime and let $d$ be an integer not divisible by $p$. We prove that $$ \prod_{1\le m,n\le p-1\atop p\nmid m^2-dn^2}\ (x-(m+n\sqrt{d})) \equiv \begin{cases}\sum_{k=1}^{p-2}\frac{k(k+1)}2x^{(k-1)(p-1)}\pmod p &\text{if}\…

Number Theory · Mathematics 2025-04-17 Bo Jiang , Zhi-Wei Sun

In this paper, we prove that the number of unimodal sequences of size $n$ is log-concave. These are coefficients of a mixed false modular form and have a Rademacher-type exact formula due to recent work of the second author and Nazaroglu on…

Number Theory · Mathematics 2023-07-12 Walter Bridges , Kathrin Bringmann

Let $U_{n,d}$ be the uniform matroid of rank $d$ on $n$ elements. Denote by $g_{U_{n,d}}(t)$ the Speyer's $g$-polynomial of $U_{n,d}$. The Tur\'{a}n inequality and higher order Tur\'{a}n inequality are related to the Laguerre-P\'{o}lya…

Combinatorics · Mathematics 2024-10-11 James J. Y. Zhao

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

For fixed $m$ and $R\subseteq \{0,1,\ldots,m-1\}$, take $A$ to be the set of positive integers congruent modulo $m$ to one of the elements of $R$, and let $p_A(n)$ be the number of ways to write $n$ as a sum of elements of $A$. Nathanson…

Number Theory · Mathematics 2021-01-28 Asaf Cohen Antonir , Asaf Shapira

Korsky, Saffat and Aiylam introduced a growth constant $c(G)$ for integer-valued $h$-Lipschitz functions on a finite graph $G$ and proved that, for $G=G(n,d/n)$, \[ \frac{1}{2d}+O(d^{-2})\le \log c(G)\le \frac{4\log^2 d}{d}+O(d^{-1}) \]…

Combinatorics · Mathematics 2026-05-26 Samuel Korsky

This paper naturally extends and generalizes our previous work "Thue-Morse constant is not badly approximable", arXiv:1407.3182 [math.NT]. Here we consider the Laurent series $f_d(x) = \prod_{n=0}^\infty (1 - x^{-d^n})$, $d\in\mathbb{N}$,…

Number Theory · Mathematics 2015-09-02 Dzmitry Badziahin , Evgeny Zorin

Denote by $A(p, n, k)$ the number of commuting $p$-tuples of permutations on $[n]$ that have exactly $k$ distinct orbits. It was conjectured in~\cite{abdesselam2023log} that $A(p, n, k)$ is log-concave with respect to $k$ for every $p\geq…

Combinatorics · Mathematics 2024-09-02 Raghavendra Tripathi

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

Combinatorics · Mathematics 2026-03-16 D. S. Gireesh , B. Hemanthkumar

Let $N_{1,B}(n)$ denote the number of ones in the $B$-ary expansion of an integer $n$. Woods introduced the infinite product $P :=\prod_{n \geq 0} (\frac{2n+1}{2n+2})^{(-1)^{N_{1,2}(n)}}$ and Robbins proved that $P = 1/\sqrt{2}$. Related…

Number Theory · Mathematics 2011-03-29 Jean-Paul Allouche , Jonathan Sondow

In the paper, new estimates of the Lebesgue constant $$ \mathcal{L}(W)=\frac1{(2\pi)^d}\int_{\mathbb{T}^d}\bigg|\sum_{{k}\in W\cap \mathbb{Z}^d} e^{i({k},\,{x})}\bigg| {\rm d}{ x} $$ for convex polyhedra $W\subset\mathbb{R}^d$ are obtained.…

Classical Analysis and ODEs · Mathematics 2018-01-03 Yurii Kolomoitsev , Tetiana Lomako

The generating function for restricted partitions is a finite product with a Laurent expansion at each root of unity. The question of the behavior of these Laurent coefficients as the size of the product increases goes back to Rademacher…

Number Theory · Mathematics 2020-01-23 Cormac O'Sullivan

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

Combinatorics · Mathematics 2010-02-09 Jerome Kelleher
‹ Prev 1 4 5 6 7 8 10 Next ›