Related papers: Kazhdan-Lusztig combinatorics in the moment graph …

Harvey Friedman's gap condition on embeddings of finite labelled trees plays an important role in combinatorics (proof of the graph minor theorem) and mathematical logic (strong independence results). In the present paper we show that the…

We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…

Paolo Aluffi, inspired by an algebro-geometric problem, asked when the Kirchhoff polynomial of a graph is in the Jacobian ideal of the Kirchhoff polynomial of the same graph with one edge deleted. We give some results on which graph-edge…

In this paper, we introduce a notion of clock moves for spanning trees in plane graphs. This enables us to develop a spanning tree model of an Alexander polynomial for a plane graph and prove the unimodal property of its associate…

The Kawaguchi--Silverman conjecture predicts that if $f\colon X \dashrightarrow X$ is a dominant rational-self map of a projective variety over $\overline{\mathbb{Q}}$, and $P$ is a $\overline{\mathbb{Q}}$-point of $X$ with Zariski-dense…

We develop a bar involution and canonical basis for every morphism space of the oriented skein category through a diagrammatic approach. In particular, our construction gives rise to Kazhdan-Lusztig type bases on quantized walled Brauer…

We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is best possible.

Timed words are words where letters of the alphabet come with time stamps. We extend the definitions of semistandard tableaux, insertion, Knuth equivalence, and the plactic monoid to the setting of timed words. Using this, Greene's theorem…

We use the affine Robinson-Schensted correspondence to describe the structure of bidirected edges in the Kazhdan-Lusztig cells in affine type A. Equivalently, we give a comprehensive description of the Knuth equivalence classes of affine…

For arbitrary Coxeter systems, we prove that inverse Kazhdan-Lusztig polynomials satisfy a monotonicity property. This follows from the validity of Soergel's conjecture and the existence of injective morphisms between Rouquier complexes in…

In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of the box order and the dominance order for {tableaux}. Both…

Kontsevich's graphs from deformation quantisation allow encoding multi-vectors whose coefficients are differential-polynomial in components of Poisson brackets on finite-dimensional affine manifolds. The calculus of Kontsevich graphs can be…

With an eye to applications to type A and Schur-Weyl duality, we study Kazhdan-Lusztig bases for a general parabolic Hecke algebra. Parabolic Hecke algebras are idempotent subalgebras of Hecke algebras corresponding to parabolic subgroups,…

The characters of Kazhdan--Lusztig elements of the Hecke algebra over $S_n$ (and in particular, the chromatic symmetric function of indifference graphs) are completely encoded in the (intersection) cohomology of certain subvarieties of the…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

If $A$ is a finite-dimensional algebra graded by a group $G$, and $\sigma \in G$, we define a variant of paratrophic matrix associated with $A$ and $\sigma$, and we use it to characterize the $\sigma$-graded Frobenius property for $A$. We…

We prove that the combinatorial Weisfeiler-Leman algorithm of dimension $(3k+4)$ is a complete isomorphism test for the class of all graphs of rank width at most $k$. Rank width is a graph invariant that, similarly to tree width, measures…

We compare crystal combinatorics of the level 2 Fock space with the classification of unitary irreducible representations of type B rational Cherednik algebras to study how unitarity behaves under parabolic restriction. First, we show that…

We use power sums plethysm operators to introduce H functions which interpolate between the Weyl characters and the Hall-Littlewood functions Q' corresponding to classical Lie groups. The coefficients of these functions on the basis of Weyl…

For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight…