English
Related papers

Related papers: Strict Log-Subadditivity for Overpartition Rank

200 papers

We conjecture that the asymptotic behavior of the numbers of solid (three-dimensional) partitions is identical to the asymptotics of the three-dimensional MacMahon numbers. Evidence is provided by an exact enumeration of solid partitions of…

Statistical Mechanics · Physics 2012-02-10 Srivatsan Balakrishnan , Suresh Govindarajan , Naveen S. Prabhakar

Maximizing a non-negative, monontone, submodular function $f$ over $n$ elements under a cardinality constraint $k$ (SMCC) is a well-studied NP-hard problem. It has important applications in, e.g., machine learning and influence…

Data Structures and Algorithms · Computer Science 2024-02-05 Philip Cervenjak , Junhao Gan , Anthony Wirth

In this note, using entirely algebraic or elementary methods, we determine a new asymptotic lower bound for the number of odd values of one of the most important modular functions in number theory, the Klein $j$-function. Namely, we show…

Number Theory · Mathematics 2015-02-12 Fabrizio Zanello

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

Recently, Hirschhorn and the first author considered the parity of the function $a(n)$ which counts the number of integer partitions of $n$ wherein each part appears with odd multiplicity. They derived an effective characterization of the…

Combinatorics · Mathematics 2022-04-05 James A. Sellers , Fabrizio Zanello

We give an overpartition analogue of Bressoud's combinatorial generalization of the G\"ollnitz-Gordon theorem for even moduli in general case. Let $\widetilde{O}_{k,i}(n)$ be the number of overpartitions of $n$ whose parts satisfy certain…

Combinatorics · Mathematics 2017-03-01 Thomas Y. He , Allison Y. F. Wang , Alice X. H. Zhao

For a given partition of (1, 2, ..., 2n) into two disjoint subsets A and B with n elements in each, consider the maximum number of times any integer occurs as the difference between an element of A and an element of B. The minimum value of…

General Mathematics · Mathematics 2016-09-27 Jan Kristian Haugland

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

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…

Combinatorics · Mathematics 2015-09-25 Istvan Tomon

Let $\Sym{n}$ denote the set of all permutations on $n$ labels. Let $c:[0, 1]^2\to [0, \infty)$ be a twice continuously differentiable function. A subfamily of the Mallows model is the Gibbs probability measures on $\Sym{n}$ such that…

Probability · Mathematics 2026-05-06 Raghavendra Tripathi

In 2003, Maroti showed that one could use the machinery of l-cores and l-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case l=2, using them to give a…

Combinatorics · Mathematics 2007-05-23 Mark Wildon

Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually…

Number Theory · Mathematics 2022-09-27 Kathrin Bringmann , Siu Hang Man , Larry Rolen

A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…

Number Theory · Mathematics 2025-10-27 Ken Ono

Recently, Debruyne and Tenenbaum proved asymptotic formulas for the number of partitions with parts in $\mathcal{L}\subset\mathbb{N}$ ($\gcd(\mathcal{L})=1$) and good analytic properties of the corresponding zeta function, generalizing work…

Number Theory · Mathematics 2023-03-22 Walter Bridges , Benjamin Brindle , Kathrin Bringmann , Johann Franke

In this note, we are interested in obtaining uniform upper bounds for the number of powerful numbers in short intervals $(x, x + y]$. We obtain unconditional upper bounds $O(\frac{y}{\log y})$ and $O(y^{11/12})$ for all powerful numbers and…

Number Theory · Mathematics 2022-07-20 Tsz Ho Chan

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

Combinatorics · Mathematics 2019-03-14 Tiefeng Jiang , Ke Wang

Given a partition $\lambda$, we write $e_j(\lambda)$ for the $j^{\textrm{th}}$ elementary symmetric polynomial $e_j$ evaluated at the parts of $\lambda$ and $e_jp_A(n)$ for the sum of $e_j(\lambda)$ as $\lambda$ ranges over the set of…

Combinatorics · Mathematics 2024-08-27 Cristina Ballantine , George Beck , Mircea Merca

Possible short and semi-short positive energy, unitary representations of the Osp(2N|4) superconformal group in three dimensions are discussed. Corresponding character formulae are obtained, consistent with character formulae for the…

High Energy Physics - Theory · Physics 2014-11-18 F. A. Dolan

The number of sequences of odd length in strict partitions (denoted as $\mathrm{sol}$), which plays a pivotal role in the first paper of this series, is investigated in different contexts, both new and old. Namely, we first note a direct…

Combinatorics · Mathematics 2024-10-23 Shishuo Fu , Haijun Li

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

Computational Geometry · Computer Science 2007-05-23 Qi Cheng
‹ Prev 1 8 9 10 Next ›