Related papers: Subword complexes and edge subdivisions
A near permutation of a set is a bijection between two cofinite subsets, modulo coincidence on smaller cofinite subsets. Near permutations of a set form its near symmetric group. In this monograph, we define near actions as homomorphisms…
For any Coxeter system $(W,S)$ of rank $n$, we introduce an abstract boolean complex (simplicial poset) of dimension $2n-1$ that contains the Coxeter complex as a relative subcomplex. Faces are indexed by triples $(I,w,J)$, where $I$ and…
Random walk on the chambers of hyperplanes arrangements is used to define a family of card shuffling measures $H_{W,x}$ for a finite Coxeter group W and real $x \neq 0$. By algebraic group theory, there is a map from the semisimple orbits…
Presentations of groups by rewriting systems (that is, by monoid presentations), have been fruitfully studied by encoding the rewriting system in a $2$--complex -- the Squier complex -- whose fundamental groupoid then describes the…
In this note we first consider a ternary matrix group related to the von Neumann regular semigroups and to the Artin braid group (in an algebraic way). The product of a special kind of ternary matrices (idempotent and of finite order)…
Grothendieck proved that any finite epimorphism of noetherian schemes factors into a finite sequence of effective epimorphisms. We define the complexity of a flat groupoid $R\rightrightarrows X$ with finite stabilizer to be the length of…
We introduce the subsemigroup complex of a finite semigroup S as a (boolean representable) simplicial complex defined through chains in the lattice of subsemigroups of S. We present a research program for such complexes, illustrated through…
Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…
Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…
In this article we construct a cochain complex of a complex Clifford algebra with coefficients in itself in a combinatorial fashion and we call the corresponding cohomology by {\it Clifford cohomology.} We show that {\it Clifford…
Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associahedra in a general context, for pseudographs with loops and…
Let $G=(V,E)$ be a simple connected graph. A connected edge cover of $G$ is a subset $S\subseteq E$ such that every vertex of $G$ is incident with at least one edge in $S$ and the subgraph induced by $S$ is connected. The connected edge…
A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…
In this note, we provide a short and self-contained proof that the braid group on n strands acts transitively on the set of reduced factorizations of a Coxeter element in a Coxeter group of finite rank n into products of reflections. We…
We provide a concrete realization of the cluster algebras associated with Q-systems as amalgamations of cluster structures on double Bruhat cells in simple algebraic groups. For nonsimply-laced groups, this provides a cluster-algebraic…
Let $U_q$ be the quantum group corresponding to a complex simple Lie algebra $\mathfrak g$ with root system $R$. Assume the quantum parameter $q\in \C$ is a root of unity. In this paper we study the extensions between simple modules in the…
The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…
The theory of $N$-complexes is a generalization of both ordinary chain complexes and graded objects. Hence it yields deeper insight in the structure of these and offers a broader range of applications. This work generalizes the tensor…
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…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…