Related papers: Overpartition pairs and two classes of basic hyper…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
We use sequences which depend on two parameters to define families of ultradifferentiable functions which contain Gevrey classes. It is shown that such families are closed under superposition, and therefore inverse closed as well.…
We show how to represent a class of expressions involving discrete sums over partitions as matrix models. We apply this technique to the partition functions of 2* theories, i.e. Seiberg-Witten theories with the massive hypermultiplet in the…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…
Let $\bar{p}(n)$ denote the overpartition function. In this paper, we study the asymptotic higher order $\log$-concavity property of the overpatition function in a similar framework done by Hou and Zhang for the partition function. This…
We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…
We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…
We study the algebraic structure of the mesonic moduli spaces of bipartite field theories by computing the Hilbert series. Bipartite field theories form a large family of 4d N=1 supersymmetric gauge theories that are defined by bipartite…
We give new generalizations of some q-series identities of Dilcher and Prodinger related to divisor functions. Some interesting special cases are also deduced, including an identity related to overpartitions studied by Corteel and Lovejoy.
There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions…
In this Ph.D. dissertation (2018, Emory University) we prove theorems at the intersection of the additive and multiplicative branches of number theory, bringing together ideas from partition theory, $q$-series, algebra, modular forms and…
Orthogonal polynomials for the multivariate hypergeometric distribution are defined on lattices in polyhedral domains in $\RR^d$. Their structures are studied through a detailed analysis of classical Hahn polynomials with negative integer…
The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…
We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey theory of the theory of monads of ultrafilters. This is performed by studying in detail arbitrary tensor products of ultrafilters, as well as…
In this paper we compute asymptotics for the coefficients of an infinite class of overpartition rank generating functions. Using these results, we show that $ \overline{N}(a,c,n), $ the number of overpartitions of $ n $ with rank congruent…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
The central object of study is a formal power series that we call the content series, a symmetric function involving an arbitrary underlying formal power series $f$ in the contents of the cells in a partition. In previous work we have shown…
We study various conditions under which a unitary in an ultraproduct of matrices is conjugated to an ultraproduct of permutations.