Related papers: Holonomic approximation through convex integration
We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order…
We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space of functions on a square reference element, which is then…
We give conditions in order to approximate locally uniformly holomorphic covering mappings of the unit ball of $\mathbb{C}^n$ with respect to an arbitrary norm, with entire holomorphic covering mappings. The results rely on a generalization…
Motivated by Kohno's result on the holonomy Lie algebra of a hyperplane arrangement, we define the holonomy Lie algebra of a finite geometric lattice in a combinatorial way. For a solvable pair of lattices, we show that the holonomy Lie…
In general, a system of differential equations is integrable if there exist `sufficiently many' first integrals (FIs) so that its solution can be found by means of quadratures. Therefore, the determination of the FIs is an important issue…
We present a geometric algorithm for obtaining consistent solutions to systems of partial differential equations, mainly arising from singular covariant first-order classical field theories. This algorithm gives an intrinsic description of…
Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…
This paper presents a convex approach to the optimization of a cooperative rendezvous, that is, the problem of two distant spacecraft that simultaneously operate to get closer. Convex programming guarantees convergence towards the optimal…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
The main purpose of this paper is to prove the smooth local orbital linearization theorem for smooth vector fields which admit a complete set of first integrals near a nondegenerate singular point. The main tools used in the proof of this…
In this paper, we prove an $\mathbb{A}^1$-homology version of the Whitehead theorem with dimension bound. We also prove an excision theorem for $\mathbb{A}^1$-homology, Suslin homology and $\mathbb{A}^1$-homotopy sheaves. In order to prove…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
We propose a polynomial force-motion model for planar sliding. The set of generalized friction loads is the 1-sublevel set of a polynomial whose gradient directions correspond to generalized velocities. Additionally, the polynomial is…
In this paper we are concerned with the space of tempered ultrahyperfunctions corresponding to a proper open convex cone. A holomorphic extension theorem (the version of the celebrated edge of the wedge theorem) will be given for this…
We present a general technique for the analysis of first-order methods. The technique relies on the construction of a duality gap for an appropriate approximation of the objective function, where the function approximation improves as the…
Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces. But unlike convex optimization, geodesically convex (g-convex) optimization is much less developed. In this paper we contribute to the…
It is shown using a space-time curvature classification and decomposition that for certain holonomy types of a space-time, proper projective vector fields cannot exist. Existence is confirmed, by example, for the remaining holonomy types.…
In this article we prove that the adjoint polynomial of arbitrary convex polytopes is up to scaling uniquely determined by vanishing to the right order on the polytopes residual arrangement. This answers a problem posed by Kohn and Ranestad…
In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…