On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space (Q1745202): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Embedding products of graphs into Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Embeddings of Polyhedra In Codimension Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting triangulations in \(d\) dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting triangle crossings and halving planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imbeddings of simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological cliques in graphs II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphiesätze für Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sachs' linkless embedding conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4756475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and commutative algebra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ramsey-type results on intrinsic linking of \(n\)-complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imbedding Classes and n-Minimal Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minors in random and expanding hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 12:40, 15 July 2024

scientific article
Language Label Description Also known as
English
On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space
scientific article

    Statements

    On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space (English)
    0 references
    0 references
    20 April 2018
    0 references
    The paper contains the following results on intrinsic linking in \(\mathbb R^{2d+1}\) and realizability in \(\mathbb R^{2d}\) of \(d\)-dimensional simplicial complexes (or hypergraphs). Theorem 4.1. For every \(d\) there is \(C\) such that for every \(n\) every \(d\)-dimensional simplicial complex having \(n\) vertices and embeddable into \(\mathbb R^{2d}\) contains less than \(Cn^{d+1-3^{1-d}}\) simplices of dimension \(d\). Theorem 4.2. (corrected) For every \(d\) there is \(C\) such that for every \(n\) every \(d\)-dimensional simplicial complex having \(n\) vertices and embeddable into \(\mathbb R^{2d+1}\) so that any two disjoint \(d\)-dimensional cycles have zero linking number, contains less than \(Cn^{d+1-4^{1-d}}\) simplices of dimension \(d\). The proofs of Theorems 4.1 and 4.2 contain gaps, cf. [\textit{A. Skopenkov}, ``A short exposition of S. Parsa's theorems on intrinsic linking and non-realizability'', Preprint, \url{arXiv:1808.08363}, Remark 8.ab] which are present even in versions 5 and 6 of the arXiv-version of the present article, \url{arXiv:1512.05164}. Theorem 4.1 is covered by the Grünbaum-Kalai-Sarkaria conjecture (whose proof is announced in [\textit{K. Adiprasito}, ``Combinatorial Lefschetz theorems beyond positivity'', Preprint, \url{arXiv:1812.10454}]; the reviewer did not check that proof). Theorem 1.1. (reformulated) Let \(L\) be a \(d\)-dimensional simplicial complex such that the join \(L*\{1,2,3\}\) (i.e. the union of three cones over \(L\) along their common bases) embeds into \(\mathbb R^{2d+2}\). Then \(L\) admits an embedding into \(\mathbb R^{2d+1}\) such that any two disjoint \(d\)-dimensional cycles have zero linking number. The proof of Theorem 1.1 uses rediscovery of the main idea of [\textit{M. Skopenkov}, Fundam. Math. 179, No. 3, 191--198 (2003; Zbl 1051.57032)], see [\textit{A. Skopenkov}, loc. cit., Remark 7.b]. For a short exposition of these results see [loc. cit.].
    0 references
    embedding
    0 references
    linkless embedding
    0 references
    simplicial complex
    0 references
    Kovari-Sos-Turań Theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references