English
Related papers

Related papers: Simplicial complexes from finite projective planes…

200 papers

We construct embeddings of simplicial complexes into a (surface of a) simplicial ball whose triangulation has bounded degrees and low volume. This construction can be used either to efficiently "simplify a complicated space" by realizing it…

Geometric Topology · Mathematics 2022-11-29 Aleksandr Berdnikov

We show that any finite triangulation of the real projective plane or the dunce hat is partitionable. To prove this, we introduce simple yet useful gluing tools that allow us to reduce partitionability of a given complex to that of smaller…

Combinatorics · Mathematics 2022-07-19 Andrés D. Santamaría-Galvis

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 obstruction allows us to provide a systematic…

Geometric Topology · Mathematics 2017-03-06 Anders Björner , Afshin Goodarzi

Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement graphs of simple great-circle arrangements have chromatic number at most $3$. Motivated by this conjecture, we study the colorability of arrangement graphs for different…

In this paper we study the Buchstaber invariant of simplicial complexes, which comes from toric topology. With each simplicial complex $K$ on $m$ vertices we can associate a moment-angle complex $\mathcal Z_K$ with a canonical action of the…

Algebraic Topology · Mathematics 2012-12-18 Nickolai Erokhovets

A simplicial complement P is a sequence of subsets of [m] and the simplicial complement P corresponds to a unique simplicial complex K with vertices in [m]. In this paper, we defined the homology of a simplicial complement…

Algebraic Topology · Mathematics 2010-11-22 Xiangjun Wang , Qibing Zheng

A simplicial complex $H$ consists of a pair of sets $(V,E)$ where $V$ is a set of vertices and $E\subseteq\mathscr{P}(V)$ is a collection of subsets of $V$ closed under taking subsets. Given a simplicial complex $F$ and $n\in \mathbb N$,…

Combinatorics · Mathematics 2023-10-04 David Conlon , Simón Piga , Bjarne Schülke

In this paper we construct and study a new 15-vertex triangulation $X$ of the complex projective plane $\CP^2$. The automorphism group of $X$ is isomorphic to $S_4\times S_3$. We prove that the triangulation $X$ is the minimal by the number…

Geometric Topology · Mathematics 2024-11-20 Alexander A. Gaifullin

The 4-dimensional abstract Kummer variety K^4 with 16 nodes leads to the K3 surface by resolving the 16 singularities. Here we present a simplicial realization of this minimal resolution. Starting with a minimal 16-vertex triangulation of…

Combinatorics · Mathematics 2019-10-24 Jonathan Spreer , Wolfgang Kühnel

We write out some sequences of linear maps of vector spaces with fixed bases. Each term of a sequence is a linear space of differentials of metric values ascribed to the elements of a simplicial complex - a triangulation of a manifold. If…

Geometric Topology · Mathematics 2019-08-21 Igor G. Korepanov

We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…

Algebraic Topology · Mathematics 2019-05-07 Amit Kumar Paul

Consider a regular triangulation of the convex-hull $P$ of a set $\mathcal A$ of $n$ points in $\mathbb R^d$, and a real matrix $C$ of size $d \times n$. A version of Viro's method allows to construct from these data an unmixed polynomial…

Algebraic Geometry · Mathematics 2016-04-19 Frédéric Bihan , Pierre-Jean Spaenlehauer

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

Geometric Topology · Mathematics 2021-03-01 Jorge L. Arocha , Jorge Fernández-Hidalgo

In 1987 Brehm and K\"uhnel showed that any combinatorial $d$-manifold with less than $3d/2+3$ vertices is PL homeomorphic to the sphere and any combinatorial $d$-manifold with exactly $3d/2+3$ vertices is PL homeomorphic to either the…

Combinatorics · Mathematics 2024-11-20 Alexander A. Gaifullin

We list all the possible fundamental groups of the complements of real conic-line arrangements with two conics which are tangent to each other at two points, with up to two additional lines. For the computations we use the topological local…

Geometric Topology · Mathematics 2007-05-23 Meirav Amram , David Garber , Mina Teicher

An abstract simplicial complex $\mathbf{F}$ is a non-uniform hypergraph without isolated vertices, whose edge set is closed under taking subsets. The extremal number $\mathrm{ex}(n,\mathbf{F})$ is the maximum number of edges in an…

Combinatorics · Mathematics 2025-08-19 Maria Axenovich , Dániel Gerbner , Dingyuan Liu , Balázs Patkós

We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…

Combinatorics · Mathematics 2019-08-15 Stefan Felsner

We give an explicit description of all smooth varieties with a torus action of complexity one having Picard number at most two. As a consequence, we classify in every dimension the smooth (almost) Fano varieties with a torus action of…

Algebraic Geometry · Mathematics 2025-07-08 Anne Fahrner , Juergen Hausen , Michele Nicolussi

A simplicial complex is $r$-conic if every subcomplex of at most $r$ vertices is contained in the star of a vertex. A $4$-conic complex is simply connected. We prove that an $8$-conic complex is $2$-connected. In general a $(2n+1)$-conic…

Algebraic Topology · Mathematics 2021-03-09 Jonathan A. Barmak

We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifold is cut only along its edges. The resulting layout is…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke