Related papers: On separability in discrete geometry
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored…
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the…
One of the most important problems in Geometric Tomography is to establish properties of a given convex body if we know some properties over its sections or its projections. There are many interesting and deep results that provide…
The Separation of Variables theory for the Hamilton-Jacobi equation is 'by definition' related to the use of special kinds of coordinates, for example Jacobi coordinates on the ellipsoid or St\"ackel systems in the Euclidean space. However,…
Recently, Adiprasito et al. have initiated the study of the so-called no-dimensional Tverberg problem. This problem can be informally stated as follows: Given $n\geq k$, partition an $n$-point set in Euclidean space into $k$ parts such that…
Discretization of curves is an ancient topic. Even discretization of curves with an eye toward differential geometry is over a century old. However there is no general theory or methodology in the literature, despite the ubiquitous use of…
Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit…
Given a bichromatic point set $P=\textbf{R} \cup \textbf{B}$ of red and blue points, a separator is an object of a certain type that separates $\textbf{R}$ and $\textbf{B}$. We study the geometric separability problem when the separator is…
The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…
Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We consider the scator space - a hypercomplex, non-distributive hyperbolic algebra introduced by Fern\'andez-Guasti and Zald\'ivar. We discuss isometries of the scator space and find consequent method for treating them algebraically, along…
The topics of Convexity and Concavity and Envelopes are central in Complex Analysis and extensively investigated. The aim of this paper is to find a possible counterpart in Algebraic Geometry. The article presents preliminary results on…
The Four-Vertex Theorem has been of interest ever since a discrete version appeared in 1813 due to Cauchy. Up until now, there have been many different versions of this theorem, both for discrete cases and smooth cases. In 2004, an approach…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
We investigate the homogeneity of topological subspaces of separable Hilbert space, akin to the spaces with all points rational or all points irrational, so-called Erd\H{o}s spaces. We provide a non-homogeneous example, that is based on one…
Let $K$ be a convex body in Euclidean space ${\mathbb R}^d$, and let a translation invariant, locally finite Borel measure on the space of hyperplanes in ${\mathbb R}^d$ be given. For $\delta\ge 0$, we consider the set of all points $x$ for…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
Since their introduction by Erd\H{o}s in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding…
We define new natural variants of the notions of weighted covering and separation numbers and discuss them in detail. We prove a strong duality relation between weighted covering and separation numbers and prove a few relations between the…