中文
相关论文

相关论文: Freely braided elements in Coxeter groups

200 篇论文

By underlying the commutation relation in a right-angled Coxeter group W, we recover the fact that right-angled Coxeter groups are rigid and we describe the second subgroup of Aut(W) that appears in the decomposition of Aut(W) into a…

群论 · 数学 2008-04-03 Anatole Castella

By strengthening known results about primitivity-blocking words in free groups, we prove that for any nontrivial element w of a free group of finite rank, there are words that cannot be subwords of any cyclically reduced automorphic image…

The Hecke algebra $\mathbb{C}_q[W]$ of a Coxter group $W$, associated to parameter $q$, can be completed to a von Neumann algebra $\mathcal{N}_q(W)$. We study such algebras in case where $W$ is right-angled. We determine the range of $q$…

群论 · 数学 2016-01-05 Łukasz Garncarek

Involution words are variations of reduced words for twisted involutions in Coxeter groups. They arise naturally in the study of the Bruhat order, of certain Iwahori-Hecke algebra modules, and of orbit closures in flag varieties.…

组合数学 · 数学 2017-03-28 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

Let W~ be an affine Weyl group, and let C be a left, right, or two-sided Kazhdan--Lusztig cell in W~. Let Reduced (C) be the set of all reduced expressions of elements of C, regarded as a formal language in the sense of the theory of…

群论 · 数学 2008-09-05 Paul E. Gunnells

We obtain a number of results regarding freeness, quasiconvexity and separability for subgroups of Coxeter groups, Artin groups and one-relator groups with torsion.

群论 · 数学 2007-05-23 Ilya Kapovich , Paul Schupp

We show that the hyperplane arrangement of a coconvex set in a finite root system is free if and only if it is free in corank 4. As a consequence, we show that the inversion arrangement of a Weyl group element w is free if and only if w…

组合数学 · 数学 2014-09-26 William Slofstra

We study the restriction of the strong Bruhat order on an arbitrary Coxeter group $W$ to cosets $x W_L^\theta$, where $x$ is an element of $W$ and $W_L^\theta$ the subgroup of fixed points of an automorphism $\theta$ of order at most two of…

表示论 · 数学 2023-11-14 Nathan Chapelier-Laget , Thomas Gobet

We define pseudo-Garside groups and prove a theorem about them parallel to Garside's result on the word problem for the usual braid groups. The main novelty is that the set of simple elements can be infinite. We introduce a group B=B(Z^n)…

群论 · 数学 2007-05-23 Daan Krammer

We consider the factorization of permutations into bandwidth 1 permutations, which are products of mutually nonadjacent simple transpositions. We exhibit an upper bound on the minimal number of such factors and thus prove a conjecture of…

组合数学 · 数学 2012-01-17 Greta Panova

In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we…

组合数学 · 数学 2010-10-25 Jon McCammond , T. Kyle Petersen

Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships. Surprisingly the Braid relations dramatically reduce the…

计算复杂性 · 计算机科学 2013-08-20 Dara O Shayda

We show that if a group $G$ acting faithfully on a rooted tree $T$ has a free subgroup, then either there exists a point $w$ of the boundary $\partial T$ and a free subgroup of $G$ with trivial stabilizer of $w$, or there exists…

群论 · 数学 2008-02-20 Volodymyr Nekrashevych

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

组合数学 · 数学 2023-11-28 Jennifer Elder

In pointed braided fusion categories knowing the self-symmetry braiding of simples is theoretically enough to reconstruct the associator and braiding on the entire category (up to twisting by a braided monoidal auto-equivalence). We address…

范畴论 · 数学 2020-05-12 Oliver Braunling

Given a Coxeter group $W$ with Coxeter system $(W,S)$, where $S$ is finite. We provide a complete characterization of Boolean intervals in the weak order of $W$ uniformly for all Coxeter groups in terms of independent sets of the Coxeter…

组合数学 · 数学 2024-03-14 Ben Adenbaum , Jennifer Elder , Pamela E. Harris , J. Carlos Martínez Mori

We enlarge a Coxeter group into a category, with one object for each finite parabolic subgroup, encoding the combinatorics of double cosets. This category, the singular Coxeter monoid, is connected to the geometry of partial flag varieties.…

表示论 · 数学 2021-08-16 Ben Elias , Hankyung Ko

We isolate a tractable class of HNN-extensions of a free group, namely, multiple HNN-extensions by basis-conjugating embeddings. For this class, we construct a normal form and establish a practical version of the ping-pong lemma that…

群论 · 数学 2025-12-22 Vasily Ionin

Suppose that G is a nontrivial torsion-free group and w is a word over the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\}. It is proved that for n\ge2 the group \~G=<G,x_1,x_2,...,x_n | w=1> always contains a nonabelian free subgroup. For n=1…

群论 · 数学 2007-09-02 Anton A. Klyachko

Between 1994 and 1998, the work of M. Brou\'e, G. Malle, and R. Rouquier generalized in a natural way the definition of the Hecke algebra associated to a finite Coxeter group, for the case of an arbitrary complex reflection group.…

表示论 · 数学 2016-08-03 Eirini Chavli