English
Related papers

Related papers: Unlimited parity alternating partitions

200 papers

Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…

Combinatorics · Mathematics 2018-03-23 BongJu Kim

We give a new combinatorial interpretation of the stationary distribution of the (partially) asymmetric exclusion process on a finite number of sites in terms of decorated alternative trees and colored permutations. The corresponding…

Combinatorics · Mathematics 2016-06-08 Petter Brändén , Madeleine Leander , Mirkó Visontai

In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…

Number Theory · Mathematics 2021-08-31 Abdulaziz M. Alanazi , Darlison Nyirenda

We introduce a new pair of mutually dual bases of noncommutative symmetric functions and quasi-symmetric functions, and use it to derive generalizations of several results on the reduced incidence algebra of the lattice of noncrossing…

Combinatorics · Mathematics 2022-04-11 Jean-Christophe Novelli , Jean-Yves Thibon

Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…

Combinatorics · Mathematics 2021-10-27 George E. Andrews , Shane Chern , Zhitai Li

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

This is an attempt to find a hidden virtue in Tolman's paradox by showing that it can give rise to quantum superposition. We consider tachyon exchange between two particles and show that it can generate superposition of eigenstates…

General Physics · Physics 2011-04-14 Moses Fayngold

We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.

Exactly Solvable and Integrable Systems · Physics 2017-05-30 V. E. Adler

A new notion of partition-determined functions is introduced, and several basic inequalities are developed for the entropy of such functions of independent random variables, as well as for cardinalities of compound sets obtained using these…

Information Theory · Computer Science 2012-06-05 Mokshay Madiman , Adam Marcus , Prasad Tetali

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

Probability · Mathematics 2023-01-03 Tiefeng Jiang , Ke Wang

We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…

Combinatorics · Mathematics 2022-04-07 Zhicong Lin , Huan Xiong , Sherry H. F. Yan

We investigate the parity of the coefficients of certain eta-quotients, extensively examining the case of $m$-regular partitions. Our theorems concern the density of their odd values, in particular establishing lacunarity modulo 2 for…

Combinatorics · Mathematics 2022-03-07 William J. Keith , Fabrizio Zanello

We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…

Algebraic Topology · Mathematics 2022-05-11 Scott M. Bailey , Donald M. Larson

Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…

Combinatorics · Mathematics 2018-09-11 Kathleen O'Hara , Dennis Stanton

The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…

Combinatorics · Mathematics 2007-06-18 Alexander E. Holroyd

We present a method to detect entanglement partitions of multipartite quantum systems, by exploiting their inherent symmetries. Structures like genuinely multipartite entanglement, $m$-separability and entanglement depth are detected as…

Quantum Physics · Physics 2025-11-19 Albert Rico , Dmitry Grinko , Robin Krebs , Lin Htoo Zaw

Consider an n qubit computational basis state corresponding to a bit string x, which has had an unknown local unitary applied to each qubit, and whose qubits have been reordered by an unknown permutation. We show that, given such a state…

Quantum Physics · Physics 2009-06-18 Ashley Montanaro

We show that parity-time and partial parity-time symmetries are particular cases of antiunitary symmetry. This point is illustrated by means of a recently discussed system of non-Hermitian coupled harmonic oscillators that also exhibits…

Quantum Physics · Physics 2016-05-03 Francisco M. Fernández

Entanglement asymmetry provides a quantitative measure of symmetry breaking in many-body quantum states. Focusing on inhomogeneous $U(1)$ charges, such as dipole and multipole moments, we show that the typical asymmetry is bounded by a…

Statistical Mechanics · Physics 2026-04-10 Lorenzo Gotta , Filiberto Ares , Sara Murciano

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Combinatorics · Mathematics 2018-11-21 Kedar Karhadkar