Related papers: A Lost Counterexample and a Problem on Illuminated…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
The full U-duality symmetry of toroidally compactified M-theory can only be displayed by allowing non-rectangular tori with expectation values of the gauge fields. We construct an E_d(Z) U-duality invariant mass formula incorporating…
We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…
Let $\Delta(d,n)$ denote the maximum diameter of a $d$-dimensional polyhedron with $n$ facets. In this paper, we propose a unified analysis of a recursive inequality about $\Delta(d,n)$ established by Kalai and Kleitman in 1992. This yields…
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…
We prove that for any two closed Riemannian manifolds $M^{2m}$ ($m\geq 1$) and $N$, there exists a minimizing (extrinsic) $m$-polyharmonic map for every free homotopy class in $[M^{2m}, N]$, provided that the homotopy group $\pi_{2m}(N)$ is…
We study the following question: fix a sufficient general curve D of degree d in P^2, what is the least number of intersections between D and an irreducible curve of degree m? G. Xu proved this number i(d, m) is at least d - 2 for all m.…
In the paper we provide a new method of proving the existence of a hypersurface of degree $d$ in $\mathbb{P}^n$, with a general point of multiplicity $m$ and vanishing at a given set of points $Z$, by looking at weak combinatorics of a set…
We provide a counterexample to the HK-conjecture using the flat manifold odometers constructed by Deeley. Deeley's counterexample uses an odometer built from a flat manifold of dimension 9 and an expansive self-cover. We strengthen this…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…
We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…
In 1988, Kalai extended a construction of Billera and Lee to produce many triangulated (d-1)-spheres. In fact, in view of upper bounds on the number of simplicial d-polytopes by Goodman and Pollack, he derived that for every dimension d>=5,…
A lattice $(d,k)$-polytope is the convex hull of a set of points in $\mathbb{R}^d$ whose coordinates are integers ranging between $0$ and $k$. We consider the smallest possible distance $\varepsilon(d,k)$ between two disjoint lattice…
In this note we prove two results on the quantitative illumination parameter f(d) of the unit ball of a d-dimensional normed space introduced by K. Bezdek (1992). The first is that f(d) = O(2^d d^2 log d). The second involves Steiner…
The aim of this note is to solve a problem proposed by J. Tate in 1968 by offering a counter-example of the linearity of the trace for the sum of two finite potent operators on an infinite-dimensional vector space.
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X. This…
Borsuk asked in 1933 if every set of diameter 1 in $R^d$ can be covered by $d+1$ sets of smaller diameter. In 1993, a negative solution, based on a theorem by Frankl and Wilson, was given by Kahn and Kalai. In this paper I will present…