Related papers: Some extremal problems for polygons in the Euclide…
We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…
We prove the existence of infinitely many solutions to an elliptic problem by borrowing the techniques from algebraic topology. The solution(s) thus obtained will also be proved to be bounded.
The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on…
Hodograph equations for the Euler equation in curved spaces with constant pressure are discussed. It is shown that the use of known results concerning geodesics and associated integrals allows to construct several types of hodograph…
Paper is devoted to extremal problems in geometric function theory of complex variables associated with estimates of functionals defined on the systems of non-overlapping domains. In particular, we strengthen some known result in this…
We study effective versions of unlikely intersections of images of torsion points of elliptic curves on the projective line.
In Euclidean space there is a trivial upper bound on the maximum length of a compound "walk" built up of variable-length jumps, and a considerably less trivial lower bound on its minimum length. The existence of this non-trivial lower bound…
We develop an algorithm computing the transcendental lattice and the Mordell--Weil group of an extremal elliptic surface. As an example, we compute the lattices of four exponentially large series of surfaces
Many problems in Euclidean geometry, arising in computational design and fabrication, amount to a system of constraints, which is challenging to solve. We suggest a new general approach to the solution, which is to start with analogous…
Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…
For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…
Consider a polygon P and all neighboring circles (circles going through three consecutive vertices of P). We say that a neighboring circle is extremal if it is empty (no vertices of P inside) or full (no vertices of P outside). It is well…
We develop a constructive process which determines all extreme points of the unit ball of the space of $m$--linear forms, $m\geq1.$ Our method provides a full characterization of the geometry of that space through finitely many elementary…
We consider the set of extremal points of the generalized unit ball induced by gradient total variation seminorms for vector-valued functions on bounded Euclidean domains. These are central to the understanding of sparse solutions and…
We study the projections in vector spaces over finite fields. We prove finite fields analogues of the bounds on the dimensions of the exceptional sets for Euclidean projection mapping. We provide examples which do not have exceptional…
We consider overdetermined problems of Serrin's type in convex cones for (possibly) degenerate operators in the Euclidean space as well as for a suitable generalization to space forms. We prove rigidity results by showing that the existence…
Conformal transformations of a Euclidean (complex) plane have some kind of completeness (sufficiency) for the solution of many mathematical and physical-mathematical problems formulated on this plane. There is no such completeness in the…
The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…
Some Open Problems Concerning Orthogonal Polynomials.
In this paper, we show that if we decompose a polygon into two smaller polygons, then by comparing the number of extremal vertices in the original polygon versus the sum of the two smaller polygons, we can gain at most two globally extremal…