Related papers: Lower Bounds for Cubical Pseudomanifolds

In this note we show that the maximum number of vertices in any polyhedron $P=\{x\in \mathbb{R}^d : Ax\leq b\}$ with $0,1$-constraint matrix $A$ and a real vector $b$ is at most $d!$.

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in R^d is contained in at least floor((d+2)^2/4) simplices with one vertex from each set.

We identify as topological spheres those complete submanifolds lying with any codimension in hyperbolic space whose Ricci curvature satisfies a lower bound contingent solely upon the length of the mean curvature vector of the immersion.

On a $2m$-dimensional closed manifold we investigate the existence of prescribed $Q$-curvature metrics with conical singularities. We present here a general existence and multiplicity result in the supercritical regime. To this end, we…

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…

In this work, the classical Borsuk conjecture is discussed, which states that any set of diameter 1 in the Euclidean space $ {\mathbb R}^d $ can be divided into $ d+1 $ parts of smaller diameter. During the last two decades, many…

E. Calabi and J. Cao showed that a closed geodesic of least length in a two-sphere with nonnegative curvature is always simple. Using min-max theory, we prove that for some higher dimensions, this result holds without assumptions on the…

Yudin's lower bound for the spherical designs is generalized to the cubature formulas on the projective spaces over a field K, where K can be R, C, or H (the field of quaternions), and thus to isometric embeddings of l_2 into l_p with p an…

In this note, we give a characterization of immersed submanifolds of simply-connected space forms for which the quotient of the extrinsic diameter by the focal radius achieves the minimum possible value of $2$. They are essentially round…

We introduce a simple algorithm which transforms every four-dimensional cubulation into a cusped finite-volume hyperbolic four-manifold. Combinatorially distinct cubulations give rise to topologically distinct manifolds. Using this…

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Several recent papers have addressed the problem of characterizing the $f$-vectors of cubical polytopes. This is largely motivated by the complete characterization of the $f$-vectors of simplicial polytopes given by Stanley, Billera, and…

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

An axis-parallel b-dimensional box is a Cartesian product $R_1 \times R_2 \times ... \times R_b$ where each $R_i$ (for $1 \leq i \leq b$) is a closed interval of the form $[a_i,b_i]$ on the real line. The boxicity of any graph $G$, box(G)…

A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…

We show that for $d\geq 2$ every finite $d$-dimensional simplicial complex is a deformation retract of a $(2d-1)$-dimensional pseudomanifold with boundary. Moreover, it embeds as a retract in a closed $(2d-1)$-dimensional pseudomanifold.

We prove the macroscopic cousins of three conjectures: 1) a conjectural bound of the simplicial volume of a Riemannian manifold in the presence of a lower scalar curvature bound, 2) the conjecture that rationally essential manifolds do not…

Almost paracontact almost paracomplex Riemannian manifolds of the lowest dimension are studied. Such structures are constructed on hyperspheres in 4-dimensional spaces, Euclidean and pseudo-Euclidean, respectively. The obtained manifolds…

Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…

A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is minimal if the deletion of each edge results in a…