English
Related papers

Related papers: Asymptotics for the partial fractions of the restr…

200 papers

This paper studies the product $\bar{G}_n$ of the binomial coefficients in the n-th row of Pascal's triangle, which equals the reciprocal of the product of all the reduced and unreduced Farey fractions of order n. It studies its size as a…

Number Theory · Mathematics 2016-08-11 Jeffrey C. Lagarias , Harsh Mehta

We compute the asymptotic behaviour of the number of partitions of large vectors $(n_1,n_2)$ of $\mathbb{Z}_+^2$ in the critical regime $n_1 \asymp \sqrt{n_2}$ and in the subcritical regime $n_1 = o(\sqrt{n_2})$. This work completes the…

Combinatorics · Mathematics 2019-02-20 Julien Bureaux

Given an integer m>=1, let || || be a norm in R^{m+1} and let S denote the set of points with nonnegative coordinates in the unit sphere with respect to this norm. Consider for each 1<= j<= m a function f_j(z) that is analytic in an open…

Combinatorics · Mathematics 2007-06-13 Manuel Lladser

We consider the Sine-Gordon model coupled to 2D gravity. We find a nonperturbative expression for the partition function as a function of the cosmological constant, the SG mass and the SG coupling constant. At genus zero, the partition…

High Energy Physics - Theory · Physics 2007-05-23 Gregory Moore

This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…

Rings and Algebras · Mathematics 2025-02-04 Frederik vom Ende , Fereshte Shahbeigi

We study the generating functions of cylindric partitions having profile $c=(c_1, c_2, \ldots, c_r)$ with rank $2$ and levels $2, 3$ and $4$. As a result, we give expressions alternative to Borodin's formula for these generating functions.…

Combinatorics · Mathematics 2025-07-30 Burcu Barsakçı

We introduce a class of stochastic processes with reinforcement consisting of a sequence of random partitions $\{\mathcal{P}_t\}_{t \ge 1}$, where $\mathcal{P}_t$ is a partition of $\{1,2,\dots, Rt\}$. At each time~$t$,~$R$ numbers are…

Probability · Mathematics 2021-03-02 Caio Alves , Rodrigo Ribeiro , Daniel Valesin

Given an odd prime $p$, we identify composition factors of the reduction modulo $p$ of spin irreducible representations of the covering groups of symmetric groups indexed by partitions with 2 parts and find some decomposition numbers.

Representation Theory · Mathematics 2019-12-20 Lucia Morotti

We study plane partitions satisfying condition $a_{n+1,m+1}=0$ (this condition is called "pit") and asymptotic conditions along three coordinate axes. We find the formulas for generating function of such plane partitions. Such plane…

Combinatorics · Mathematics 2018-03-06 M. Bershtein , B. Feigin , G. Merzon

We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.

General Mathematics · Mathematics 2021-02-24 Sumit Kumar Jha

Suppose that $n$ drivers each choose a preferred parking space in a linear car park with $m$ spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with larger number (if…

Combinatorics · Mathematics 2008-07-08 Peter J. Cameron , Daniel Johannsen , Thomas Prellberg , Pascal Schweitzer

For a power series which converges in some neighborhood of the origin in the complex plane, it turns out that the zeros of its partial sums---its sections---often behave in a controlled manner, producing intricate patterns as they converge…

Number Theory · Mathematics 2015-03-20 Antonio R. Vargas

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

Group Theory · Mathematics 2015-03-09 J. C. Birget

For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…

Number Theory · Mathematics 2023-10-17 Taylor Daniels

Let $f$ be a real arithmetic function and let $g:[1,\infty[\to{\mathbb R}$ be a smooth function. We describe two emblematic instances in which saddle-point estimates may be used to evaluate the frequency, on the set of integers $n\leqslant…

Number Theory · Mathematics 2026-03-12 Gérald Tenenbaum

In a recent paper, Bacher and de la Harpe study the conjugacy growth series of finitary permutation groups. In the course of studying the coefficients of a series related to the finitary alternating group, they introduce generalized…

Number Theory · Mathematics 2016-07-21 Tessa Cotron , Robert Dicks , Sarah Fleming

We present some Euler-type recurrences for the partition function $p(n)$.

Combinatorics · Mathematics 2018-11-26 Yuriy Choliy , Louis W. Kolitsch , Andrew V. Sills

We prove an asymptotic formula for the number of partitions of $n$ into distinct parts where the largest part is at most $t\sqrt{n}$ for fixed $t \in \mathbb{R}$. Our method follows a probabilistic approach of Romik, who gave a simpler…

Number Theory · Mathematics 2020-11-10 Walter Bridges

The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…

Combinatorics · Mathematics 2012-11-15 Vladimir Kruchinin

We present Euler-type recurrence relations for some partition functions. Some of our results provide new recurrences for the number of unrestricted partitions of $n$, denote by $p(n)$. Others establish recurrences for partition functions…

Combinatorics · Mathematics 2020-07-16 Robson da Silva , Pedro Diniz Sakai