English
Related papers

Related papers: Higher order log-concavity of the overpartition fu…

200 papers

Let $\bar{a}_s(n)$ denote the number of partitions of $n$, wherein each odd part is multicolored (atmost $s\ge 1$ colors) and the first appearance of parts may be overlined. In this paper, we establish new families of congruences modulo…

Number Theory · Mathematics 2026-05-21 M. P. Thejitha , S. N. Fathima

In this paper, we study the asymptotic behavior of lengths of $\tor$ modules of homologies of complexes under the iterations of the Frobenius functor in positive characteristic. We first give upper bounds to this type of length functions in…

Commutative Algebra · Mathematics 2007-05-23 Jinjia Li

Let A be a set of positive integers with gcd(A) = 1, and let p_A(n) be the partition function of A. Let c = \pi \sqrt(2/3). Let \alpha > 0. It is proved that log p_A(n) ~ c\sqrt(\alpha n) if and only if the set A has asymptotic density…

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

In the $1970$s Nicolas proved that the coefficients $p_d(n)$ defined by the generating function \begin{equation*} \sum_{n=0}^{\infty} p_d(n) \, q^n = \prod_{n=1}^{\infty} \left( 1- q^n\right)^{-n^{d-1}} \end{equation*} are log-concave for…

Combinatorics · Mathematics 2022-06-23 Bernhard Heim , Markus Neuhauser

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

Let $\{p_n\}_{n\ge 1}$ be the sequence of primes and $\vartheta(x) = \sum_{p \leq x} \log p$, where $p$ runs over the primes not exceeding $x$, be the Chebyshev $\vartheta$-function. In this note we derive lower and upper bounds for…

Number Theory · Mathematics 2020-01-14 Aditya Ghosh

Let $j,n$ be even positive integers, and let $\overline{p}_j(n)$ denote the number of partitions with BG-rank $j$, and $\overline{p}_j(a,b;n)$ to be the number of partitions with BG-rank $j$ and $2$-quotient rank congruent to $a \pmod{b}$.…

Number Theory · Mathematics 2022-09-27 Andrew Baker , Joshua Males

The type $A$ Kostant partition function is an important combinatorial object with various applications: it counts integer flows on the complete directed graph, computes Hilbert series of spaces of diagonal harmonics, and can be used to…

Combinatorics · Mathematics 2024-11-25 Jonathan Leake , Alejandro H. Morales

The paper is devoted to tests for uniformity based on sum-functions of overlapping spacings, where the order of spacings can diverge to infinity as the sample size increases. In particular, it is shown that the asymptotic local power of…

Statistics Theory · Mathematics 2025-08-27 Sherzod M. Mirakhmedov

Let $p\leq 23$ be a prime and $a_p(n)$ counts the number of partitions of $n$ where parts that are multiple of $p$ come up with $2$ colors. Using a result of Sussman, we derive the exact formula for $a_p(n)$ and obtain an asymptotic formula…

Combinatorics · Mathematics 2024-11-18 Russelle Guadalupe

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…

Number Theory · Mathematics 2022-01-21 Olivier Ramare , Alisa Sedunova , Ritika Sharma

This is a summary of a recursive construction of solutions of the hbar-dependent KP hierarchy. We give recursion relations for the coefficients X_n of an hbar-expansion of the operator X = X_0 + \hbar X_1 + \hbar^2 X_2 + ... for which the…

Mathematical Physics · Physics 2012-06-12 Kanehisa Takasaki , Takashi Takebe

In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined…

Combinatorics · Mathematics 2017-07-19 Jehanne Dousse , Byungchan Kim

In this paper, we provide some of the necessary mathematics to describe higher order Lions-Taylor expansions. The Lions derivative of a functional on the Wasserstein space of measures quantifies infinitesimal perturbations on measures in…

Probability · Mathematics 2024-05-16 William Salkeld

We study symmetric function analogues of the higher order Bell numbers. Their construction involves iterated plethystic exponential towers mimicking the single variable exponential generating functions for the higher order Bell numbers. We…

Combinatorics · Mathematics 2025-09-23 Milo Bechtloff Weising

The higher-order Stokes phenomenon can emerge in the asymptotic analysis of many problems governed by singular perturbations. Indeed, over the last two decades, the phenomena has appeared in many physical applications, from acoustic and…

Classical Analysis and ODEs · Mathematics 2024-12-10 Josh Shelton , Samuel Crew , Philippe H. Trinh

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

Number Theory · Mathematics 2018-04-20 Alexander Dunn , Nicolas Robles

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

Number Theory · Mathematics 2008-06-20 Gert Almkvist

In this short note, we prove several new congruences for the overcubic partition triples function, using both elementary techniques and the theory of modular forms. These extend the recent list of such congruences given by Nayaka,…

Number Theory · Mathematics 2025-09-10 Manjil P. Saikia , Abhishek Sarma

We consider the one-variable fragment of first-order logic extended with Presburger constraints. The logic is designed in such a way that it subsumes the previously-known fragments extended with counting, modulo counting or cardinality…

Logic in Computer Science · Computer Science 2019-09-17 Bartosz Bednarczyk
‹ Prev 1 3 4 5 6 7 10 Next ›