English
Related papers

Related papers: A simplified Kronecker rule for one hook shape

200 papers

Several bases of the Garsia-Haiman modules for hook shapes are given, as well as combinatorial decomposition rules for these modules. These bases and rules extend the classical ones for the coinvariant algebra of type $A$. We also give a…

Representation Theory · Mathematics 2007-05-23 Ron M. Adin , Jeffrey B. Remmel , Yuval Roichman

A graph $G$ is said to be Ramsey for a tuple of graphs $(H_1,\dots,H_r)$ if every $r$-coloring of the edges of $G$ contains a monochromatic copy of $H_i$ in color $i$, for some $i$. A fundamental question at the intersection of Ramsey…

Combinatorics · Mathematics 2024-08-21 Micha Christoph , Anders Martinsson , Raphael Steiner , Yuval Wigderson

A combinatorial description of the crystal $\mathcal{B}(\infty)$ for finite-dimensional simple Lie algebras in terms of Young tableaux was developed by J. Hong and H. Lee. Using this description, we obtain a combinatorial rule for…

Combinatorics · Mathematics 2012-02-20 Kyu-Hwan Lee , Ben Salisbury

Let $k \leq n$ be nonnegative integers and let $\lambda$ be a partition of $k$. S. Griffin recently introduced a quotient $R_{n,\lambda}$ of the polynomial ring $\mathbb{Q}[x_1, \dots, x_n]$ in $n$ variables which simultaneously generalizes…

Combinatorics · Mathematics 2020-04-03 Brendon Rhoades , Tianyi Yu , Zehong Zhao

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

Metric Geometry · Mathematics 2016-09-06 Carsten Schütt

In this article we give a combinatorial formula for a certain class of Koornwinder polynomials, also known as Macdonald polynomials of type $\tilde{C}$. In particular, we give a combinatorial formula for the Koornwinder polynomials…

Combinatorics · Mathematics 2024-05-21 Sylvie Corteel , Olya Mandelshtam , Lauren Williams

The aim of this paper is twofold. One is to introduce the class of harmonic $\nu$-Bloch-type mappings as a generalization of harmonic $\nu$-Bloch mappings and thereby we generalize some recent results of harmonic $1$-Bloch-type mappings…

Complex Variables · Mathematics 2017-07-07 Gang Liu , Saminathan Ponnusamy

We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…

Representation Theory · Mathematics 2022-11-29 Sridhar P. Narayanan , Digjoy Paul , Amritanshu Prasad , Shraddha Srivastava

In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…

Combinatorics · Mathematics 2023-11-21 Martin Dzúrik

Egecioglu and Remmel gave an interpretation for the entries of the inverse Kostka matrix K^{-1} in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK^{-1}=I but were unable to…

Combinatorics · Mathematics 2007-05-23 Bruce E. Sagan , Jaejin Lee

Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley--Stembridge…

Combinatorics · Mathematics 2025-02-11 Jacob P. Matherne , Alejandro H. Morales , Jesse Selover

Let $G$ be a simple graph on $d$ vertices. We define a monomial ideal $K$ in the Stanley-Reisner ring $A$ of the order complex of the Boolean algebra on $d$ atoms. The monomials in $K$ are in one-to-one correspondence with the proper…

Combinatorics · Mathematics 2007-05-23 Einar Steingrimsson

In this paper, we give a combinatorial rule to calculate the decomposition of the tensor product (Kronecker product) of two irreducible complex representations of the symmetric group ${\mathfrak S}_n$, when one of the representations…

Representation Theory · Mathematics 2015-07-09 Takahiro Hayashi

We consider topological groupoids in finite and also in a compact settings. In the initial sections, we introduce definitions of typical observables and we studied them in the context of statistical mechanics and quantum mechanics. We…

Mathematical Physics · Physics 2023-03-22 Artur O. Lopes , Marcos Sebastian , Victor Vargas

Using a multivariable Faa di Bruno formula we give conditions on transformations $\tau:[0,1]^m\to\mathcal{X}$ where $\mathcal{X}$ is a closed and bounded subset of $\mathbb{R}^d$ such that $f\circ\tau$ is of bounded variation in the sense…

Computation · Statistics 2015-12-10 Kinjal Basu , Art B. Owen

We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small $m$-Schr\"oder paths and give a bijection between the set of increasing rectangular tableaux and small…

Combinatorics · Mathematics 2018-08-20 Timothy Pressey , Anna Stokke , Terry Visentin

Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…

Combinatorics · Mathematics 2007-05-23 Cristian Lenart

We present combinatorial operators for the expansion of the Kronecker product of irreducible representations of the symmetric group. These combinatorial operators are defined in the ring of symmetric functions and act on the Schur functions…

Representation Theory · Mathematics 2016-09-07 Alain Goupil , Cedric Chauve

By considering the specialisation $s_{\lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $\lambda$ in terms of two properties of the boxes in…

Combinatorics · Mathematics 2019-08-15 Peter S. Campbell , Anna Stokke

Given a finite simple graph G=(V,E) with chromatic number c and chromatic polynomial C(x). Every vertex graph coloring f of G defines an index i_f(x) satisfying the Poincare-Hopf theorem sum_x i_f(x)=chi(G). As a variant to the index…

Combinatorics · Mathematics 2014-10-07 Oliver Knill