Related papers: A geometric and generating function approach to pl…
We introduce the $\mathcal{T}$-construction, an endofunctor on the category of generalized operads as a general mechanism by which various notions of plethystic substitution arise from more ordinary notions of substitution. In the special…
A conformal partition function ${\cal P}_n^m(s)$, which arose in the theory of Diophantine equations supplemented with additional restrictions, is concerned with {\it self-dual symmetric polynomials} -- reciprocal ${\sf R}^{\{m\}}_ {S_n}$…
In recent work, the author, in collaboration with Allen, Long, and Tu, developed the Explicit Hypergeometric Modularity Method (EHMM), which establishes the modularity of a large class of hypergeometric Galois representations in dimensions…
We derive group branching laws for formal characters of subgroups $H_\pi$ of GL(n) leaving invariant an arbitrary tensor $T^\pi$ of Young symmetry type $\pi$ where $\pi$ is an integer partition. The branchings $GL(n)\downarrow GL(n-1)$,…
One way to obtain invariants of some Legendrian submanifolds in 1-jet spaces $J^1M$, equipped with the standard contact structure, is through the Morse theoretic technique of generating families. This paper extends the invariant of…
We solve general 1-matrix models without taking the double scaling limit. A method of computing generating functions is presented. We calculate the generating functions for a simple and double torus. Our method is also applicable to more…
Let $F(x)=\sum\limits_{n=1}^\infty\tau(n)x^n$ be the generating function for the number $\tau(n)$ of spanning trees in the circulant graphs $C_{n}(s_1,s_2,\ldots,s_k).$ We show that $F(x)$ is a rational function with integer coefficients…
Let $\lambda_{\phi}(n)$ be the Fourier coefficients of a Hecke holomorphic or Hecke--Maass cusp form on ${\rm SL}_2(\mathbb Z)$, and $f$ be any multiplicative function that satisfies two mild hypotheses. We establish a non-trivial upper…
A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…
Based on the vertex operator realization of the Schur functions, a determinant-type plethystic Murnaghan--Nakayama rule is obtained and utilized to derive a general formula of the expansion coefficients of $s_{\nu}$ in the plethysm product…
The generating function for restricted partitions is a finite product with a Laurent expansion at each root of unity. The question of the behavior of these Laurent coefficients as the size of the product increases goes back to Rademacher…
A particular case of degenerate Clebsch-Gordan coefficient can be expressed with three binomial coefficients. Such a formula, which may be obtained using the standard ladder operator procedure, can also be derived from the Racah-Shimpuku…
We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…
The coefficients of the generating function $(q;q)^\alpha_\infty$ produce $p_\alpha(n)$ for $\alpha \in \mathbb{Q}$. In particular, when $\alpha = -1$, the partition function is obtained. Recently, Chan and Wang identified and proved…
In this paper, we discuss the properties of the generating functions of spin Hurwitz numbers. In particular, for spin Hurwitz numbers with arbitrary ramification profiles, we construct the weighed sums which are given by Orlov's…
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon…
The plethystic Murnaghan-Nakayama rule describes how to decompose the product of a Schur function and a plethysm of the form $p_r\circ h_m$ as a sum of Schur functions. We provide a short, entirely combinatorial proof of this rule using the…
The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…