Related papers: A structure theorem for multiplicative functions o…

It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

Gleason's theorem asserts the equivalence of von Neumann's density operator formalism of quantum mechanics and frame functions, which are functions on the pure states that sum to 1 on any orthonormal basis of Hilbert space of dimension at…

In this paper, we review the construction and large $N$ study of the continuous two-dimensional Yang--Mills theory with gauge group $\mathrm{U}(N)$ through probability, combinatorics and representation theory. In the first part, we define…

In a 2022 paper, Dawsey, Just and the present author prove that the set of integer partitions, taken as a monoid under a partition multiplication operation I defined in my Ph.D. work, is isomorphic to the positive integers as a monoid under…

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…

We use Grothendieck theorem to prove a structure theorem for multicorrelation sequences of length two, associated with two (not necessarily commuting) measure preserving actions on a probability space. We use this to deduce a multiple…

We prove a structural result for measure preserving systems naturally associated with any finite collection of multiplicative functions that take values on the complex unit disc. We show that these systems have no irrational spectrum and…

We prove the following: there is a primitive recursive function f_-^*(-,-), in the three variables, such that: for every natural numbers t,n>0, and c, for any natural number k>=f^*_t(n,c) the following holds. Assume L is an alphabet with…

A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S\{0} is finitely coloured, there is a solution to the system contained in one colour class. It has been known for some…

We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…

Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…

A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…

Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…

The multiplicative structure of the trivial symplectic groupoid over $\mathbb R^d$ associated to the zero Poisson structure can be expressed in terms of a generating function. We address the problem of deforming such a generating function…

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…

Zeckendorf's Theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers. We consider higher-dimensional lattice analogues, where a legal decomposition of a number $n$ is a collection of…

We give improved bounds for our theorem in [GW09], which shows that a system of linear forms on $\mathbb{F}_p^n$ with squares that are linearly independent has the expected number of solutions in any linearly uniform subset of…

We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…