Related papers: Asymptotic Formula for $(t+1)$-Regular Partitions

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

We use the polynomial method of Guth and Katz to establish stronger and {\it more efficient} regularity and density theorems for such $k$-uniform hypergraphs $H=(P,E)$, where $P$ is a finite point set in ${\mathbb R}^d$, and the edge set…

Asymptotic normality is frequently observed in large combinatorial structures, rigorously established for many quantities such as cycles or inversions in random permutations, the number of prime factors of random integers, and various…

This is a proof of an asymptotic formula which describes exponentially small splitting of separatrices in a generic analytic family of area-preserving maps near a Hamiltonian saddle-centre bifurcation. As a particular case and in…

This paper studies bounds in a strong form of regularity for $3$-uniform hypergraphs which was developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. Regular decompositions of this type involve two structural…

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

We solve the enumeration of the set $\textrm{AP}(n)$ of partitions of a positive integer $n$ in which the nondecreasing sequence of parts forms an arithmetic progression. In particular, we establish a formula for the number of nondecreasing…

Following Cayley, MacMahon, and Sylvester, define a non-unitary partition to be an integer partition with no part equal to one, and let $\nu(n)$ denote the number of non-unitary partitions of size $n$. In a 2021 paper, the sixth author…

We present a new proof of Stembridge's theorem about the enumeration of totally symmetric plane partitions using the methodology suggested in the recent Koutschan-Kauers-Zeilberger semi-rigorous proof of the Andrews-Robbins q-TSPP…

Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

We study an asymptotic formula for counting integral points over an equation defined by a non-degenerated indefinite integral ternary quadratic form $f$ representing a non-zero integer $a$ such that $-a\cdot det(f)$ is square over a number…

Let $f:\mathbb{N}\to\{0,\pm 1\}$, for $n \in \mathbb{N}$ let $\Pi[n]$ be the set of partitions of $n$, and for all partitions $\pi = (a_1,a_2,\ldots,a_k) \in \Pi[n]$ let \[ f(\pi) := f(a_1)f(a_2) \cdots f(a_k). \] With this we define the…

Let $s$, $\ell$ be two integers such that $2\le s\le \ell-1$, $\ell\ge 3$. We prove that a suitable asymptotic formula for the average number of representations of integers $n=\sum_{i=1}^{s} p_{i}^{\ell}$, where $p_i$, $i=1,\dotsc,s$, are…

We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of…

We establish the asymptotic formula for the number of integral points in non-compact symmetric homogeneous spaces of semi-simple simply connected algebraic groups over global function fields, given by the sum of the products of local…

We consider two multiplicative statistics on the set of integer partitions: the norm of a partition, which is the product of its parts, and the supernorm of a partition, which is the product of the prime numbers $p_i$ indexed by its parts…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Recently, both authors…

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…