Fabrizio Caselli, Mario Marietti
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 any lower Bruhat interval. The results hold in any arbitrary Coxeter group and have also applications in the study of the corresponding parabolic Kazhdan--Lusztig polynomials.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter elements are rotation equivalent if their words can be transformed into each other through a sequence of rotations and legal commutations. We prove that Coxeter elements are conjugate if and only if they are rotation equivalent. This was known for some special cases but not for Coxeter groups in general.
We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that the projections on the right parabolic quotients are always order preserving. We also introduce the notion of $k$-Bruhat graph, $k$-absolute length and $k$-absolute order, proposing some related conjectures and problems.
We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order on the wreath product $\mathbb{Z} \_r \wr S\_n$ introduced by Adin, Brenti and Roichman, are special instances of our construction. We conclude by associating a quasi-symmetric function to each element of these posets. In the $A$ and $\widetilde{A}$ cases, this function coincides respectively with the classical Stanley symmetric function, and with Lam's affine…
We prove that the combinatorial concept of a special matching can be used to compute the parabolic Kazhdan-Lusztig polynomials of doubly laced Coxeter groups and of dihedral Coxeter groups. In particular, for this class of groups which includes all Weyl groups, our results generalize to the parabolic setting the main results in [Advances in Math. {202} (2006), 555-601]. As a consequence, the parabolic Kazhdan-Lusztig polynomial indexed by $u$ and $v$ depends only on the poset structure of the Bruhat interval from the identity element to $v$ and on which elements of that interval are minimal co…
A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated rank generating polynomial divides the rank generating polynomial of the absolute order on $W$ are investigated when $W$ is finite. Several examples, including a symmetric group action on perfect matchings, are discussed. As an application, a well-behaved absolute order on the alternating subgroup of $W$ is defined.
We give a simple characterization of special matchings in lower Bruhat intervals (that is, intervals starting from the identity element) of a Coxeter group. As a byproduct, we obtain some results on the action of special matchings.
We continue the study of the maximally clustered elements for simply laced Coxeter groups which were recently introduced by Losonczy. Such elements include as a special case the freely braided elements of Losonczy and the author, which in turn constitute a superset of the $iji$-avoiding elements of Fan. Our main result is to classify the MC-finite Coxeter groups, namely those Coxeter groups having finitely many maximally clustered elements. Remarkably, any simply laced Coxeter group having finitely many $iji$-avoiding elements also turns out to be MC-finite.
We study Morse subgroups and Morse boundaries of random right-angled Coxeter groups in the Erdős--Rényi model. We show that at densities below $\left(\sqrt{\frac{1}{2}}-ε\right)\sqrt{\frac{\log{n}}{n}}$ random right-angled Coxeter groups almost surely have Morse hyperbolic surface subgroups. This implies their Morse boundaries contain embedded circles and they cannot be quasi-isometric to a right-angled Artin group. Further, at densities above $\left(\sqrt{\frac{1}{2}}+ε\right)\sqrt{\frac{\log{n}}{n}}$ we show that, almost surely, the hyperbolic Morse special subgroups of a random right-angled…
Boolean intervals in the weak Bruhat order of a finite Coxeter group
本文对所有有限Coxeter群统一刻画了弱Bruhat序中的布尔区间，给出计数公式，并推广到C_n和D_n型，恢复并扩展了A_n型的已知结果。
Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-analog of Euler's exponential generating function formula for the Eulerian numbers. They are defined via the symmetric group, and applying the stable and nonstable principal specializations yields formulas for joint distributions of permutation statistics. We consider the wreath product of the cyclic group with the symmetric group, also known as the group of colored permutations. We use this group to introduce colored Eulerian quasisymmetric functions, which are a generalization of Eulerian quasisy…
For any finite Coxeter system $(W,S)$ we construct a certain noncommutative algebra, so-called {\it bracket algebra}, together with a familiy of commuting elements, so-called {\it Dunkl elements.} Dunkl elements conjecturally generate an algebra which is canonically isomorphic to the coinvariant algebra of the group $W.$ We prove this conjecture for classical Coxeter groups and $I_2(m)$. We define a ``quantization'' and a multiparameter deformation of our construction and show that for Lie groups of classical type and $G_2,$ the algebra generated by Dunkl elements in the quantized bracket alge…
We consider a generalization of the fundamental theorem of finitely generated abelian groups for some non-abelian groups, which is called OGS. First, we consider the dihedral group, which is a non-abelian extension of an abelian group by an involution. Then, we focus on a special case, where the abelian group is cyclic, which is the two-generated Coxeter group I{2}(m). We mention interesting connections between the reduced Coxeter presentation and a particular OGS canonical presentation, which we call the standard OGS canonical presentation. These connections motivate us to offer a generalizat…
The star operation, originally introduced by Kazhdan and Lusztig, was later specialized by Ernst to the so-called weak star reduction on the set of fully commutative elements of a Coxeter group. In this paper, we classify the star and weak star irreducible fully commutative elements in Coxeter groups of affine types $\widetilde{B}_{n+1}$ and $\widetilde{D}_{n+2}$. Focusing then on the case of type $\widetilde{D}_{n+2}$, we use the classification of star irreducible elements to provide a new proof of the faithfulness of a diagrammatic representation of the corresponding generalized Temperley-Li…
We give an explicit nonrecursive complete matching for the Hasse diagram of the strong Bruhat order of any interval in any Coxeter group. This yields a new derivation of the Mobius function, recovering a classical result due to Verma.
We study a family of infinite-type Coxeter groups defined by the avoidance of certain rank 3 parabolic subgroups. For this family, rationally smooth elements can be detected by looking at only a few coefficients of the Poincaré polynomial. We also prove a factorization theorem for the Poincaré polynomial of rationally smooth elements. As an application, we show that a large class of infinite-type Coxeter groups have only finitely many rationally smooth elements. Explicit enumerations and descriptions of these elements are given in special cases.
In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is expressed uniformly in terms of natural parameters of the group. In the case of factorizations of minimal length, we recover a formula due to P. Deligne, J. Tits and D. Zagier in the real case and to D. Bessis in the complex case. For the symmetric group, our formula specializes to a formula of D. M. Jackson.
We define, for any special matching of a finite graded poset, an idempotent, regressive and order preserving function. We consider the monoid generated by such functions. The idempotents of this monoid are called special idempotents. They are interval retracts. Some of them realize a kind of parabolic map and are called special projections. We prove that, in Eulerian posets, the image of a special projection, and its complement, are graded induced subposets. In a finite Coxeter group, all projections on right and left parabolic quotients are special projections, and some projections on double …
Special Matchings, Brenti's Conjecture, and the Combinatorial Invariance Conjecture
本文完全刻画了A型Coxeter群中任意Bruhat区间的特殊匹配，并应用此结果证明了Brenti关于通过特殊匹配计算Kazhdan-Lusztig R-多项式的猜想，为组合不变性猜想提供了新证据。
We define and study generalized nil-Coxeter algebras associated to Coxeter groups. Motivated by a question of Coxeter (1957), we construct the first examples of such finite-dimensional algebras that are not the 'usual' nil-Coxeter algebras: a novel 2-parameter type $A$ family that we call $NC_A(n,d)$. We explore several combinatorial properties of $NC_A(n,d)$, including its Coxeter word basis, length function, and Hilbert-Poincare series, and show that the corresponding generalized Coxeter group is not a flat deformation of $NC_A(n,d)$. These algebras yield symmetric semigroup module categorie…
Let (W,S) be a finite rank Coxeter system with W infinite. We prove that the limit weak order on the blocks of infinite reduced words of W is encoded by the topology of the Tits boundary of the Davis complex X of W. We consider many special cases, including W word hyperbolic, and X with isolated flats. We establish that when W is word hyperbolic, the limit weak order is the disjoint union of weak orders of finite Coxeter groups. We also establish, for each boundary point ξ, a natural order-preserving correspondence between infinite reduced words which "point towards" ξ, and elements of the ref…
Khovanov-Rozansky homology of Coxeter knots and Schröder polynomials for paths under any line
本文引入由三角划分索引的广义Schröder多项式，证明其与Coxeter结的Khovanov-Rozansky同调Poincaré级数一致，并借此证明了ORS猜想的特化及$(q,t)$-Schröder定理的三角版本。
Chains in the noncrossing partition lattice
研究非交叉划分格中各类链的计数递推关系，推导出有限Coxeter群的非交叉划分格中链的计数公式，并给出新的统一公式。
The purpose of this article is to shed new light on the combinatorial structure of Kazhdan-Lusztig cells in infinite Coxeter groups $W$. Our main focus is the set $\D$ of distinguished involutions in $W$, which was introduced by Lusztig in one of his first papers on cells in affine Weyl groups. We conjecture that the set $\D$ has a simple recursive structure and can be enumerated algorithmically starting from the distinguished involutions of finite Coxeter groups. Moreover, to each element of $\D$ we assign an explicitly defined set of equivalence relations on $W$ that altogether conjecturally…
We present a simple and convenient analytical formula for efficient exact computation of the hafnian of Toeplitz matrices of a special type. An interpretation of the obtained results is given in the language of perfect matchings and Bessel polynomials.
Solomon's descent algebra is used to define a family of signed measures M(W,x) for a finite Coxeter group W and non-zero x. The measures corresponding to W of types A and B are known to arise from the theory of card shuffling and to be related to the Poincare-Birkhoff-Witt theorem and splittings of Hochschild homology. Formulas for these measures are obtained in special cases. The eigenvalues of the associated Markov chains are computed. By elementary algebraic group theory, choosing a random semisimple orbit on a Lie algebra corresponding to a finite group of Lie type G^F induces a measure on…
Special partial matchings (SPMs) are a generalisation of Brenti's special matchings. Let a \emph{pircon} be a poset in which every non-trivial principal order ideal is finite and admits an SPM. Thus pircons generalise Marietti's zircons. We prove that every open interval in a pircon is a PL ball or a PL sphere. It is then demonstrated that Bruhat orders on certain twisted identities and quasiparabolic $W$-sets constitute pircons. Together, these results extend a result of Can, Cherniavsky, and Twelbeck, prove a conjecture of Hultman, and confirm a claim of Rains and Vazirani.
A subset $M$ of the edge set of a graph $G$ is an induced matching of $G$ if given any two $e_1,e_2 \in M$, none of the vertices on $e_1$ is adjacent to any of the vertices on $e_2$. Suppose that $MIM_G$, a positive integer, is the largest possible size of $M$ in $G$, then, $M$ is the maximum induced matching, $MIM$, of $G$ and $MIM_G$ is the maximum induced matching number of $G$. We obtain some upper bounds for the maximum induced matching numbers of some specific grids.
A simple classification of the special matchings in the symmetric group
该研究针对对称群的Bruhat区间，建立特殊匹配的显式分类，证明分次偏序集经部分特殊匹配扩张的存在唯一性，进而提出计算含底元素长度≤1区间的Kazhdan–Lusztig多项式的组合算法。
This article, based on joint work with Gabriel Carroll, Andy Itsara, Ian Le, Gregg Musiker, Gregory Price, Dylan Thurston, and Rui Viana, presents a combinatorial model based on perfect matchings that explains the symmetries of the numerical arrays that Conway and Coxeter dubbed frieze patterns. This matchings model is a combinatorial interpretation of Fomin and Zelevinsky's cluster algebras of type A. One can derive from the matchings model an enumerative meaning for the Markoff numbers, and prove that the associated Laurent polynomials have positive coefficients as was conjectured (much more…
Parabolic Homotopy Colimits and Coxeter Descents
本文针对有限Coxeter系统定义抛物bar复形，证明其Hochster型分解，建立相关函子性、对偶性等结果，将其应用于Weyl群的同调研究并恢复特殊模型。
Let $(W,S)$ be a Coxeter system and write $P_W(q)$ for its Poincaré series. Lusztig has shown that the quotient $P_W(q^2)/P_W(q)$ is equal to a certain power series $L_{W}(q)$, defined by specializing one variable in the generating function recording the lengths and absolute lengths of the involutions in $W$. The simplest inductive method of proving this result for finite Coxeter groups suggests a natural bivariate generalization $L^J_W(s,q) \in \mathbb{Z}[[s,q]]$ depending on a subset $J\subset S$. This new power series specializes to $L_W(q)$ when $s=-1$ and is given explicitly by a sum of r…
Biregular bipartite labeled multigraphs and perfect matchings in bipartite tensor products
本文研究双部张量积中的完美匹配问题，证明了某些特殊情况，并将猜想1转化为矩阵不等式，进一步证明了该不等式的特殊情况。
Let $W$ be a Weyl group with root lattice $Q$ and Coxeter number $h$. The elements of the finite torus $Q/(h+1)Q$ are called the $W$-{\sf parking functions}, and we call the permutation representation of $W$ on the set of $W$-parking functions the (standard) $W$-{\sf parking space}. Parking spaces have interesting connections to enumerative combinatorics, diagonal harmonics, and rational Cherednik algebras. In this paper we define two new $W$-parking spaces, called the {\sf noncrossing parking space} and the {\sf algebraic parking space}, with the following features: 1) They are defined more g…
For a graph $G$ let $L(G)$ and $l(G)$ denote the size of the largest and smallest maximum matching of a graph obtained from $G$ by removing a maximum matching of $G$. We show that $L(G)\leq 2l(G),$ and $L(G)\leq (3/2)l(G)$ provided that $G$ contains a perfect matching. We also characterize the class of graphs for which $L(G)=2l(G)$. Our characterization implies the existence of a polynomial algorithm for testing the property $L(G)=2l(G)$. Finally we show that it is $NP$-complete to test whether a graph $G$ containing a perfect matching satisfies $L(G)=(3/2)l(G)$.
Three results towards the approximation of special maximum matchings in graphs
本文研究了图中特殊最大匹配的逼近问题，证明了特定判定问题的NP完全性，并给出了参数$\ell(G)$和$L(G)$的不可近似性结果。
In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to its connection to maximum matchings in a graph. In this paper, we first define $θ$-barrier sets. Our definition of a $θ$-barrier set is slightly different from that of a barrier set. However we show that $θ$-barrier sets and barrier sets have similar properties. In particular, we prove a generalized Berge's Formula and give a characterization for the set of all $θ$-special vertices in a graph.
The geometry of conjugation in affine Coxeter groups
本文为仿射 Coxeter 群中的共轭类和共轭集给出精确几何描述，引入模集并证明其秩等于移动集维数，进而逐类型分析其结构，得到最简闭式条件。
Reduced words for reflections in Weyl groups
研究Coxeter群中反射的回文既约表达式问题，为任意有限Weyl群中的每个反射给出了提供回文既约表达式的闭公式，填补了特殊情形之外缺乏明确公式的空白。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。