A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and edge-antipodal polytopes. We show that the number of vertices of a subequilateral polytope in any d-dimensional normed space is bounded above by (d / 2 + 1) d for any d ≥ 2. The same upper bound then follows for the number of vertices of the edge-antipodal polytopes introduced by I. Talata [19]. This is a constructive improvement to the result of A. Pór (to appear) that for each dimension d there exists an upper bound f(d) for the number of vertices of an edge-antipodal d-polytopes. We also show that in ...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
In this paper we establish the existence and partial regularity of a (d-2)-dimensional edge-length m...
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each ...
We characterize three-dimensional spaces admitting at least six or at least seven equidistant points...
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increa...
Abstract Since at least half of the d edges incident to a vertex u of a simple d-polytope P either a...
AbstractSince at least half of the d edges incident to a vertex v of a simple d-polytope P either al...
We define two $d$-polytopes, both with $2d+2$ vertices and $(d+3)(d-1)$ edges, which reduce to the c...
Let ci(n, d) be the number of i-dimensional faces of a cyclic d-polytope on n vertices. We present a...
For a d-dimensional polytope with v vertices, d + 1 = 0.62d. This confirms a conjecture of Grunbaum,...
The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ ...
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. ...
Treballs finals del Màster en Matemàtica Avançada, Facultat de matemàtiques, Universitat de Barcelon...
AbstractThe enumeration of normal surfaces is a key bottleneck in computational three-dimensional to...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
In this paper we establish the existence and partial regularity of a (d-2)-dimensional edge-length m...
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each ...
We characterize three-dimensional spaces admitting at least six or at least seven equidistant points...
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increa...
Abstract Since at least half of the d edges incident to a vertex u of a simple d-polytope P either a...
AbstractSince at least half of the d edges incident to a vertex v of a simple d-polytope P either al...
We define two $d$-polytopes, both with $2d+2$ vertices and $(d+3)(d-1)$ edges, which reduce to the c...
Let ci(n, d) be the number of i-dimensional faces of a cyclic d-polytope on n vertices. We present a...
For a d-dimensional polytope with v vertices, d + 1 = 0.62d. This confirms a conjecture of Grunbaum,...
The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ ...
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. ...
Treballs finals del Màster en Matemàtica Avançada, Facultat de matemàtiques, Universitat de Barcelon...
AbstractThe enumeration of normal surfaces is a key bottleneck in computational three-dimensional to...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
In this paper we establish the existence and partial regularity of a (d-2)-dimensional edge-length m...