English
Related papers

Related papers: Many triangulated odd-spheres

200 papers

Extending work of Kapouleas and Yang, for any integers $N \geq 2$, $k, \ell \geq 1$, and $m$ sufficiently large, we apply gluing methods to construct in the round $3$-sphere a closed embedded minimal surface that has genus $k\ell…

Differential Geometry · Mathematics 2020-07-28 David Wiygul

Consider a polygon P and all neighboring circles (circles going through three consecutive vertices of P). We say that a neighboring circle is extremal if it is empty (no vertices of P inside) or full (no vertices of P outside). It is well…

Metric Geometry · Mathematics 2011-04-01 Arseniy Akopyan , Alexey Glazyrin , Oleg R. Musin , Alexey Tarasov

We study intersection of two polyhedral spheres without self-intersections in 3-space. We find necessary and sufficient conditions on sequences x = x_1,x_2,...,x_n, y = y_1,y_2,...,y_n of positive integers, for existence of 2-dimensional…

Geometric Topology · Mathematics 2015-03-17 Alexey Rukhovich

A multidimensional nonnegative matrix is called polystochastic if the sum of entries in each of its lines equals $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$ known as the…

Combinatorics · Mathematics 2025-02-14 Anna A. Taranenko

In 1983, Banchoff and Kuhnel constructed a minimal triangulation of $\CP^2$ with 9 vertices. $\CP^3$ was first triangulated by Bagchi and Datta in 2012 with 18 vertices. Known lower bound on number of vertices of a triangulation of $\CP^n$…

Geometric Topology · Mathematics 2025-09-10 Soumen Sarkar

We define a certain merging operation that given two $d$-polytopes $P$ and $Q$ such that $P$ has a simplex facet $F$ and $Q$ has a simple vertex $v$ produces a new $d$-polytope $P\hspace{0.1em}\triangleright Q$ with $f_0(P)+f_0(Q)-(d+1)$…

Combinatorics · Mathematics 2023-05-04 Isabella Novik , Hailun Zheng

Let $\Pi$ be a projective plane of order $n$ and $\Gamma_{\Pi}$ be its Levi graph (the point-line incidence graph). For fixed $k \geq 3$, let $c_{2k}(\Gamma_{\Pi})$ denote the number of $2k$-cycles in $\Gamma_{\Pi}$. In this paper we show…

Combinatorics · Mathematics 2021-04-08 Vladislav Taranchuk

Ozkan et al. conjectured that any packing of $n$ spheres with generic radii will be stress-free, and hence will have at most $3n-6$ contacts. In this paper we prove that this conjecture is true for any sphere packing with contact graph of…

Combinatorics · Mathematics 2024-01-04 Sean Dewar

We construct the first explicit example of a simplicial 3-ball B_{15,66} that is not collapsible. It has only 15 vertices. We exhibit a second 3-ball B_{12,38} with 12 vertices that is collapsible and evasive, but not shellable. Finally, we…

Combinatorics · Mathematics 2014-04-21 Bruno Benedetti , Frank H. Lutz

For $N \geq 4$ we classify the $(N-3)$-degenerate smooth CR maps of the three-dimensional unit sphere into the $(2N-1)$-dimensional unit sphere. Each of these maps has image being contained in a five-dimensional complex-linear space and is…

Complex Variables · Mathematics 2024-04-29 Giuseppe della Sala , Bernhard Lamel , Michael Reiter , Duong Ngoc Son

Take a circle and mark $n\in\mathbb{N}$ points on it designated as vertices. For any arc segment between two consecutive vertices which does not pass through any other vertex, there is a disk centered at its midpoint and has its end points…

Combinatorics · Mathematics 2021-02-05 Purevsuren Damba , Uuganbaatar Ninjbat

For a set $P$ of $n$ points in $\mathbb R^d$, for any $d\ge 2$, a hyperplane $h$ is called $k$-rich with respect to $P$ if it contains at least $k$ points of $P$. Answering and generalizing a question asked by Peyman Afshani, we show that…

Combinatorics · Mathematics 2026-02-16 Zuzana Patáková , Micha Sharir

In terms of the number of triangles, it is known that there are more than exponentially many triangulations of surfaces, but only exponentially many triangulations of surfaces with bounded genus. In this paper we provide a first geometric…

Combinatorics · Mathematics 2018-05-10 Karim Adiprasito , Bruno Benedetti

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Combinatorics · Mathematics 2020-01-15 James Davies , Carsten Thomassen

Choice of an appropriate (3+1)-foliation of spacetime or a (2+1)-foliation of the Cauchy space, leads often to a substantial simplification of various mathematical problems in General Relativity Theory. We propose a new method to construct…

General Relativity and Quantum Cosmology · Physics 2013-08-22 Hans-Peter Gittel , Jacek Jezierski , Jerzy Kijowski , Szymon Łȩski

For each integer k > 1, Johnson gave a 3-manifold with Heegaard splittings of genera 2k and 2k-1 such that any common stabilization of these two surfaces has genus at least 3k-1. We modify his argument to produce a 3-manifold with two…

Geometric Topology · Mathematics 2011-12-30 Kazuto Takao

We construct a simple topological invariant of certain 3-manifolds, including quotients of the 3-sphere by finite groups, based on the fact that the tangent bundle of an orientable 3-manifold is trivialisable. This invariant is strong…

Geometric Topology · Mathematics 2007-05-23 Siddhartha Gadgil

Let $\Omega$ be a non-singular syplectic form on some vector space $V$. Denote by $S^{n}_{k}(\Omega)$ the set of all $k$-dimensional planes $s$ in $V$ such that the restriction of $\Omega$ onto $s$ is singular. For the cases when $k=2,n-2$…

Symplectic Geometry · Mathematics 2007-05-23 Mark A. Pankov

The classical Heawood inequality states that if the complete graph $K_n$ on $n$ vertices is embeddable in the sphere with $g$ handles, then $g \ge\dfrac{(n-3)(n-4)}{12}$. A higher-dimensional analogue of the Heawood inequality is the…

Combinatorics · Mathematics 2025-06-30 S. Dzhenzher , A. Skopenkov

Consider a M\"obius strip with $n$ chosen points on its edge. A triangulation is a maximal collection of arcs among these points and cuts the strip into triangles. In this paper, we proved the number of all triangulations that one can…

Combinatorics · Mathematics 2023-11-08 Bazier-Matte Véronique , Huang Ruiyan , Luo Hanyi