相关论文: A geometric inequality for circle packings
A geometric approach to formulate the uncertainty principle between quantum observables acting on an $N$-dimensional Hilbert space is proposed. We consider the fidelity between a density operator associated with a quantum system and a…
We prove a simple inequality for a sum of squares of norms of two vectors in an inner product space. Next, using this inequality we derive the so--called "reverse uncertainty relation" and analyze its properties.
We consider circle packings in the plane with circles of sizes $1$, $r\simeq 0.834$ and $s\simeq 0.651$. These sizes are algebraic numbers which allow a compact packing, that is, a packing in which each hole is formed by three mutually…
We introduce a direct numerical treatment of nonlinear higher-index differential-algebraic equations by means of overdetermined polynomial least-squares collocation. The procedure is not much more computationally expensive than standard…
Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.
The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…
We provide an algorithm for computing the number of integral points lying in certain triangles that do not have integral vertices. We use techniques from Algebraic Geometry such as the Riemann-Roch formula for weighted projective planes and…
We introduce a new method for finding a non-realizability certificate of a simplicial sphere Sigma: we exhibit a monomial combination of classical 3-term Pl\"ucker relations that yields a sum of products of determinants that are known to be…
We establish a family of parametric isoperimetric-type inequalities with multiple geometric quantities for closed convex curves. These inequalities hold under certain parameter conditions. We also prove the equality conditions. Some new…
In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our…
We propose a successive generation of cutting inequalities for binary quadratic optimization problems. Multiple cutting inequalities are successively generated for the convex hull of the set of the optimal solutions $\subset \{0, 1\}^n$,…
We survey some of our recent results on inverse problems for evolution equations. The goal is to provide a unified approach to solve various types of evolution equations. The inverse problems we consider consist in determining unknown…
We introduce and solve a two-matrix model for the tri-coloring problem of the vertices of a random triangulation. We present three different solutions: (i) by orthogonal polynomial techniques (ii) by use of a discrete Hirota bilinear…
The equality constraint a+b+c=1 for random triangle sides corresponds to breaking a stick in two places. An analog a^2+b^2+c^2=1 has a remarkable feature: the bivariate density for angles coincides with that for 3D Gaussian triangles.…
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…
In its most general form, the recognition problem in Riemannian geometry asks for the identification of an unknown Riemannian manifold via measurements of metric invariants on the manifold. We introduce a new infinite sequence of…
The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…
We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…