Related papers: Selection Lemmas for various geometric objects
In this paper we show that if $p$ is a polynomial which bifurcates then the product map $(z,w)\mapsto(p(z),q(w))$ can be approximated by polynomial skew products possessing special dynamical objets called blenders. Moreover, these objets…
This paper introduces a method to detect each geometrically significant loop that is a geodesic circle (an isometric embedding of $S^1$) and a bottleneck loop (meaning that each of its perturbations increases the length) in a geodesic space…
In image set classification, a considerable advance has been made by modeling the original image sets by second order statistics or linear subspace, which typically lie on the Riemannian manifold. Specifically, they are Symmetric Positive…
Obtaining an efficient bound for the triangle removal lemma is one of the most outstanding open problems of extremal combinatorics. Perhaps the main bottleneck for achieving this goal is that triangle-free graphs can be highly unstructured.…
Artificial objects usually have very stable shape features, which are stable, persistent properties in geometry. They can provide evidence for object recognition. Shape features are more stable and more distinguishing than appearance…
Overlapping colors and cluttered or weak edges are common segmentation problems requiring additional regularization. For example, star-convexity is popular for interactive single object segmentation due to simplicity and amenability to…
The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be rotated and cannot…
We deal with unweighted and weighted enumerations of lozenge tilings of a hexagon with side lengths $a,b+m,c,a+m,b,c+m$, where an equilateral triangle of side length $m$ has been removed from the center. We give closed formulas for the…
We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer $d$ there is a constant $c_d > 0$ such that whenever $X_1,..., X_{d+1}$ are $n$-element subsets of $\mathbb{R}^d$, then we…
We establish a Sewing lemma in the regime $\gamma \in \left( 0, 1 \right]$, constructing a Sewing map which is neither unique nor canonical, but which is nonetheless continuous with respect to the standard norms. Two immediate corollaries…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
This survey is a presentation of the arguments in the proof that Henon-like maps f_a(x,y)=(1-a x^2,0) + R(a,x,y) with |R(a,x,y)|< b have a "strange attractor", with positive Lebesgue probability in the parameter "a", if the perturbation…
In this paper, authors prove that if $X$ is a weak Asplund space, then the space $X\times R$ is a weak Asplund space. Thus the author definitely answered an open problem raised by D.G. Larman and R.R. Phelps for 45 years ago (J. London.…
A particularly interesting instance of supervised learning with kernels is when each training example is associated with two objects, as in pairwise classification (Brunner et al., 2012), and in supervised learning of preference relations…
Semantic patterns of fine-grained objects are determined by subtle appearance difference of local parts, which thus inspires a number of part-based methods. However, due to uncontrollable object poses in images, distinctive details carried…
This paper gives a generic form of the diamond lemma, which includes support for additive and topological structures of the base set, and which does not require any further structure (e.g. an associative multiplication operation) to be…
We present a mathematical and algorithmic scheme for learning the principal geometric elements in an image or 3D object. We build on recent work that convexifies the basic problem of finding a combination of a small number shapes that…
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry…
Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…
Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…