Related papers: RC-graphs and a generalized Littlewood-Richardson …
The $2$-decomposition for ribbon graphs was introduced in [Annals of Combinatorics 15 (2011), pp 675-706]. We extend this result to half-edged ribbon graphs and to rank $D$-weakly colored graphs [SIGMA 12 (2016), 030], generalizing…
We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs [Embedding graphs with bounded degree in sparse pseudorandom graphs,…
We use Young's raising operators to derive a Pieri rule for the ring generated by the indeterminates $h_{r,s}$ given in Macdonald's 9th Variation of the Schur functions. Under an appropriate specialisation of $h_{r,s}$, we derive the Pieri…
We introduce multivariate generalizations of the Bernstein-Szego polynomials, which are associated to the root systems of the complex simple Lie algebras. The multivariate polynomials in question generalize Macdonald's Hall-Littlewood…
We present a library of formalized results around symmetric functions and the character theory of symmetric groups. Written in Coq/Rocq and based on the Mathematical Components library, it covers a large part of the contents of a graduate…
We consider the uniqueness of solution (i.e., nonsingularity) of systems of $r$ generalized Sylvester and $\star$-Sylvester equations with $n\times n$ coefficients. After several reductions, we show that it is sufficient to analyze periodic…
Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we…
Series solutions for a large family of single equation Dyson-Schwinger equations are given as expansions over decorated rooted connected chord diagrams. The analytic input to the new expansions are the expansions of the regularized…
A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…
We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…
The Stanley-Stembridge conjecture associates a symmetric function to each natural unit interval order $\mathcal P$. In this paper, we define relations \`a la Knuth on the symmetric group for each $\mathcal P$ and conjecture that the…
At finite N the number of restricted Schur polynomials is greater than or equal to the number of generalized restricted Schur polynomials. In this note we study this discrepancy and explain its origin. We conclude that, for quiver gauge…
We establish a generalization of Littlewood's criterion on $L^\alpha$-flatness by proving that there is no $L^\alpha$-flat polynomials, $\alpha>0$, within the class of analytic polynomials on the unit circle of the form $…
Recently we explained that the classical $Q$ Schur functions stand behind various well-known properties of the cubic Kontsevich model, and the next step is to ask what happens in this approach to the generalized Kontsevich model (GKM) with…
In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…
We connect generalized permutahedra with Schubert calculus. Thereby, we give sufficient vanishing criteria for Schubert intersection numbers of the flag variety. Our argument utilizes recent developments in the study of Schubitopes, which…
We construct new "standard modules" for the representations of general linear groups over a local non-archimedean field. The construction uses a modified Robinson-Schensted-Knuth correspondence for Zelevinsky's multisegments. Typically, the…
Mitosis is a rule introduced by [Knutson-Miller, 2002] for manipulating subsets of the n by n grid. It provides an algorithm that lists the reduced pipe dreams (also known as rc-graphs) [Fomin-Kirillov, Bergeron-Billey] for a permutation w…
Motivated by classical combinatorial Schubert calculus on the Grassmannian, Huang--Pylyavskyy introduced a generalized theory of Robinson-Schensted-Knuth (RSK) correspondence for studying Schubert calculus on the complete flag variety via…
Recent years are characterized by an unprecedented quantity of available network data which are produced at an astonishing rate by an heterogeneous variety of interconnected sensors and devices. This high-throughput generation calls for the…