English
Related papers

Related papers: Thickness and a gap lemma in $\mathbb{R}^d$

200 papers

The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…

Logic · Mathematics 2024-08-29 Rahman Mohammadpour

In this paper we explore relationships between divergence and thick groups, and with the same techniques we estimate lengths of shortest conjugators. We produce examples, for every positive integer n, of CAT(0) groups which are thick of…

Geometric Topology · Mathematics 2011-10-25 Jason Behrstock , Cornelia Drutu

In our previous work "Characterization of certain homorphic geodesic cycles on Hermitian locally symmetric manifolds of the noncompact type" in "Modern methods in Complex Analysis" Annals of Math. Studies 138 (1995) 85-118, we formulated a…

Algebraic Geometry · Mathematics 2007-05-23 Philippe Eyssidieux , Ngaiming Mok

A compact set $E\subset {\Bbb R}^d$ is said to be arithmetically thick if there exists a positive integer $n$ so that the $n$-fold arithmetic sum of $E$ has non-empty interior. We prove the arithmetic thickness of $E$, if $E$ is uniformly…

Classical Analysis and ODEs · Mathematics 2020-06-23 De-Jun FENG , Yu-Feng WU

The lens depth of a point has been recently extended to general metric spaces, which is not the case for most depths. It is defined as the probability of being included in the intersection of two random balls centred at two random points X…

Statistics Theory · Mathematics 2021-03-30 Alejandro Cholaquidis , Ricardo Fraiman , Leonardo Moreno

Let $G$ be a connected semisimple simply connected Lie group with a compact Cartan subgroup and let $\Gamma$ be a uniform lattice in $G$. Let $\widehat{G}_d$ denote the set of equivalence classes of unitary discrete series representations…

Representation Theory · Mathematics 2025-07-10 Kaustabh Mondal , Gunja Sachdeva

Let $1 < p < \infty$, $p\neq 2$. We prove that if $d\geq d_p$ is sufficiently large, and $A\subs\R^d$ is a measurable set of positive upper density then there exists $\la_0=\la_0(A)$ such for all $\la\geq\la_0$ there are $x,y\in\R^d$ such…

Combinatorics · Mathematics 2017-06-07 Brian Cook , Ákos Magyar , Malabika Pramanik

The notion of rough set captures indiscernibility of elements in a set. But, in many real life situations, an information system establishes the relation between different universes. This gave the extension of rough set on single universal…

Artificial Intelligence · Computer Science 2013-01-30 B. K. Tripathy , D. P. Acharjya

We isolate conditions on the relative size of sets of natural numbers $A,B$ that guarantee a nonempty intersection $\Delta(A)\cap\Delta(B)\ne\emptyset$ of the corresponding sets of distances. Such conditions apply to a large class of zero…

Combinatorics · Mathematics 2016-09-22 Mauro Di Nasso

For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…

Classical Analysis and ODEs · Mathematics 2017-08-22 N. Chatzikonstantinou , A. Iosevich , S. Mkrtchyan , J. Pakianathan

We propose a notion of depth with respect to a finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$ which we call $\text{dep}_\mathcal{F}$. We begin showing that $\text{dep}_\mathcal{F}$ satisfies some expected properties for a…

Combinatorics · Mathematics 2016-12-13 Leonardo Martínez-Sandoval , Roee Tamam

We investigate connections between resolvability and different forms of tightness. This study is adjacent to [1,2]. We construct a non-regular refinement $\tau^*$ of the natural topology of the real line $\mathbb{R}$ with properties such…

General Topology · Mathematics 2025-07-29 Anton Lipin

Generalising a construction of Falconer, we consider classes of $G_\delta$-subsets of $\mathbb{R}^d$ with the property that sets belonging to the class have large Hausdorff dimension and the class is closed under countable intersections. We…

Dynamical Systems · Mathematics 2018-10-15 Tomas Persson

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

Rademacher complexity is often used to characterize the learnability of a hypothesis class and is known to be related to the class size. We leverage this observation and introduce a new technique for estimating the size of an arbitrary…

Machine Learning · Computer Science 2018-01-30 Jonathan Kuck , Ashish Sabharwal , Stefano Ermon

We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…

Computational Geometry · Computer Science 2022-08-26 Paul Jungeblut , Linda Kleist , Tillmann Miltzow

One often distinguishes between a line and a plane by saying that the former is one-dimensional while the latter is two. But, what does it mean for an object to have $d-$dimensions? Can we define a consistent notion of dimension rigorously…

Metric Geometry · Mathematics 2020-12-22 Satvik Singh

If we consider a sequence of warped product length spaces, what conditions on the sequence of warping functions implies compactness of the sequence of distance functions? In particular, we want to know when a subsequence converges to a well…

Differential Geometry · Mathematics 2024-09-12 Brian Allen , Bryan Sanchez , Yahaira Torres

We study the gap properties of nearest neighbors tight binding models on quasiperiodic chains. We argue that two kind of gaps should be distinguished: stable and transient. We show that stable gaps have a well defined quasiperiodic limit.…

Disordered Systems and Neural Networks · Physics 2017-04-24 Nicolas Macé , Anuradha Jagannathan , Frédéric Piéchon

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

Combinatorics · Mathematics 2018-05-22 A. Iosevich , J. Passant