English
Related papers

Related papers: A simplified Kronecker rule for one hook shape

200 papers

We consider Buch's rule for K-theory of the Grassmannian, in the Schur multiplicity-free cases classified by Stembridge. Using a result of Knutson, one sees that Buch's coefficients are related to Moebius inversion. We give a direct…

Combinatorics · Mathematics 2009-02-12 Michelle Snider

Recently, Kupavskii~[{\it On random subgraphs of {K}neser and {S}chrijver graphs. J. Combin. Theory Ser. A, {\rm 2016}.}] investigated the chromatic number of random Kneser graphs $\KG_{n,k}(\rho)$ and proved that, in many cases, the…

Combinatorics · Mathematics 2016-08-16 Meysam Alishahi , Hossein Hajiabolhassan

We continue the study of quantum A-polynomials -- equations for knot polynomials with respect to their coloring (representation-dependence) -- as the relations between different links, obtained by hanging additional ``simple'' components on…

High Energy Physics - Theory · Physics 2025-09-01 Dmitry Galakhov , Alexei Morozov

In this article, we construct generalized harmonic univalent mappings and find its coefficients bounds. We present the counterexample to validate the coefficient conjecture proposed by Clunie and Sheil-Small for the class of functions…

Complex Variables · Mathematics 2026-02-17 Omendra Mishra , Asena Çetinkaya

We propose that geometric quantization of symplectic manifolds is the arrow part of a functor, whose object part is deformation quantization of Poisson manifolds. The `quantization commutes with reduction' conjecture of Guillemin and…

Mathematical Physics · Physics 2007-05-23 N. P. Landsman

We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the…

Combinatorics · Mathematics 2009-11-10 J. Haglund , M. Haiman , N. Loehr

Hofmman's bound on the chromatic number of a graph states that $\chi \geq 1 - \frac {\lambda_1} {\lambda_n}$. Here we show that the same bound, or slight modifications of it, hold for several graph parameters related to the chromatic…

Combinatorics · Mathematics 2007-05-23 Yonatan Bilu

The purpose of this note is to give an insertion scheme proof of the formula, $$p_\mu = \sum_{\lambda\vdash k} \chi^\lambda(\mu)s_\lambda,\formula$$ where $p_\mu$ is the power sum symmetric function, $s_\lambda$ is the Schur function and…

Representation Theory · Mathematics 2016-09-06 Arun Ram

Lascoux stated that the type A Kostka-Foulkes polynomials K_{lambda,mu}(t) expand positively in terms of so-called atomic polynomials. For any semisimple Lie algebra, the former polynomial is a t-analogue of the multiplicity of the dominant…

Representation Theory · Mathematics 2019-07-30 Cedric Lecouvey , Cristian Lenart

We establish a formula for the classes of certain tori in the Grothendieck ring of varieties, in terms of its lambda-structure. More explicitly, we will see that if L* is the torus of invertible elements in the n-dimensional separable…

Algebraic Geometry · Mathematics 2012-10-08 Karl Rökaeus

In this paper, we study positivity phenomena for the $e$-coefficients of Stanley's chromatic function of a graph. We introduce a new combinatorial object: the {\em correct} sequences of unit interval orders, and using these, in certain…

Combinatorics · Mathematics 2017-03-20 Alexander Paunov , András Szenes

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

Combinatorics · Mathematics 2024-12-31 Graham Hawkes

Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of…

Combinatorics · Mathematics 2016-10-20 Pedro M. Recuero

We give a proof of the generalized Cauchy identity for double Grothendieck polynomials, a combinatorial interpretation of the stable double Grothendieck polynomials in terms of triples of tableaux, and an interpolation between the stable…

Combinatorics · Mathematics 2024-12-31 Graham Hawkes

In this paper, we present a direct bijective proof of the hook-length formula for standard immaculate tableaux, which arose in the study of non-commutative symmetric functions. Our proof is along the spirit of Novelli, Pak and…

Combinatorics · Mathematics 2015-03-17 Emma L. L. Gao , Arthur L. B. Yang

A well-known result of Stanley's shows that given a graph $G$ with chromatic symmetric function expanded into the basis of elementary symmetric functions as $X_G = \sum c_{\lambda}e_{\lambda}$, the sum of the coefficients $c_{\lambda}$ for…

Combinatorics · Mathematics 2025-05-16 Logan Crew , Yongxing Zhang

While Euler characteristic X(G)=sum_x w(x) super counts simplices, Wu characteristics w_k(G) = sum_(x_1,x_2,...,x_k) w(x_1)...w(x_k) super counts simultaneously pairwise interacting k-tuples of simplices in a finite abstract simplicial…

Combinatorics · Mathematics 2018-03-20 Oliver Knill

In this paper, we present a simple combinatorial proof of a Weyl type formula for hook Schur polynomials, which has been obtained by using a Kostant type cohomology formula for $\frak{gl}_{m|n}$. In general, we can obtain in a combinatorial…

Representation Theory · Mathematics 2007-05-23 Jae-Hoon Kwon

There are several topological results ensuring the existence of a large complete bipartite subgraph in any properly colored graph satisfying some special topological regularity conditions. In view of $\mathbb{Z}_p$-Tucker lemma, Alishahi…

Combinatorics · Mathematics 2016-07-05 Meysam Alishahi

The ${\mathbb B}_n^{(k)}$ poly-Bernoulli numbers --- a natural generalization of classical Bernoulli numbers ($B_n={\mathbb B}_n^{(1)}$) --- were introduced by Kaneko in 1997. When the parameter $k$ is negative then ${\mathbb B}_n^{(k)}$ is…

Combinatorics · Mathematics 2015-10-21 Beáta Bényi , Peter Hajnal