Related papers: Kronecker coefficients for one hook shape
An element [\Phi] of the Grassmannian of n-dimensional subspaces of the Hardy space H^2, extended over the field C(x_1,..., x_n), may be associated to any polynomial basis {\phi} for C(x). The Pl\"ucker coordinates…
Suppose $\mu$ is a partition of $n$ and $\lambda$ a composition of $n$, and let $S^\mu$, $M^\lambda$ denote the Specht module and permutation module defined by Dipper and James for the Iwahori--Hecke algebra $\mathscr{H}_n$ of the symmetric…
Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…
We consider two examples of a fully decodable combinatorial encoding of Bernoulli schemes: the encoding via Weyl simplices and the much more complicated encoding via the RSK (Robinson--Schensted--Knuth) correspondence. In the first case,…
The Schur function indexed by a partition lambda with at most n parts is the sum of the weight monomials for the Young tableaux of shape lambda. Let pi be an n-permutation. We give two descriptions of the tableaux that contribute their…
A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…
In this paper we show that the leading coefficient $\mu(y,w)$ of some Kazhdan-Lusztig polynomials $P_{y,w}$ with $y,w$ in an affine Weyl group of type $\tilde B_n$ (resp. $\tilde C_n$ or $\tilde D_n$) is $n$ (resp. $n+1$).
In this paper, we evaluate a smoothed sum of the form $\displaystyle \sideset{}{^*}\sum_{d \leq X}\left(\sum_{n \leq Y} \left(\frac{8d}{n} \right ) \right)^2$, where $\left ( \frac{8d}{\cdot} \right )$ is the Kronecker symbol and…
In this paper, we evaluate asymptotically the sum \[ \sum_{d \leq X} \left( \sum_{n \leq Y} \mu(n)\leg {8d}{n} \right)^2, \] where $\leg {8d}{n}$ is the Kronecker symbol and $d$ runs over positive, odd, square-free integers.
In this paper, we first give explicit formulas for the number of solutions of unweighted linear congruences with distinct coordinates. Our main tools are properties of Ramanujan sums and of the discrete Fourier transform of arithmetic…
The machinery of noncommutative Schur functions provides a general tool for obtaining Schur expansions for combinatorially defined symmetric functions. We extend this approach to a wider class of symmetric functions, explore its strengths…
We show that the flagged Grothendieck polynomials defined as the generating functions of flagged set-valued tableaux of Knutson-Miller-Yong can be expressed by a Jacobi-Trudi type determinant formula generalizing the work of…
The commutative Hopf monoid of set compositions is a fundamental Hopf monoid internal to vector species, having undecorated bosonic Fock space the combinatorial Hopf algebra of quasisymmetric functions. We construct a geometric realization…
Given an positive integer $k$, let $n:=\binom{k+1}{2}$. In 2012, during a talk at UCLA, Jan Saxl conjectured that all irreducible representations of the symmetric group $S_n$ occur in the decomposition of the tensor square of the…
This article studies some new insertion algorithms that associate pairs of shifted tableaux to finite integer sequences in which certain terms may be primed. When primes are ignored in the input word these algorithms reduce to known…
The variety of complete quadrics is the wonderful compactification of $GL_n/O_n$ and admits a cell decomposition into Borel orbits indexed by combinatorial objects called $\mu$-involutions. We study Coxeter-theoretic properties of…
The whole enterprise of spin compositions can be recast as simple enumerative combinatoric problems. We show here that enumerative combinatorics (EC)\citep{book:Stanley-2011} is a natural setting for spin composition, and easily leads to…
We define an analog of David Little's algorithm for reduced words in type B, and investigate its main properties. In particular, we show that our algorithm preserves the recording tableau of Kra\'{s}kiewicz insertion, and that it provides a…
Using the Gordon-Litherland pairing, one can define invariants (signature, nullity, determinant) for ${\mathbb Z}/2$ null-homologous links in thickened surfaces. In this paper, we study the concordance properties of these invariants. For…
Let $G$ be a connected graph and let $\mathbb{X}$ be the set of projective points defined by the column vectors of the incidence matrix of $G$ over a field $K$ of any characteristic. We determine the generalized Hamming weights of the…