English
Related papers

Related papers: A Franklin Type Involution for Squares

200 papers

We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…

Probability · Mathematics 2020-11-10 Jacopo Borga , Erik Slivken

We exhibit, for any positive integer parameter $s$, an involution on the set of integer partitions of $n$. These involutions show the joint symmetry of the distributions of the following two statistics. The first counts the number of parts…

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

Combinatorics · Mathematics 2017-05-16 Shishuo Fu , Dazhao Tang

We propose and prove a new polynomial identity that implies Schur's partition theorem. We give combinatorial interpretations of some of our expressions in the spirit of Kur\c{s}ung\"oz. We also present some related polynomial and $q$-series…

Combinatorics · Mathematics 2019-03-05 Ali K. Uncu

We prove analytic and combinatorial identities reminiscent of Schur's classical partition theorem. Specifically, we show that certain families of overpartitions whose parts satisfy gap conditions are equinumerous with partitions whose parts…

Number Theory · Mathematics 2013-11-22 Kathrin Bringmann , Jeremy Lovejoy , Karl Mahlburg

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

Combinatorics · Mathematics 2020-09-08 J. T. Hird , Naihuan Jing , Ernest Stitzinger

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

Combinatorics · Mathematics 2023-10-16 Shi-Chao Chen

Inspired by Andrews' 2-colored generalized Frobenius partitions, we consider certain weighted 7-colored partition functions and establish some interesting Ramanujan-type identities and congruences. Moreover, we provide combinatorial…

Combinatorics · Mathematics 2017-11-29 Shane Chern , Dazhao Tang

We shall make use of the method of partial fractions to generalize some of Ramanujan's infinite series identities, including Ramanujan's famous formula for $\zeta(2n+1)$, and we shall also give a generalization of the transformation formula…

General Mathematics · Mathematics 2025-01-17 Aung Phone Maw

Braverman and Kazhdan proposed a conjecture, later refined by Ng\^o and broadened to the framework of spherical varieties by Sakellaridis, that asserts that affine spherical varieties admit Schwartz spaces, Fourier transforms, and Poisson…

Number Theory · Mathematics 2022-12-09 Jayce R. Getz , Chun-Hsien Hsu , Spencer Leslie

For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…

Number Theory · Mathematics 2019-07-17 Erin Bevilacqua , Kapil Chandran , Yunseo Choi

In this paper we give an analytic proof of the identity $A_{5,3,3}(n) =B^0_{5,3,3}(n)$, where $A_{5,3,3}(n)$ counts the number of partitions of $n$ subject to certain restrictions on their parts, and $B^0_{5,3,3}(n)$ counts the number of…

Combinatorics · Mathematics 2008-02-12 Padmavathamma , B. M. Chandrashekara , R. Raghavendra , C. Krattenthaler

In this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of partitions of $n$ into distinct parts with two colors. As a consequence, we find…

Number Theory · Mathematics 2025-07-24 Nayandeep Deka Baruah , Subhash Chand Bhoria , Pramod Eyyunni , Bibekananda Maji

In this paper, we study restricted excludant statistics depending on its parity in partitions where parts with same parity are distinct. Using $q$-series transformations, we show that generating functions of these partition statistics are…

Number Theory · Mathematics 2026-03-17 Gargi Mukherjee

We study cylindric partitions with two-element profiles using MacMahon's partition analysis. We find explicit formulas for the generating functions of the number of cylindric partitions by first finding the recurrences using partition…

Combinatorics · Mathematics 2025-02-03 Runqiao Li , Ali K. Uncu

In this paper, we present a new Rogers--Ramanujan type identity for overpartitions by extending the asymmetrical version of Schur's theorem due to Lovejoy to a broader class of infinite products. More precisely, we provide a combinatorial…

Combinatorics · Mathematics 2025-10-02 Laure Velenik

We derive two general transformations for certain basic hypergeometric series from the recurrence formulae for the partial numerators and denominators of two $q$-continued fractions previously investigated by the authors. By then…

Number Theory · Mathematics 2019-01-18 Douglas Bowman , James Mc Laughlin , Nancy J. Wyshinski

We give an elementary proof of some identities that express the squares of Riemann zeta function at integer points in terms of the series involving hyperbolic functions, digamma function, Bernoulli numbers etc. In this version, inaccuracies…

Number Theory · Mathematics 2026-03-24 M. A. Korolev

We study the number $P(n)$ of partitions of an integer $n$ into sums of distinct squares and derive an integral representation of the function $P(n)$. Using semi-classical and quantum statistical methods, we determine its asymptotic average…

Statistical Mechanics · Physics 2018-12-05 M. V. N. Murthy , Matthias Brack , Rajat K. Bhaduri , Johann Bartel

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…

Combinatorics · Mathematics 2007-05-23 Aaron D. Jaggard