English
Related papers

Related papers: Finite Ultrametric Balls

200 papers

Let $X$ be a finite set. We give criterion to say if a system of trees ${\cal P}=\{T_i\}_i$ with leaf sets $L(T_i) \in {X \choose 5}$ can be amalgamated into a supertree, that is, if there exists a tree $T$ with $L(T)=X$ such that $T$…

Combinatorics · Mathematics 2016-01-05 Simone Calamai , Elena Rubei

Let $X$ be a $2$-dimensional subshift of finite type generated by a finite set of forbidden blocks (of finite size). We give an algorithm for generating the elements of the shift space using sequence of finite matrices (of increasing size).…

Dynamical Systems · Mathematics 2019-02-06 Puneet Sharma , Dileep Kumar

The recent breakthrough of Guth, Iosevich, Ou, and Wang (2019) on the Falconer distance problem states that for a compact set $A\subset \mathbb{R}^2$, if the Hausdorff dimension of $A$ is greater than $\frac{5}{4}$, then the distance set…

Combinatorics · Mathematics 2022-07-27 Thang Pham , Steven Senger , Dung The Tran

We investigate isometric embeddings of finite metric trees into $(\mathbb{R}^n,d_{1})$ and $( \mathbb{R}^n, d_{\infty})$. We prove that a finite metric tree can be isometrically embedded into $(\mathbb{R}^n,d_{1})$ if and only if the number…

Metric Geometry · Mathematics 2020-02-06 Asuman Güven Aksoy , Mehmet Kiliç , Sahin Koçak

We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…

Classical Analysis and ODEs · Mathematics 2024-11-20 Alex McDonald , Krystal Taylor

The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…

Dynamical Systems · Mathematics 2009-09-25 Alfredo Poirier

We present results about the Cantor-Bendixson index of some subspaces of a uniform family F of finite subsets of natural numbers with respect to the lexicographic order topology. As a corollary of our results we get that for any…

Combinatorics · Mathematics 2015-11-24 Claribet Piña , Carlos Uzcátegui

Given a fixed-point free compact holomorphic self-map $f$ on a bounded symmetric domain $D$, which may be infinite dimensional, we establish the existence of a family $\{H(\xi, \lambda)\}_{\lambda >0}$ of convex $f$-invariant domains at a…

Complex Variables · Mathematics 2016-12-30 Cho-Ho Chu , Michael Rigby

Consider the unit ball, B = D x [0,1], containing n unknotted arcs a_1, ... a_n such that the boundary of each a_i lies in D x {0}. We give a finite presentation for the mapping class group of B fixing the arcs {a_1, ..., a_n} setwise and…

Group Theory · Mathematics 2009-02-27 Stephen Tawn

An ultrametric Cantor set can be seen as the boundary of a rooted weighted tree called the Michon tree. The notion of Assouad dimension is re-interpreted as seen on the Michon tree. The Assouad dimension of an ultrametric Cantor set is…

General Topology · Mathematics 2013-10-23 Jean V. Bellissard , Antoine Julien

A line L is a transversal to a family F of convex objects in R^d if it intersects every member of F. In this paper we show that for every integer d>2 there exists a family of 2d-1 pairwise disjoint unit balls in R^d with the property that…

Computational Geometry · Computer Science 2009-06-17 Otfried Cheong , Xavier Goaoc , Andreas Holmsen

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…

Computational Geometry · Computer Science 2014-01-08 Stefan König

When 1 -> H -> G -> Q -> 1 is a short exact sequence of three infinite, word-hyperbolic groups, Mahan Mitra (Mj) has shown that the inclusion map from H to G extends continuously to a map between the Gromov boundaries of H and G. This…

Group Theory · Mathematics 2020-12-16 Elizabeth Field

We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…

Combinatorics · Mathematics 2014-01-29 Qingchun Ren

In \cite{FKW} Katznelson and Weiss establish that all sufficiently large distances can always be attained between pairs of points from any given measurable subset of $\mathbb{R}^2$ of positive upper (Banach) density. A second proof of this…

Number Theory · Mathematics 2019-02-07 Neil Lyall , Akos Magyar

Let $A\sub \R^{n+r}$ be a set definable in an o-minimal expansion $\S$ of the real field, $A' \sub \R^r$ be its projection, and assume that the non-empty fibers $A_a \sub \R^n$ are compact for all $a \in A'$ and uniformly bounded, {\em…

Algebraic Geometry · Mathematics 2007-05-23 Thierry Zell

Let $S \subset \mathbb{Z}^{d}$ be a finitely generated subsemigroup. Let $E$ be a product system over $S$. We show that there exists an infinite dimensional separable Hilbert space $\mathcal{H}$ and a semigroup $\alpha:=\{\alpha_x\}_{x \in…

Operator Algebras · Mathematics 2017-09-27 S. P. Murugan , S. Sundar

We prove Helly-type theorems for line transversals to disjoint unit balls in $\R^{d}$. In particular, we show that a family of $n \geq 2d$ disjoint unit balls in $\R^d$ has a line transversal if, for some ordering $\prec$ of the balls, any…

Computational Geometry · Computer Science 2007-05-23 Otfried Cheong , Xavier Goaoc , Andreas Holmsen , Sylvain Petitjean

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

In 1998, B\"{o}cker and Dress gave a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees. More precisely, given a tree $T$ with leaf set $X$ and a…

Combinatorics · Mathematics 2018-01-19 Stefan Grünewald , Yangjing Long , Yaokun Wu