Related papers: Rees products and lexicographic shellability
We introduce a notion of lexicographic shellability for pure, balanced boolean cell complexes, modelled after the $CL$-shellability criterion of Bj\"orner and Wachs for posets and its generalization by Kozlov called $CC$-shellability. We…
The goal of this paper is to generalize some of the existing toolkit of combinatorial algebraic topology in order to study the homology of abstract chain complexes. We define shellability of chain complexes in a similar way as for cell…
The Rees product of partially ordered sets was introduced by Bj\"orner and Welker. Using the theory of lexicographic shellability, Linusson, Shareshian and Wachs proved formulas, of significance in the theory of gamma-positivity, for the…
Let L be a lattice admitting a left-modular chain of length r, not necessarily maximal. We show that if either L is graded or the chain is modular, then the (r-2)-skeleton of L is vertex-decomposable (hence shellable). This proves a…
The notion of Rees product of posets was introduced by Bj\"orner and Welker, where they study connections between poset topology and commutative algebra. Bj\"orner and Welker conjectured and Jonsson proved that the dimension of the top…
We develop a theory of sets with distributive products (called shelves and multi-shelves) and of their homology. We relate the shelf homology to the rack and quandle homology.
We determine how the flag f-vector of any graded poset changes under the Rees product with the chain, and more generally, any t-ary tree. As a corollary, the M\"obius function of the Rees product of any graded poset with the chain, and more…
We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
This article presents results being consistent with conjectures of J.-L. Loday about the existence and properties of a Leibniz homology for groups. Introducing L-sets we prove that (pointed) rack homology has properties this conjectural…
We investigate the homology representation of the symmetric group on rank-selected subposets of subword order. We show that the homology module for words of bounded length, over an alphabet of size $n,$ decomposes into a sum of tensor…
Let $R$ be a commutative ring that is free of rank $k$ as an abelian group, $p$ a prime, and $SL(n,R)$ the special linear group. We show that the Lie algebra associated to the filtration of $SL(n,R)$ by $p$-congruence subgroups is…
We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…
We show that uniformly finite homology of products of $n$ trees vanishes in all degrees except degree $n$, where it is infinite dimensional. Our method is geometric and applies to several large scale homology theories, including almost…
Hahn's embedding theorem asserts that linearly ordered abelian groups embed in some lexicographic product of real groups. Hahn's theorem is generalized to a class of residuated semigroups in this paper, namely, to odd involutive commutative…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
We prove a conjecture of Helfgott on the structure of sets of bounded tripling in bounded rank, which states the following. Let $A$ be a finite symmetric subset of $\mathrm{GL}_n(\mathbf{F})$ for any field $\mathbf{F}$ such that $|A^3| \leq…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…
The lexicographic product $G[H]$ of two graphs $G$ and $H$ is obtained from $G$ by replacing each vertex with a copy of $H$ and adding all edges between any pair of copies corresponding to adjacent vertices of $G$. We consider also the…
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…