English
Related papers

Related papers: Dimensions of triangle sets

200 papers

Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…

Algebraic Geometry · Mathematics 2017-05-17 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

Consider a definably complete uniformly locally o-minimal expansion of the second kind of a densely linearly ordered abelian group. Let $f:X \rightarrow R^n$ be a definable map, where $X$ is a definable set and $R$ is the universe of the…

Logic · Mathematics 2021-04-15 Masato Fujita

In this paper we obtain new lower bounds for the upper box dimension of $\alpha\beta$ sets. As a corollary of our main result, we show that if $\alpha$ is not a Liouville number and $\beta$ is a Liouville number, then the upper box…

Dynamical Systems · Mathematics 2021-02-12 Simon Baker

Let $\mathbb{F}_q$ be a finite field of order $q$. In this paper, we study the distribution of rectangles in a given set in $\mathbb{F}_q^2$. More precisely, for any $0<\delta\le 1$, we prove that there exists an integer $q_0=q_0(\delta)$…

Combinatorics · Mathematics 2021-09-28 Doowon Koh , Sujin Lee , Thang Pham , Chun-Yen Shen

It is known that the upper box-counting dimension of a Cartesian product satisfies the inequality $\dim_{B}\left(F\times G\right)\leq \dim_{B}\left(F\right) + \dim_{B}\left(G\right)$ whilst the lower box-counting dimension satisfies the…

Metric Geometry · Mathematics 2010-07-27 Nick Sharples

Let ${\Bbb F}_q$ be a finite field of order $q.$ We prove that if $d\ge 2$ is even and $E \subset {\Bbb F}_q^d$ with $|E| \ge 9q^{\frac{d}{2}}$ then $$ {\Bbb F}_q=\frac{\Delta(E)}{\Delta(E)}=\left\{ \frac{a}{b}: a \in \Delta(E), b \in…

Classical Analysis and ODEs · Mathematics 2019-05-29 A. Iosevich , D. Koh , H. Parshall

In the last years considerable attention has been paid for the orthogonal and non-linear projections of self-similar sets. In this paper we consider orthogonal transformation-free self-similar sets in $\mathbb{R}^3$, i.e. the generating IFS…

Dynamical Systems · Mathematics 2016-04-27 Balázs Bárány

Let $0 \leq s \leq 1$. A set $K \subset \mathbb{R}^{2}$ is a Furstenberg $s$-set, if for every unit vector $e \in S^{1}$, some line $L_{e}$ parallel to $e$ satisfies $$\dim_{\mathrm{H}} [K \cap L_{e}] \geq s.$$ The Furstenberg set problem,…

Classical Analysis and ODEs · Mathematics 2017-09-25 Tuomas Orponen

We study algorithmic problems on subsets of Euclidean space of low fractal dimension. These spaces are the subject of intensive study in various branches of mathematics, including geometry, topology, and measure theory. There are several…

Data Structures and Algorithms · Computer Science 2017-03-29 Anastasios Sidiropoulos , Vijay Sridhar

Let F be a field. We investigate the greatest possible dimension t_n(F) for a vector space of n-by-n matrices with entries in F and in which every element is triangularizable over the ground field F. It is obvious that t_n(F) is greater…

Rings and Algebras · Mathematics 2025-04-15 Clément de Seguins Pazzis

The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…

Discrete Mathematics · Computer Science 2015-08-13 Juan M. Alonso

We study sets of local dimensions for self-similar measures in $\mathbb{R}$ satisfying the finite neighbour condition, which is formally stronger than the weak separation condition but satisfied in all known examples. Under a mild technical…

Dynamical Systems · Mathematics 2022-09-07 Kathryn E. Hare , Alex Rutar

We say that two partial orders on $[n]$ are compatible if there exists a partial order that refines both of them. This compatibility relation induces a natural set system structure between the collection $\mathcal{F}$ of all partial orders…

Combinatorics · Mathematics 2026-02-10 Boyan Duan , Minghui Ouyang , Zheng Wang

We prove that the upper box dimension of an inhomogeneous self-affine set is bounded above by the maximum of the affinity dimension and the dimension of the condensation set. In addition, we determine sufficient conditions for this upper…

Metric Geometry · Mathematics 2021-04-29 Stuart A. Burrell , Jonathan M. Fraser

We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…

Computational Complexity · Computer Science 2017-12-14 Anastasios Sidiropoulos , Kritika Singhal , Vijay Sridhar

Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…

Symbolic Computation · Computer Science 2026-05-07 Lucas Michel

This article focuses on the occurrence of 3-point configurations in subsets of $\mathbb{R}^d$ of sufficient thickness. We prove that a compact set $A\subset \mathbb{R}^d$ contains a similar copy of any linear $3$-point configuration (such…

Classical Analysis and ODEs · Mathematics 2026-03-09 Samantha Sandberg-Clark , Krystal Taylor

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Combinatorics · Mathematics 2024-01-24 Christian Elsholtz , Laura Proske , Lisa Sauermann

For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove…

Combinatorics · Mathematics 2024-12-13 Ishay Haviv , Sam Mattheus , Aleksa Milojević , Yuval Wigderson

Let $\mathcal{F}=(F;+,\cdot,0,1,D)$ be a differentially closed field. We consider the question of definability of the derivation $D$ in reducts of $\mathcal{F}$ of the form $\mathcal{F}_{R}=(F;+,\cdot,0,1,P)_{P \in R}$ where $R$ is a…

Logic · Mathematics 2018-01-19 Vahagn Aslanyan