Search arXivSearch

arXiv · 1311.0581

Observations on the Perturbed Wedge

Abstract

Santos' construction of the first known counterexample to the Hirsch conjecture, for bounded polytopes, follows the strategy of first finding a counterexample to the nonrevisiting conjecture. Santos constructs a $5$-dimensional all-but-simple spindle $(P,x,y)$ of length $6$, which is a counterexample to the nonrevisiting conjecture. For simple polytopes, if we had a counterexample to the nonrevisiting conjecture, we would produce the corresponding counterexample to the Hirsch conjecture through repeated wedging, over all the facets not incident to $x$ or $y$. However, Santos $5$-dimensional spindle is not simple. Every facet is incident to either $x$ or $y$, so we need an alternate method to produce the corresponding counterexample to the Hirsch conjecture. Santos has offered the perturbed wedge to accomplish this. In these working notes, we offer some technical details regarding the nonsimplicities under iterations of the perturbed wedge construction. NOTE: these are working notes about the construction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fred B. Holt. 2013-11-04. Observations on the Perturbed Wedge. https://arxiv.org/abs/1311.0581

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