On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space

@article{Parsa2018OnTL,
  title={On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space},
  author={Salman Parsa},
  journal={Discrete \& Computational Geometry},
  year={2018},
  volume={59},
  pages={663-679}
}
  • S. Parsa
  • Published 16 December 2015
  • Mathematics
  • Discrete & Computational Geometry
We consider d-dimensional simplicial complexes which can be PL embedded in the 2d-dimensional Euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is linklessly embeddable in the $$(2d-1)$$(2d-1)-dimensional Euclidean space. In addition, we use similar considerations on links of vertices to derive a new asymptotic upper bound on the total number of d-simplices in an (continuously) embeddable complex in 2d… 

Correction to: On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space

  • S. Parsa
  • Mathematics
    Discret. Comput. Geom.
  • 2020
In the following we refer to the original paper [1]. The main reason for writing this correction is the incorrect statement of Theorem 4. Section 4.1 should be corrected by replacing [3] = {1, 2, 3},

On the Smith classes, the van Kampen obstruction and embeddability of $[3]*K$

In this survey-research paper, we first introduce the theory of Smith classes of complexes with fixed-point free, periodic maps on them. These classes, when defined for the deleted product of a

Geometric Embeddability of Complexes is $\exists \mathbb R$-complete

We show that the decision problem of determining whether a given (abstract simplicial) k-complex has a geometric embedding in R is complete for the Existential Theory of the Reals for all d ≥ 3 and k

Combinatorial Lefschetz theorems beyond positivity

Consider a simplicial complex that allows for an embedding into $\mathbb{R}^d$. How many faces of dimension $\frac{d}{2}$ or higher can it have? How dense can they be? This basic question goes back

Geometric Embeddability of Complexes is ∃R-complete

We show that the decision problem of determining whether a given (abstract simplicial) k-complex has a geometric embedding in R is complete for the Existential Theory of the Reals for all d ≥ 3 and k

On Codimension One Embedding of Simplicial Complexes

We study d-dimensional simplicial complexes that are PL embeddable in \(\mathbb{R}^{d+1}\). It is shown that such a complex must satisfy a certain homological condition. The existence of this

Geometry and the Simplex: Results, Questions and Ideas

When we try to understand an object, first we have to describe it. And for many objects, the best description, in the sense of what we can do with it, is a combinatorial one. What has always

A short exposition of S. Parsa's theorem on intrinsic linking and non-realizability

TLDR
A short statement and proof of the following result by S. Parsa, where L is a graph such that any two disjoint cycles have zero linking number.

A Short Exposition of Salman Parsa’s Theorems on Intrinsic Linking and Non-realizability

TLDR
This work presents a short exposition of the following result by Salman Parsa, where L admits a PL embedding into R 3 such that any two disjoint cycles have zero linking number.

Branko Gr\"unbaum in many dimensions.

Even though he was nearly 90 years old, I was still surprised and sad to hear that Branko Grünbaum had passed away. I took courses from Branko as a graduate student at the University of Washington. I

References

SHOWING 1-10 OF 32 REFERENCES

On the Complexity of Embeddable Simplicial Complexes

This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r +

Some Ramsey-type results on intrinsic linking of n–complexes

Define the complete n-complex on N vertices to be the n-skeleton of an (N-1)-simplex. We show that embeddings of sufficiently large complete n-complexes in R^{2n+1} necessarily exhibit complicated

Embedding products of graphs into Euclidean spaces

For any collection of graphs we find the minimal dimension d such that the product of these graphs is embeddable into the d-dimensional Euclidean space. In particular, we prove that the n-th powers

Minors in random and expanding hypergraphs

TLDR
A new notion of minors for simplicial complexes (hypergraphs), so-called homological minors, are introduced to propose a general approach to attack certain extremal problems for sparse simplicialcomplexs and the corresponding threshold problems for random complexes.

Imbeddings of simplicial complexes

Abstract : A family of n-dimensional simplicial complexes which are not topologically imbeddable in Euclidean (2d)-space E superscript 2d is constructed. It contains as extremal cases the previously

On the existence of triangulated spheres in 3-graphs, and related problems

1. An r-graph, H (') consists of a set T7(H ( ') ) o I' vertices, and a class E(H( ' ) of r-subsets of V(H( ' ) ) (i .e . unordered r-tuples of vertices) . We shall use various letters (in place of

Approximating embeddings of polyhedra in codimension three

Let F be a p-dimensional polyhedron and let C be a PL q- manifold without boundary. (Neither is necessarily compact.) The purpose of this paper is to prove that, if q — p > 3, then any topological

Sachs' Linkless Embedding Conjecture

TLDR
It is proved that Sachs′ conjecture that a graph can be embedded in 3-space so that it contains no non-trivial link if and only if it contains as a minor none of the seven graphs obtainable from K 6 by Y − Δ and Δ − Y exchanges.

On extremal problems of graphs and generalized graphs

TLDR
It is proved that to everyl andr there is anε(l, r) so that forn>n0 everyr-graph ofn vertices andnr−ε( l, r), which means that all ther-tuples occur in ther-graph.

On Counting Triangulations in D Dimensions

  • T. Dey
  • Mathematics
    Comput. Geom.
  • 1993