Related papers: Local Urysohn Width: A Topological Complexity Meas…
We determine lower bounds for the topological complexity of many planar polygon spaces mod isometry. With very few exceptions, the upper and lower bounds given by dimension and cohomology considerations differ by 1. This is true for 130 of…
Model complexity is an important factor to consider when selecting among graphical models. When all variables are observed, the complexity of a model can be measured by its standard dimension, i.e. the number of independent parameters. When…
Similarity learning has received a large amount of interest and is an important tool for many scientific and industrial applications. In this framework, we wish to infer the distance (similarity) between points with respect to an arbitrary…
The simplicial volume is a homotopy invariant of oriented closed connected manifolds measuring the efficiency of representing the fundamental class by singular chains with real coefficients. Despite of its topological nature, the simplicial…
The empirical results suggest that the learnability of a neural network is directly related to its size. To mathematically prove this, we borrow a tool in topological algebra: Betti numbers to measure the topological geometric complexity of…
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…
This text contributes to the foundations of the theory of global Berkovich spaces, that is to say Berkovich spaces over Banach rings with nice properties such as $\mathbf{Z}$, rings of integers of number fields, discrete valuation rings,…
Given a countable, totally ordered commutative monoid $\mathcal{R}=(R,\oplus,\leq,0)$, with least element $0$, there is a countable, universal and ultrahomogeneous metric space $\mathcal{U}_\mathcal{R}$ with distances in $\mathcal{R}$. We…
Given two compact n-dimensional manifolds in the smooth, piecewise linear or topological categories, basic results of B. Mazur and others give simple criteria for determining whether their products with Euclidean spaces of sufficiently…
There are two classes of topologies most often placed on the space of Lorentz metrics on a fixed manifold. As I interpret a complaint of R. Geroch [Relativity, 259 (1970); Gen. Rel. Grav., 2, 61 (1971)], however, neither of these standard…
We study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start of the computation. We focus on the most common such…
We propose an approach for capturing the signal variability in hyperspectral imagery using the framework of the Grassmann manifold. Labeled points from each class are sampled and used to form abstract points on the Grassmannian. The…
The ropelength problem asks for the minimum-length configuration of a knotted diameter-one tube embedded in Euclidean three-space. The core curve of such a tube is called a tight knot, and its length is a knot invariant measuring…
We derive concentration inequalities for the supremum norm of the difference between a kernel density estimator (KDE) and its point-wise expectation that hold uniformly over the selection of the bandwidth and under weaker conditions on the…
We prove the existence of families of distinct isotopy classes of physical unknots through the key concept of parametrised thickness. These unknots have prescribed length, tube thickness, a uniform bound on curvature, and cannot be…
In the discrete Tempotron learning problem a neuron receives time varying inputs and for a set of such input sequences ($\mathcal S_-$ set) the neuron must be sub-threshold for all times while for some other sequences ($\mathcal S_+$ set)…
We investigate the `local consistency implies global consistency' principle of strict width among structures within the scope of the Bodirsky-Pinsker dichotomy conjecture for infinite-domain Constraint Satisfaction Problems (CSPs). Our main…
It is known since the works of Zariski that the essential difficulty in the local uniformization problem is met already in the case of valuations of height one. In this paper we prove that local uniformization of schemes and non-archimedean…
The main goal in distributed symmetry-breaking is to understand the locality of problems; i.e., the radius of the neighborhood that a node needs to explore in order to arrive at its part of a global solution. In this work, we study the…
Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane. We let distances among the intersection points of the lines…