English
Related papers

Related papers: Order complexes of noncomplemented lattices are no…

200 papers

In general a contractible complex need not be collapsible. Moreover, there exist complexes which are collapsible but even so admit a collapsing sequence where one "gets stuck", that is one can choose the collapses in such a way that one…

Combinatorics · Mathematics 2020-08-14 Davide Lofano , Andrew Newman

We show that the order complex of the poset of all cosets of all proper subgroups of a finite group $G$ is never $\mathbb{F}_{2}$-acyclic and therefore never contractible. This settles a question of K. S. Brown.

Combinatorics · Mathematics 2016-04-01 John Shareshian , Russ Woodroofe

Given a group $G$, its lattice of subgroups $\mathcal{L}(G)$ can be viewed as a simplicial complex in a natural way. The inclusion of $1_G, G \in \mathcal{L}(G)$ implies that $\mathcal{L}(G)$ is contractible, and so we study the topology of…

Combinatorics · Mathematics 2021-04-27 Emilio Pierro

We provide examples of contractible complexes which fail to have non-positive immersions and weak non-positive immersions, answering a conjecture of Wise in the negative.

Geometric Topology · Mathematics 2024-04-10 William Fisher

Let $P$ be a finite poset with an element $s$ such that (1) for all $x\in P$, either $s\vee x$ or $s\wedge x$ exists; and (2) for all $x,y\in P$ such that $x<y$, if $s\wedge x$ does not exist but $s\wedge y$ does exist, then $(s\wedge…

Combinatorics · Mathematics 2022-01-06 Jonathan David Farley

We prove that it is NP-complete to decide whether a given (3-dimensional) simplicial complex is collapsible. This work extends a result of Malgouyres and Franc\'{e}s showing that it is NP-complete to decide whether a given simplicial…

Computational Geometry · Computer Science 2015-10-08 Martin Tancer

We prove that the arc complex of a polygon with a marked point in its interior is a strongly collapsible combinatorial ball. We also show that the arc complex of a M\"{o}bius strip, with finitely many marked points on its boundary, is a…

General Topology · Mathematics 2024-02-19 Pallavi Panda

We show that for some classes of groups $G$, the homotopy fiber $E_{\mathrm{com}} G$ of the inclusion of the classifying space for commutativity $E_{\mathrm{com}} G$ into the classifying space $BG$, is contractible if and only if $G$ is…

Algebraic Topology · Mathematics 2019-09-20 Omar Antolín-Camarena , Bernardo Villarreal

We characterize vector lattices in which unbounded order convergence is eventually order bounded. Among other things, the characterization provides a solution to \cite[Probl.23]{Az}.

Functional Analysis · Mathematics 2019-06-03 E. Y. Emelyanov , S. G. Gorokhova

We disprove a long-standing open conjecture due to Simon stating that all skeleta of simplices are extendably shellable. In particular, for every $d \geq 3$ we provide a pure $d$-dimensional shellable simplicial complex which is not…

Combinatorics · Mathematics 2026-05-26 Davide Bolognini , Paolo Sentinelli

The notion of unboundedly order converges has been recieved recently a particular attention by several authors. The main result of the present paper shows that the notion is efficient and deserves that care. It states that a vector lattice…

Functional Analysis · Mathematics 2017-10-10 Youssef Azouzi

(1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a…

Metric Geometry · Mathematics 2020-08-06 Karim A. Adiprasito , Bruno Benedetti

This paper proves that the universal covering of a compact K\"{a}hler manifold with small positive sectional curvature in a certain sense is contractible.

Differential Geometry · Mathematics 2025-02-20 Yuguang Zhang

In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…

Combinatorics · Mathematics 2015-07-03 Henri Mühle

We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…

Combinatorics · Mathematics 2014-03-19 Djordje Baralic , Ioana-Claudia Lazar

Given a graph $G$, the non-cover complex of $G$ is the combinatorial Alexander dual of the independence complex of $G$. Aharoni asked if the non-cover complex of a graph $G$ without isolated vertices is $(|V(G)|-i \gamma(G)-1)$-collapsible…

Combinatorics · Mathematics 2019-04-24 Ilkyoo Choi , Jinha Kim , Boram Park

We show that there can be no algorithm to decide whether infinite recursively described acyclic aspherical 2-complexes are contractible. We construct such a complex that is contractible if and only if the Collatz conjecture holds.

Group Theory · Mathematics 2020-03-23 Ian J Leary

The Tamari order is a central object in algebraic combinatorics and many other areas. Defined as the transitive closure of an associativity law, the Tamari order possesses a surprisingly rich structure: it is a congruence-uniform lattice.…

Combinatorics · Mathematics 2017-09-28 Thomas McConville

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

Combinatorics · Mathematics 2016-12-30 Gejza Jenča , Peter Sarkoci

We establish conditions under which lattices in certain simple Lie groups are profinitely solitary in the absolute sense, so that the commensurability class of the profinite completion determines the commensurability class of the group…

Group Theory · Mathematics 2023-02-22 Holger Kammeyer
‹ Prev 1 2 3 10 Next ›