Search arXivSearch

arXiv · math/0303233

Algebraic Shifting and Basic Constructions on Simplicial Complexes

Abstract

We try to understand the behavior of exterior algebraic shifting with respect to basic constructions on simplicial complexes, like union and join. In particular we give a complete combinatorial description of the shifting of a disjoint union, and more generally of a union along a simplex, in terms of the shifting of its components. As a corollary, we prove the following, conjectured by Kalai: $Δ(K \cup L) = Δ(Δ(K) \cup Δ(L))$, where $K,L$ are complexes, $\cup$ means disjoint union, and $Δ$ is the exterior shifting operator. We give an example showing that replacing the operation 'union' with the operation 'join' in the above equation is wrong, disproving a conjecture made by Kalai. We adopt a homological point of view on the algebraic shifting operator, which is used throughout this work.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eran Nevo. 2006-02-23. Algebraic Shifting and Basic Constructions on Simplicial Complexes. https://arxiv.org/abs/math/0303233

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO