Related papers: Difference operators for partitions and some appli…

In 2008, Han rediscovered an expansion of powers of Dedekind $\eta$ function due to Nekrasov and Okounkov by using Macdonald's identity in type $\widetilde{A}$. In this paper, we obtain new combinatorial expansions of powers of $\eta$, in…

Let D_v the difference operator and q-difference operators defined by D_\omega p(x) = \frac{p(x+\omega)-p(x)}{\omega} and D_q p(x) = \frac{p(qx)-p(x)}{(q-1)x}, respectively. Let U and V be two moment regular linear functionals and let…

The Nekrasov-Okounkov formula gives an expression for the Fourier coefficients of the Euler functions as a sum of hook length products. This formula can be deduced from a specialization in a renormalization of the affine type $A$ Weyl…

This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…

A long standing problem of Gian-Carlo Rota for associative algebras is the classification of all linear operators that can be defined on them. In the 1970s, there were only a few known operators, for example, the derivative operator, the…

The classical hook length formula of enumerative combinatorics expresses the number of standard Young tableaux of a given partition shape as a single fraction. In recent years, two generalizations of this formula have emerged: one by Pak…

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

There is a growing body of work on proving hardness results for average-case estimation problems by bounding the low-degree advantage (LDA) - a quantitative estimate of the closeness of low-degree moments - between a null distribution and a…

It is well known that the classical families of orthogonal polynomials are characterized as eigenfunctions of a second order linear differential/difference operator. In this paper we present a study of classical orthogonal polynomials in a…

The use of operator-splitting methods to solve differential equations is widespread, but the methods are generally only defined for a given number of operators, most commonly two. Most operator-splitting methods are not generalizable to…

Consider a classical elliptic pseudodifferential operator $P$ on ${\Bbb R}^n$ of order $2a$ ($0<a<1)$ with even symbol. For example, $P=A(x,D)^a$ where $A(x,D)$ is a second-order strongly elliptic differential operator; the fractional…

The Sklyanin algebra $S_{\eta}$ has a well-known family of infinite-dimensional representations $D(\mu)$, $\mu \in C^*$, in terms of difference operators with shift $\eta$ acting on even meromorphic functions. We show that for generic…

A number of recent papers have estimated ratios of the partition function $p(n-j)/p(n)$, which appears in many applications. Here, we prove an easy-to-use effective bound on these ratios. Using this, we then study second shifted difference…

The symplectic/orthogonal contents of partitions are related to the dimensions of irreducible representations of symplectic/orthogonal groups. In 2012, motivated by Nekrasov--Okounkov's hook-length formula and Stanley's hook-content…

Let $(p_n)_n$ be either the $q$-Meixner or the $q$-Laguerre polynomials. We form a new sequence of polynomials $(q_n)_n$ by considering a linear combination of two consecutive $p_n$: $q_n=p_n+\beta_np_{n-1}$, $\beta_n\in \RR$. Using the…

We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for…

Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over…

Let $G$ be a compact connected Lie group with a maximal torus $T$. Let $A$, $B$ be $G$-$\mathrm{C}^\ast$-algebras. We define certain divided difference operators on Kasparov's $T$-equivariant $KK$-group $KK_T(A,B)$ and show that $KK_G(A,B)$…

For primes $\ell$ and nonnegative integers $a$, we study the partition functions $$p_\ell(a;n):= \#\{\lambda \vdash n : \text{ord}_\ell(H(\lambda))=a\},$$ where $H(\lambda)$ denotes the product of hook lengths of a partition $\lambda$.…

In many experimental designs -- split-plots, blocked or nested layouts, fractional factorials, and studies with missing or unequal replication -- standard ANOVA procedures no longer tell us exactly how many independent pieces of information…