Javascript must be enabled to continue!
Matroid relaxations and Kazhdan–Lusztig non-degeneracy
View through CrossRef
In this paper we study the interplay between the operation of circuit-hyperplane relaxation and the Kazhdan–Lusztig theory of matroids. We obtain a family of polynomials, not depending on the matroids but only on their ranks, that relate the Kazhdan–Lusztig, the inverse Kazhdan–Lusztig and the
Z
-polynomial of each matroid with those of its relaxations. As an application of our main theorem, we prove that all matroids having a free basis are non-degenerate. Additionally, we obtain bounds and explicit formulas for all the coefficients of the Kazhdan–Lusztig, inverse Kazhdan–Lusztig and
Z
-polynomial of all sparse paving matroids.
Title: Matroid relaxations and Kazhdan–Lusztig non-degeneracy
Description:
In this paper we study the interplay between the operation of circuit-hyperplane relaxation and the Kazhdan–Lusztig theory of matroids.
We obtain a family of polynomials, not depending on the matroids but only on their ranks, that relate the Kazhdan–Lusztig, the inverse Kazhdan–Lusztig and the
Z
-polynomial of each matroid with those of its relaxations.
As an application of our main theorem, we prove that all matroids having a free basis are non-degenerate.
Additionally, we obtain bounds and explicit formulas for all the coefficients of the Kazhdan–Lusztig, inverse Kazhdan–Lusztig and
Z
-polynomial of all sparse paving matroids.
Related Results
Parallel algorithms for matroid intersection and matroid parity
Parallel algorithms for matroid intersection and matroid parity
A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that determining the existence of a common base (basic mat...
Topics in matroid union
Topics in matroid union
The operation of matroid union was introduced by Nash-Williams in 1966. A
matroid is indecomposable if it cannot be written in the form M = M1 V
M2, where r(M1),r(M2) > 0. In ...
A Gröbner basis for Kazhdan-Lusztig ideals
A Gröbner basis for Kazhdan-Lusztig ideals
{\it Kazhdan-Lusztig ideals}, a family of generalized determinantal ideals
investigated in [Woo-Yong~'08], provide an explicit choice of coordinates
and equations encoding a neig...
Generic Algebras and Kazhdan-Lusztig Theory for Monomial Groups
Generic Algebras and Kazhdan-Lusztig Theory for Monomial Groups
The Iwahori-Hecke algebras of Coxeter groups play a central role in the study of representations of semisimple Lie-type groups. An important tool is the combinatorial approach to r...
On the torsion part in the cohomology of Deligne-Lusztig varieties
On the torsion part in the cohomology of Deligne-Lusztig varieties
Sur la partie de torsion dans la cohomologie des variétés Deligne–Lusztig
Dans cette thèse, nous étudions quelques méthodes géométriques dues à Deligne et Lusztig p...
Covering Cycle Matroid
Covering Cycle Matroid
Covering is a type of widespread data representation while covering-based rough sets provide an efficient and systematic theory to deal with this type of data. Matroids are based o...
A Combinatorial Formula for Kazhdan-Lusztig Polynomials of $\rho$-Removed Uniform Matroids
A Combinatorial Formula for Kazhdan-Lusztig Polynomials of $\rho$-Removed Uniform Matroids
Let $\rho$ be a non-negative integer. A $\rho$-removed uniform matroid is a matroid obtained from a uniform matroid by removing a collection of $\rho$ disjoint bases. We present a ...
Faster Matroid Partition Algorithms
Faster Matroid Partition Algorithms
In the matroid partitioning problem, we are given
\(k\)
matroids
\(\mathcal{M}_{1}=(V,\mathcal{I}_{1}...

