English
Related papers

Related papers: The Absolute Orders on the Coxeter Groups $A_n$ an…

200 papers

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)\in\{2\}\cup 4\N$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd,…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

The two part Sperner theorem of Katona and Kleitman states that if $X$ is an $n$-element set with partition $X_1 \cup X_2$, and $\cF$ is a family of subsets of $X$ such that no two sets $A, B \in \cF$ satisfy $A \subset B$ (or $B \subset…

Combinatorics · Mathematics 2016-08-14 Dániel Gerbner , Péter L. Erdős , Nathan Lemons , Dhruv Mubayi , Cory Palmer , Balázs Patkós

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

Combinatorics · Mathematics 2025-07-08 Bruce E Sagan , Sheila Sundaram

In 1997 Cochran-Orr-Teichner introduced a natural filtration, called the n-solvable filtration, of the smooth knot concordance group, C. Its terms {F_n} are indexed by half integers. We show that each associated graded abelian group…

Geometric Topology · Mathematics 2011-03-15 Tim D. Cochran , Shelly Harvey , Constance Leidy

One can observe that Coxeter groups and right-angled Artin groups share the same solution to the word problem. On the other hand, in his study of reflection subgroups of Coxeter groups Dyer introduces a family of groups, which we call Dyer…

Group Theory · Mathematics 2022-12-22 Luis Paris , Mireille Soergel

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

We say a permutation $\pi=\pi_1\pi_2\cdots\pi_n$ in the symmetric group $\mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1}<\pi_i>\pi_{i+1}$ and we let $P(\pi)=\{i \in \{1, 2, \ldots, n\} \, \vert \, \mbox{$i$ is a peak of $\pi$}\}$.…

Group Theory · Mathematics 2016-11-23 Alexander Diaz-Lopez , Pamela E. Harris , Erik Insko , Darleen Perez-Lavin

A $(v,k;r)$ Heffter space is a resolvable $(v_r,b_k)$ configuration whose points form a half-set of an abelian group $G$ and whose blocks are all zero-sum in $G$. It was recently proved that there are infinitely many orders $v$ for which,…

Combinatorics · Mathematics 2024-08-23 Marco Buratti , Anita Pasotti

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

Combinatorics · Mathematics 2009-03-30 Drew Armstrong

We extend the notion of proper elements to all Coxeter groups. For all infinite families of finite Coxeter groups we prove that the probability a random element is proper goes to zero in the limit. This proves a conjecture of the third…

Combinatorics · Mathematics 2025-09-18 József Balogh , David Brewster , Reuven Hodges

A \textsl{Sperner $k$-partition system} on a set $X$ is a set of partitions of $X$ into $k$ classes such that the classes of the partitions form a Sperner set system (so no class from a partition is a subset of a class from another…

Combinatorics · Mathematics 2012-01-23 P. C. Li , Karen Meagher

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing…

Combinatorics · Mathematics 2026-05-13 Nathan Reading , David E Speyer

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\'{e}…

Combinatorics · Mathematics 2014-08-08 Edward Richmond , William Slofstra

In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…

Rings and Algebras · Mathematics 2014-03-26 Jouni Järvinen , Sándor Radeleczki , Laura Veres

We study the embedding property in the category of sorted profinite groups. We introduce a notion of the sorted embedding property (SEP), analogous to the embedding property for profinite groups. We show that any sorted profinite group has…

Logic · Mathematics 2023-10-10 Junguk Lee

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…

Group Theory · Mathematics 2016-09-07 Paul E. Schupp

In this paper, we investigate various properties of strong and weak twisted Bruhat orders on a Coxeter group. In particular, we prove that any twisted strong Bruhat order on an affine Weyl group is locally finite, strengthening a result of…

Representation Theory · Mathematics 2020-02-11 Weijia Wang

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…

Commutative Algebra · Mathematics 2008-12-01 Anda Olteanu

Partially ordered models of time occur naturally in applications where agents or processes cannot perfectly communicate with each other, and can be traced back to the seminal work of Lamport. In this paper we consider the problem of…

Computational Complexity · Computer Science 2023-05-26 Leif Eriksson , Victor Lagerkvist