Related papers: Estimating and computing Kronecker Coefficients: a…
We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…
We prove a conjecture of Stembridge concerning stability of Kronecker coefficients that vastly generalizes Murnaghan's theorem. The main idea is to identify the sequences of Kronecker coefficients in question with Hilbert functions of…
The values of the partition function, and more generally the Fourier coefficients of many modular forms, are known to satisfy certain congruences. Results given by Ahlgren and Ono for the partition function and by Treneer for more general…
The permutation matrices form a subgroup of $\text{GL}_n(\mathbb{C})$ that is isomorphic to the symmetric group $S_n$. Let $r_{\mu\lambda}$ denote the multiplicity of the irreducible representation $V_\mu$ of $S_n$, corresponding to a…
Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…
The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…
We consider an operator of Bernstein for symmetric functions, and give an explicit formula for its action on an arbitrary Schur function. This formula is given in a remarkably simple form when written in terms of some notation based on the…
We study the computational model where we can access a matrix $\mathbf{A}$ only by computing matrix-vector products $\mathbf{A}\mathrm{x}$ for vectors of the form $\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_q$. We prove…
Beck introduced two partition statistics $NT(r,m,n)$ and $M_{\omega}(r,m,n)$,which denote the total number of parts in the partition of $n$ with rank congruent to $r$ modulo $m$ and the total number of ones in the partition of $n$ with…
Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…
Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…
We study the problem of partitioning the unit cube $[0,1]^n$ into $c$ parts so that each $d$-dimensional axis-parallel projection has small volume. This natural combinatorial/geometric question was first studied by Kopparty and Nagargoje…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
We conjecture new elementary formulas for computing the greatest common divisor (GCD) of two integers, alongside an elementary formula for extracting the prime factors of semiprimes. These formulas are of fixed-length and require only the…
Using previous work by Merca, we show the partition function involving parts of k different magnitudes, shifted by the triangular numbers, equals the self convolution of the unrestricted partition function. We also provide a combinatorial…
Let e_k(x_1,...,x_l) be an elementary symmetric polynomial and let mu = (mu_1,...,mu_l) be an integer partition. Define pre_k(mu) to be the partition whose parts are the summands in the evaluation e_k(mu_1,...,mu_l). The study of such…
McMullen's g-vector is important for simple convex polytopes. This paper postulates axioms for its extension to general convex polytopes. It also conjectures that, for each dimension d, a stated finite calculation gives the formula for the…
We show that the Kronecker coefficients (the Clebsch-Gordan coefficients of the symmetric group) indexed by two two-row shapes are given by quadratic quasipolynomial formulas whose domains are the maximal cells of a fan. Simple calculations…