中文
相关论文

相关论文: On the shard intersection order of a Coxeter group

200 篇论文

Given a group $G$ and a subgroup $H$, we let $\mathcal{O}_G(H)$ denote the lattice of subgroups of $G$ containing $H$. This paper provides a classification of the subgroups $H$ of $G$ such that $\mathcal{O}_{G}(H)$ is Boolean of rank at…

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

逻辑 · 数学 2017-09-26 Milos S. Kurilic

We define and study noncommutative crossing partitions which are a generalization of non-crossing partitions. By introducing a new cover relation on binary trees, we show that the partially ordered set of noncommutative crossing partitions…

组合数学 · 数学 2022-11-22 Keiichi Shigechi

We examine Borel subgroup orbits in the classical symmetric space of type CI, which are parametrized by skew symmetric (n, n)-clans. We describe bijections between such clans, certain weighted lattice paths, and pattern-avoiding signed…

组合数学 · 数学 2020-01-22 Aram Bingham , Ozlem Ugurlu

Let $G$ be a connected semi-simple algebraic group of adjoint type over an algebraically closed field, and let $\overline{G}$ be the wonderful compactification of $G$. For a fixed pair $(B, B^-)$ of opposite Borel subgroups of $G$, we look…

表示论 · 数学 2009-07-08 Xuhua He , Jiang-Hua Lu

Hypertrees and noncrossing trees are well-established objects in the combinatorics literature, but the hybrid notion of a noncrossing hypertree has received less attention. In this article I investigate the poset of noncrossing hypertrees…

组合数学 · 数学 2017-07-21 Jon McCammond

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…

群论 · 数学 2026-03-09 Sachin Ballal , Tushar Halder

Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter…

组合数学 · 数学 2010-01-18 Christian Krattenthaler , Thomas Müller

We study divergence and thickness for general Coxeter groups $W$. We first characterise linear divergence, and show that if $W$ has superlinear divergence then its divergence is at least quadratic. We then formulate a computable…

群论 · 数学 2026-04-16 Pallavi Dani , Yusra Naqvi , Ignat Soroko , Anne Thomas

We consider the poset of weighted partitions $\Pi_n^w$, introduced by Dotsenko and Khoroshkin in their study of a certain pair of dual operads. The maximal intervals of $\Pi_n^w$ provide a generalization of the lattice $\Pi_n$ of…

组合数学 · 数学 2017-11-21 Rafael S. González D'León , Michelle L. Wachs

We prove that the Stanley--Reisner ideal of the Alexander dual of the subword complexes in Coxeter groups has linear quotients with respect to the lexicographical order of the minimal monomial generators. As a consequence, we obtain a…

交换代数 · 数学 2008-12-01 Anda Olteanu

We study incidence properties among cosets of finite loops, with emphasis on well-structured varieties such as antiautomorphic loops and Bol loops. While cosets in groups are either disjoint or identical, we find that the incidence…

组合数学 · 数学 2012-10-01 Michael Kinyon , Kyle Pula , Petr Vojtechovsky

Given a class of groups C, a group G is strongly accessible over C if there is a bound on the number of terms in a sequence L(1), L(2), ..., L(n) of graph of groups decompositions of G with edge groups in C such that L(1) is the trivial…

群论 · 数学 2010-03-02 Michael L. Mihalik , Steven Tschantz

We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry. The crossing symmetry equates partition functions on different trivalent graphs,…

统计力学 · 物理学 2015-06-12 Steven H. Simon , Paul Fendley

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…

组合数学 · 数学 2022-06-28 Angela Carnevale , Matthew Dyer , Paolo Sentinelli

In this paper, we initiate the study of the twisted weak order associated to a twisted Bruhat order for a Coxeter group and explore the relationship between the lattice property of such order and the infinite reduced words. We show that for…

表示论 · 数学 2018-12-19 Weijia Wang

In this manuscript we study inclusion posets of Borel orbit closures on (symmetric) matrices. In particular, we show that the Bruhat poset of partial involutions is a lexicographiically shellable poset. Also, studying the embeddings of…

组合数学 · 数学 2013-02-22 Mahir Bilen Can , Tim Twelbeck

This paper considers the planar figure of a combinatorial polytope or tessellation identified by the Coxeter symbol $k_{i,j}$ , inscribed in a conic, satisfying the geometric constraint that each octahedral cell has a centre. This…

可精确求解与可积系统 · 物理学 2018-03-09 James Atkinson

Given a linear extension $\sigma$ of a finite poset $R$, we consider the permutation matrix indexing the Schubert cell containing the Cartan matrix of $R$ with respect to $\sigma$. This yields a bijection $\mathrm{Ech}_\sigma\colon R\to R$…

We consider the closure space on the set of strings of a gentle algebra of finite representation type. Palu, Pilaud, and Plamondon proved that the collection of all biclosed sets of strings forms a lattice, and moreover, that this lattice…

表示论 · 数学 2018-08-31 Alexander Garver , Thomas McConville , Kaveh Mousavand