Related papers: A geometric inequality for circle packings
We give several descriptions of positive quadrature formulas which are exact for trigonometric -, respectively, Laurent polynomials of degree less or equal $n-1-m$, $0\leq m\leq n-1$. A complete and simple description is obtained with the…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
In this short note the authors give answers to the three open problems formulated by Wu and Srivastava [{\it Appl. Math. Lett. 25 (2012), 1347--1353}]. We disprove the Problem 1, by showing that there exists a triangle which does not…
Given the projections of two semialgebraic sets defined by polynomial matrix inequalities, it is in general difficult to determine whether one is contained in the other. To address this issue we propose a new matrix Positivstellensatz that…
The problem of packing a set of circles into the smallest surrounding container is considered. This problem arises in different application areas such as automobile, textile, food, and chemical industries. The so-called circle packing…
We present a method for establishing invariant manifolds for saddle--center fixed points. The method is based on cone conditions, suitably formulated to allow for application in computer assisted proofs, and does not require rigorous…
In this paper, we explain a procedure based on a classical result of Sturm that can be used to determine rigorously whether a given trigonometric polynomial is nonnegative in a certain interval or not. Many examples are given. This…
We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…
This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non-overlapping circles. The first half of the article is an exposition of…
We prove a sharp Sobolev inequality on manifolds with nonnegative Ricci curvature. Moreover, we prove a Michael-Simon inequality for submanifolds in manifolds with nonnegative sectional curvature. Both inequalities depend on the asymptotic…
Certain topics on polygons are extended from Euclidean to hyperbolic geometry. This first part deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The non-Euclidean versions are more difficult due to the…
Pairwise comparison matrices often exhibit inconsistency, therefore many indices have been suggested to measure their deviation from a consistent matrix. A set of axioms has been proposed recently that is required to be satisfied by any…
We study the reverse triangle inequalities for suprema of logarithmic potentials on compact sets of the plane. This research is motivated by the inequalities for products of supremum norms of polynomials. We find sharp additive constants in…
Motivated by inequalities in Fourier analysis, we present an improvement on the lower bound for the sign uncertainty principle of Bourgain, Clozel and Kahane in high dimensions. Additionally, our methods can be used to match the existing…
This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported…
We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding…
The concept of sums of nonnegative circuit polynomials (SONC) was recently introduced as a new certificate of nonnegativity especially for sparse polynomials. In this paper, we explore the relationship between nonnegative polynomials and…
We prove an inequality for polynomials applied in a symmetric way to non-commuting operators.
Symmetry in integer programming causes redundant search and is often handled with symmetry breaking constraints that remove as many equivalent solutions as possible. We propose an algebraic method which allows to generate a random family of…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…