中文
相关论文

相关论文: Sortable elements and Cambrian lattices

200 篇论文

This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and $s$-permutahedra, certain discrete objects that are indexed by a sequence of non-negative integers $s$. In this first paper, we concentrate…

组合数学 · 数学 2025-02-26 Cesar Ceballos , Viviane Pons

Let $W$ be an extended affine Weyl group. We prove that minimal length elements $w_{\co}$ of any conjugacy class $\co$ of $W$ satisfy some special properties, generalizing results of Geck and Pfeiffer \cite{GP} on finite Weyl groups. We…

表示论 · 数学 2019-02-20 Xuhua He , Sian Nie

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

组合数学 · 数学 2025-12-23 Grant T. Barkley , David E Speyer

We study certain lattices constructed from finite abelian groups. We show that such a lattice is eutactic, thereby confirming a conjecture by B\"ottcher, Eisenbarth, Fukshansky, Garcia, Maharaj. Our methods also yield simpler proofs of two…

数论 · 数学 2023-05-04 Frieder Ladisch

The descent algebra of a finite Coxeter group $W$ is a basic algebra, and as such it has a presentation as quiver with relations. In recent work, we have developed a combinatorial framework which allows us to systematically compute such a…

表示论 · 数学 2008-10-16 Goetz Pfeiffer

A structure of a complete lattice (in the sense of a poset) is defined on the underlying set of the orhtogonal group of a real Euclidean space, by a construction analogous to that of the weak order of a Coxeter system in terms of its root…

群论 · 数学 2011-10-21 Annette Pilkington

The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we…

组合数学 · 数学 2011-03-11 Erin Bancroft

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

环与代数 · 数学 2021-05-03 G. Grätzer , H. Lakser

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the characters of a finite Coxeter group $W$ afforded by the homogeneous components of its Orlik-Solomon algebra as sums of characters induced from linear…

表示论 · 数学 2012-06-19 Marcus Bishop , J. Matthew Douglass , Goetz Pfeiffer , Gerhard Roehrle

We extend properties of the weak order on finite Coxeter groups to Weyl groupoids admitting a finite root system. In particular, we determine the topological structure of intervals with respect to weak order, and show that the set of…

量子代数 · 数学 2010-03-17 Istvan Heckenberger , Volkmar Welker

We define and study the canonical complex of a finite semidistributive lattice $L$. It is the simplicial complex on the join or meet irreducible elements of $L$ which encodes each interval of $L$ by recording the canonical join…

组合数学 · 数学 2023-11-14 Doriann Albertin , Vincent Pilaud

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

We pose counting problems related to the various settings for Coxeter-Catalan combinatorics (noncrossing, nonnesting, clusters, Cambrian). Each problem is to count "twin" pairs of objects from a corresponding problem in Coxeter-Catalan…

组合数学 · 数学 2026-05-13 Emily Barnard , Nathan Reading

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…

群论 · 数学 2014-09-19 Thomas Lam , Anne Thomas

Let $Q$ be an acyclic quiver and $\Lambda$ be the complete preprojective algebra of $Q$ over an algebraically closed field $k$. To any element $w$ in the Coxeter group of $Q$, Buan, Iyama, Reiten and Scott have introduced and studied in…

表示论 · 数学 2014-02-26 Claire Amiot , Osamu Iyama , Idun Reiten , Gordana Todorov

In this paper, we study the combinatorics of a certain minimal factorization of the elements in a finite lattice $L$ called the canonical join representation. The join $\bigvee A =w$ is the canonical join representation of $w$ if $A$ is the…

组合数学 · 数学 2016-10-18 Emily Barnard

We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…

逻辑 · 数学 2014-03-24 Pierre Gillibert

A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…

组合数学 · 数学 2026-05-07 Emily Barnard , Jean-Christophe Novelli , Vincent Pilaud

Given an affine Coxeter group $W$, the corresponding Shi arrangement is a refinement of the corresponding Coxeter hyperplane arrangements that was introduced by Shi to study Kazhdan-Lusztig cells for $W$. In particular, Shi showed that each…

组合数学 · 数学 2024-12-13 Nathan Chapelier-Laget , Christophe Hohlweg