English
Related papers

Related papers: Homotopy Type of the Boolean Complex of a Coxeter …

200 papers

The graph complex acts on the spaces of Poisson bi-vectors $P$ by infinitesimal symmetries. We prove that whenever a Poisson structure is homogeneous, i.e. $P = L_{\vec{V}}(P)$ w.r.t. the Lie derivative along some vector field $\vec{V}$,…

Symplectic Geometry · Mathematics 2021-07-23 Ricardo Buring , Arthemy V. Kiselev

For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand…

Combinatorics · Mathematics 2014-09-18 Michal Adamaszek

Combinatorially and stochastically defined simplicial complexes often have the homotopy type of a wedge of spheres. A prominent conjecture of Kahle quantifies this precisely for the case of random flag complexes. We explore whether such…

Algebraic Topology · Mathematics 2020-06-11 Dejan Govc

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…

Combinatorics · Mathematics 2011-02-07 Florent Hivert , Anne Schilling , Nicolas M. Thiéry

A graph $X$ is defined inductively to be $(a_0,\dots,a_{n-1})$-regular if $X$ is $a_0$-regular and for every vertex $v$ of $X$, the sphere of radius $1$ around $v$ is an $(a_1,\dots,a_{n-1})$-regular graph. Such a graph $X$ is said to be…

Group Theory · Mathematics 2020-09-21 Marston Conder , Alexander Lubotzky , Jeroen Schillewaert , François Thilmany

We prove that every finite connected simplicial complex is homotopy equivalent to the quotient of a contractible manifold by proper actions of a virtually torsion-free group. As a corollary, we obtain that every finite connected simplicial…

Algebraic Topology · Mathematics 2012-09-24 Raeyong Kim

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

Combinatorics · Mathematics 2026-04-02 Marek Filakovský

What remains of a geometrical notion like that of a principal bundle when the base space is not a manifold but a coarse graining of it, like the poset formed by a base for the topology ordered under inclusion? Motivated by finding a…

Algebraic Topology · Mathematics 2012-08-22 John E. Roberts , Giuseppe Ruzzi

This paper gives a definitive solution to the problem of describing conjugacy classes in arbitrary Coxeter groups in terms of cyclic shifts. Let $(W,S)$ be a Coxeter system. A cyclic shift of an element $w\in W$ is a conjugate of $w$ of the…

Group Theory · Mathematics 2025-07-08 Timothée Marquis

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

Combinatorics · Mathematics 2011-01-26 Matthew J. Samuel

In this paper, we study a construction of homotopy invariants of open or closed covers, where the homotopy class is defined relative to a pair $(V,r)$, with $V$ a finite set of points in $\mathbb{R}^d$ and $r$ a point in the interior of…

Combinatorics · Mathematics 2025-10-21 Mikhail V. Bludov

For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W. The…

Combinatorics · Mathematics 2013-10-08 Florent Hivert , Anne Schilling , Nicolas M. Thiéry

For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, \pi), where Q is a word in the alphabet of simple reflections, $\pi$ is a group element. We discuss the transformations of such a complex…

Combinatorics · Mathematics 2013-05-24 Mikhail Gorsky

We define ``star reducible'' Coxeter groups to be those Coxeter groups for which every fully commutative element (in the sense of Stembridge) is equivalent to a product of commuting generators by a sequence of length-decreasing star…

Quantum Algebra · Mathematics 2007-05-23 R. M. Green

A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…

Representation Theory · Mathematics 2023-01-02 Eric Marberg , Yifeng Zhang

In this paper, we classify all the hyperbolic non-compact Coxeter polytopes of finite volume combinatorial type of which is either a pyramid over a product of two simplices or a product of two simplices of dimension greater than one.…

Metric Geometry · Mathematics 2019-10-25 P. Tumarkin

We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion. Let us call a cell complex 'dichotomial' if to every…

Geometric Topology · Mathematics 2011-05-18 Sergey A. Melikhov

Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…

Geometric Topology · Mathematics 2025-10-28 Nicolau C. Saldanha , Pedro Zühlke

For $X$ a connected finite simplicial complex we consider $\Delta^d(X,n)$ the space of configurations of $n$ ordered points of $X$ such that no $d+1$ of them are equal, and $B^d(X,n)$ the analogous space of configurations of unordered…

Algebraic Topology · Mathematics 2016-11-16 Sadok Kallel , Ines Saihi

By a theorem of A.Bj\"orner, for every interval $[u,v]$ in the Bruhat order of a Coxeter group $W$, there exists a stratified space whose strata are labeled by the elements of $[u,v]$, adjacency is described by the Bruhat order, and each…

Combinatorics · Mathematics 2007-05-23 Sergey Fomin , Michael Shapiro
‹ Prev 1 4 5 6 7 8 10 Next ›