Related papers: Restriction coefficients for partitions with at mo…
We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…
We study frequency moments of partition statistics arising from Euler products $A(q)=\prod_{r\ge1}(1-q^r)^{-c(r)}$ via a transform that expresses the moment generating functions as $B(q)$ times explicit divisor--sum series determined by…
A semibrick is a set of modules satisfying Schur's Lemma, and it is said to be maximal if it is not properly contained in another semibrick. For any finite dimensional algebra $\varLambda$ over an algebracally closed field $K$, we prove…
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…
Using unitary equivalence of magnetic translation operators, explicit upper and lower convex bounds on the partition function of the Hofstadter model are given for any rational ``flux" and any value of Bloch momenta. These bounds (i)…
We study the correlators of irregular vertex operators in two-dimensional conformal field theory (CFT) in order to propose an exact analytic formula for calculating numbers of partitions, that is: 1) for given $N,k$, finding the total…
The SU(3) modular invariant partition functions were first completely classified in Ref.\ \SU. The purpose of these notes is four-fold: \item{(i)} Here we accomplish the SU(3) classification using only the most basic facts: modular…
We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs…
This paper explores the partition properties of roller coaster permutations, a class of permutations characterized by maximizing the number of alternating runs in all subsequences. We establish a connection between the structure of these…
Let n geq 1, let lambda be a partition of n, let mu be a partition arising from lambda by a downwards shift of two boxes situated at the bottom of a column. We give a formula for a ZS_n-linear morphism of order m between the corresponding…
In \cite{[CZ]}, Cohen and Zemel showed that for a partition $\lambda \vdash k$, the dimension of the irreducible representation of $S_{n}$ corresponding to the partition $(n-k,\lambda) \vdash n$ is a polynomial of degree $k$ in $n$, whose…
In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literature, our work focuses on leveraging properties of partition…
We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a…
Very recently, Thejitha, Sellers, and Fathima defined the function $a_{r,s}(n)$, which enumerates the number of multicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors,…
Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed…
We consider a surface with negative curvature in $\Bbb R^3$ which is a cubic perturbation of the saddle. For this surface, we prove a new restriction theorem, analogous to the theorem for paraboloids proved by L. Guth in 2016. This specific…
Let $P$ be a set $n$ points in a $d$-dimensional space. Tverberg's theorem says that, if $n$ is at least $(k-1)(d+1)+1$, then $P$ can be partitioned into $k$ sets whose convex hulls intersect. Partitions with this property are called {\em…
Tverberg's theorem bounds the number of points $\mathbb{R}^d$ needed for the existence of a partition into $r$ parts whose convex hulls intersect. If the points are colored with $N$ colors, we seek partitions where each part has at most one…