Related papers: Limits of Order Types
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis…
We develop three approaches of combinatorial flavour to study the structure of minimal codes and cutting blocking sets in finite geometry, each of which has a particular application. The first approach uses techniques from algebraic…
Methods for measuring convexity defects of compacts in R^n abound. However, none of the those measures seems to take into account continuity. Continuity in convexity measure is essential for optimization, stability analysis, global…
One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…
We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…
This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…
We use vortex matter in type-II superconductors as a playground to study how different types of disorder affect the long wavelength density fluctuations of the system. We find that irrespective of the vortex-vortex interaction, in the case…
We develop an adaptive-metric framework for norm-minimization-based outer approximation algorithms in bounded convex vector optimization. The key idea is to let the scalarization metric vary across iterations while measuring approximation…
In the context of elasticity theory, rigidity theorems allow to derive global properties of a deformation from local ones. This paper presents a new asymptotic version of rigidity, applicable to elastic bodies with sufficiently stiff…
We design a class of Chudnovsky-type algorithms multiplying k elements of a finite extension of order n a finite field K. We prove that these algorithms give a tensor decomposition of the k-multiplication for which the rank is linear in n…
We generalize ultraproducts and local-global limits of graphs to hypergraphs and other structures. We show that the local statistics of an ultraproduct of a sequence of hypergraphs are the ultralimits of the local statistics of the…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
We establish a regularity result for the metric on any 4-dimensional extremal K\"ahler manifold, and a weak compactness theorem on the space of such metrics. Specifically, the sectional curvature at a point is bounded when the quantity…
Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…
Caffarelli's contraction theorem states that probability measures with uniformly logconcave densities on R d can be realized as the image of a standard Gaussian measure by a globally Lipschitz transport map. We discuss some counterexamples…
Different notions for order convergence have been considered by various authors. Associated to every notion of order convergence corresponds a topology, defined by taking as the closed sets those subsets of the poset satisfying that no net…
We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in $\mathbb R^d$. In our setting we allow multiple vertices to be constrained to the same line. Under a mild…
In general, standard necessary optimality conditions cannot be formulated in a straightforward manner for semi-smooth shape optimization problems. In this paper, we consider shape optimization problems constrained by variational…