Related papers: Kazhdan-Lusztig combinatorics in the moment graph …
The purpose of this short note is to show how it is possible to combine existing results in the literature to get the unique continuation from sets of positive measure for time dependent parabolic equations with Lipschitz principal part and…
Special matchings are purely combinatorial objects associated with a partially ordered set, which have applications in Coxeter group theory. We provide an explicit characterization and a complete classification of all special matchings of…
We show that coefficients in unicellular LLT polynomials are evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements. We express these in terms of traditional trace bases, induction, and Kazhdan-Lusztig R-polynomials.
We introduce deformations of Kazhdan-Lusztig elements and specialised nonsymmetric Macdonald polynomials, both of which form a distinguished basis of the polynomial representation of a maximal parabolic subalgebra of the Hecke algebra. We…
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…
New bispectral polynomials orthogonal on a quadratic bi-lattice are obtained from a truncation of Wilson polynomials. Recurrence relation and difference equation are provided. The recurrence coefficients can be encoded in a perturbed…
We study factorization algebras on configuration spaces of points on the curved, colored by elements of the root lattice. We show that the factorization algebra attached to Lusztig's quantum group can be obtained as a direct image of a…
We consider discrete one dimensional nonlinear equations and present the procedure of lifting them to Z-graded graphs. We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. In particular, we prove…
We derive a quadratic-time algorithm for the genus distribution of any 3-regular, biconnected series-parallel graph, which we extend to any biconnected series-parallel graph of maximum degree at most 3. Since the biconnected components of…
We survey three settings in which dimensions of intersection cohomology groups of algebraic varieties provide deep combinatorial and representation-theoretic information, and computations of the groups themselves have been made using…
We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph…
The class of Parikh word representable graphs were recently introduced. In this work, we further develop its general theory beyond the binary alphabet. Our main result shows that this class is equivalent to the class of bipartite…
Consider a cohomologically hyperbolic birational self-map defined over the algebraic numbers, for example, a birational self-map in dimension two with the first dynamical degree greater than one, or in dimension three with the first and the…
We determine generators of the rational cohomology algebras of moduli spaces of parabolic vector bundles on a curve, under some `primality' conditions on the parabolic datum. These generators are canonical in a precise sense. Our results…
We explain a strategy for a proof of the positivity of all coefficients of Kazhdan-Lusztig-polynomials for arbitrary Coxeter groups by constructing spaces whose dimensions we conjecture to be these coefficients.
The goal of this note is to give a geometric interpretation of a theorem of Brenti that calculates Kazhdan-Lusztig polynomials associated to Coxeter groups, if the Coxeter group is isomorphic to a Weyl group. ----- Le but de cette note est…
We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like…
We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…