Related papers: Constructive Method for Finding the Coefficients o…

The double Schur functions form a distinguished basis of the ring \Lambda(x||a) which is a multiparameter generalization of the ring of symmetric functions \Lambda(x). The canonical comultiplication on \Lambda(x) is extended to…

In this article, we will prove the Giambelli formula for Schur multiple zeta-functions of extended shape which we call laced type, using the combinatorial method of proving the Giambelli formula for Schur function by Egecioglu and Remmel.…

We review and present new studies on the relation between the partition functions of integrable lattice models and symmetric polynomials, and its combinatorial representation theory based on the correspondence, including our work. In…

We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…

For a positive integer $d$, a connected graph $\Gamma$ is a symmetrical 2-extension of the $d$-dimensional grid $\Lambda^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $\Gamma$ and its imprimitivity system $\sigma$…

For a given skew shape, we build a crystal graph on the set of all reverse plane partitions that have this shape. As a consequence, we get a simple extension of the Littlewood-Richardson rule for the expansion of the corresponding dual…

Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…

In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…

Distinguished selfadjoint extensions of operators which are not semibounded can be deduced from the positivity of the Schur Complement (as a quadratic form). In practical applications this amounts to proving a Hardy-like inequality.…

The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…

For any positive integer $k$ and nonnegative integer $m$, we consider the symmetric function $G\left( k,m\right)$ defined as the sum of all monomials of degree $m$ that involve only exponents smaller than $k$. We call $G\left( k,m\right)$ a…

This is an introductory review to localization techniques in supersymmetric two-dimensional gauge theories. In particular we describe how to construct Lagrangians of N=(2,2) theories on curved spaces, and how to compute their partition…

The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Let $P$ be the set of integer partitions and $D$ the subset of those with distinct parts. We extend a correspondence of Burge between partitions and binary words to give encodings of both $D$ and $D$ as words over a $k$-ary alphabet, for…

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

A $(d_1,d_2)$-biregular bipartite graph $G=(L\cup R,E)$ is called left-$(m,\delta)$ unique-neighbor expander iff each subset $S$ of the left vertices with $|S|\leq m$ has at least $\delta d_1|S|$ unique-neighbors, where unique-neighbors…

We provide combinatorial arguments based on a two-dimensional extension of a locally-free semigroup allowing us to compute the growth rate, $\Lambda$, of the partition function $Z_N=N^{\theta}\Lambda^N$ of the $N$-particle directed animals…

We compute the partition function of $\mathcal N=2$ supersymmetric mixed dimensional QED on a squashed hemisphere using localization. Mixed dimensional QED is an abelian gauge theory coupled to charged matter fields at the boundary. The…