Related papers: Extremal antipodal polygons and polytopes

In this paper, we introduce the notion of generalized $s$-manifolds, which is a generalization of symmetric spaces. Then we give a method to construct generalized $s$-manifolds and present some typical examples. We study polars and…

We determine all critical configurations for the Area function on polygons with vertices on a circle or an ellipse. For isolated critical points we compute their Morse index, resp index of the gradient vector field. We relate the…

We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…

We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials $p$ minimizing Dirichlet-type norms $\|pf-1\|_{\alpha}$ for a given function $f$. For $\alpha\in [0,1]$ (which includes the Hardy and…

A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…

Suppose $0 < p \leq 2$ and that $(\Omega, \mu)$ is a measure space for which $L_{p}(\Omega, \mu)$ is at least two-dimensional. The central results of this paper provide a complete description of the subsets of $L_{p}(\Omega, \mu)$ that have…

We determine the polar and the maximal antipodal set $P$ for the outer 3-symmetric space $\mathbb{S}^7 \times \mathbb{S}^7 = \mathrm{Spin}_8/G_2$ where the 3-symmetric structure is given by the triality automorphism $\tau$ on…

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

We consider extremal polynomials with respect to a Sobolev-type $p$-norm, with $1<p<\infty$ and measures supported on compact subsets of the real line. For a wide class of such extremal polynomials with respect to mutually singular measures…

Extremal length is a classical tool in 1-dimensional complex analysis for building conformal invariants. We propose a higher-dimensional generalization for complex manifolds and provide some ideas on how to estimate and calculate it. We…

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…

Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points of $P$ in $O(nk^2 \log n+ n\log^2 n)$ time. We also consider the problem of, given…

Characterization of entropy functions is of fundamental importance in information theory. By imposing constraints on their Shannon outer bound, i.e., the polymatroidal region, one obtains the faces of the region and entropy functions on…

We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…

I present a conjecture that all two-loop MHV amplitudes in planar $\mathcal{N} = 4$ super-Yang-Mills theory possess an antipodal symmetry when evaluated on parity-even kinematics. The symmetry acts as a change of basis on the symbol…

We study a particular class of representations from the fundamental groups of punctured spheres $\Sigma_{0,n}$ to the group $\text{PSL} (2,\mathbb R)$ (and their moduli spaces), that we call \emph{super-maximal}. Super-maximal…

Given a set of squares and a strip of bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are…

We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…

In this paper we consider planar polygons with parallel opposite sides. This type of polygons can be regarded as discretizations of closed convex planar curves by taking tangent lines at samples with pairwise parallel tangents. For this…

Characterization of entropy functions is of fundamental importance in information theory. By imposing constraints on their Shannon outer bound, i.e., the polymatroidal region, one obtains the faces of the region and entropy functions on…