Related papers: Many triangulated odd-spheres
Triangulations of the cube into a minimal number of simplices without additional vertices have been studied by several authors over the past decades. For $3\leq n\leq 7$ this so-called simplexity of the unit cube $I^n$ is now known to be…
We show that any n-vertex graph without even cycles of length at most 2k has at most 1/2(n^{1 + 1/k}) + O(n) edges, and polarity graphs of generalized polygons show that this is asymptotically tight when k = 2,3,5.
In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…
The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…
We give a combinatorial description of general homotopy groups of $k$-dimensional spheres with $k\geq3$ as well as those of Moore spaces. For $n>k\geq 3,$ we construct a finitely generated group defined by explicit generators and relations,…
It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…
Take n>k>1 such that n-k is odd. In this paper we consider mapping a from (n-k+1)-dimensional closed ball into the space of (n \times k)--matrices such that its restriction to a sphere goes into the Stiefel manifold V_k(R^n). We construct a…
The sum $\lambda_1 + \lambda_n$ of the maximum and minimum eigenvalues, and the odd girth of a graph both measure bipartiteness. We seek to relate these measures. In particular, for an odd integer $k\geq 3$, let $\gamma_k$ denote the…
We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log^{3/2}n)$. This…
Given a set S of n points in R^D, and an integer k such that 0 <= k < n, we show that a geometric graph with vertex set S, at most n - 1 + k edges, maximum degree five, and dilation O(n / (k+1)) can be computed in time O(n log n). For any…
We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.
Consider triangulations of $\mathbb R P^2$ whose all vertices have valency six except three vertices of valency $4$. In this chapter we prove that the number $f(n)$ of such triangulations with no more than $n$ triangles grows as $C\cdot…
Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…
We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
The face numbers of simplicial complexes without missing faces of dimension larger than $i$ are studied. It is shown that among all such $(d-1)$-dimensional complexes with non-vanishing top homology, a certain polytopal sphere has the…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…
We study balls of homogeneous cubics on $\mathbb R^n$, $n = 2,3$, which are bounded by unity on the unit sphere. For $n = 2$ we completely describe the facial structure of this norm ball, while for $n = 3$ we classify all extremal points…
We consider the configuration space of ordered points on the two-dimensional sphere that satisfy a specific system of quadratic equations. We construct periodic orbits in this configuration space using elliptic theta functions and show that…
Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of…