Related papers: Distance formulas in Bruhat-Tits building of $\mat…

We obtain an analog of the compression of angles theorem in symmetric spaces for Bruhat--Tits buildings of the type $A$. More precisely, consider a $p$-adic linear space $V$ and the set $Lat(V)$ of all lattices in $V$. The complex distance…

We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…

For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…

We apply the techniques of computable model theory to the distance function of a graph. This task leads us to adapt the definitions of several truth-table reducibilities so that they apply to functions as well as to sets, and we prove…

We investigate Bruhat-Tits buildings and their compactifications by means of Berkovich analytic geometry over complete non-Archimedean fields. For every reductive group G over a suitable non-Archimedean field k we define a map from the…

Let $\mathbb{F}_q$ be a finite field of order $q$. Iosevich and Rudnev (2005) proved that for any set $A\subset \mathbb{F}_q^d$, if $|A|\gg q^{\frac{d+1}{2}}$, then the distance set $\Delta(A)$ contains a positive proportion of all…

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

Let $X$ be a metric space and $BCl(X)$ the collection of nonempty bounded closed subsets of $X$. We show that Hausdorff distance $d_H$ belongs to a specific family of real-valued distances on $BCl(X)$, each of which can be expressed as the…

This paper provides an overview of the theory of Bruhat-Tits buildings. Besides, we explain how Bruhat-Tits buildings can be realized inside Berkovich spaces. In this way, Berkovich analytic geometry canbe used to compactify buildings. We…

Let $\mathbb{F}_q$ be a finite field of order $q$ and $\mathcal{E}$ be a set in $\mathbb{F}_q^d$. The distance set of $\mathcal{E}$, denoted by $\Delta(\mathcal{E})$, is the set of distinct distances determined by the pairs of points in…

With the help of Wick rotation over $p$-adic numbers $\mathbb{Q}_p$, the $p$-adic version of Euclidean $\textrm{dS}_2$ space(noted as $p\textrm{dS}_2$) is obtained based on $p\textrm{AdS}_2$($p$-adic version of Euclidean $\textrm{AdS}_2$…

There are several interrelated notions of discrete curvature on graphs. Many approaches utilize the optimal transportation metric on its probability simplex or the distance matrix of the graph. In this survey article, we compute formulas…

The exceptional group $G_2$, when constructed over $Q_p$, may at the same time be considered as the group of automorphisms of an octonion algebra over $Q_p$, or alternatively it may be constructed as a Chevalley group from the root diagram…

In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…

We study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Let $\mathbb{F}_q$ be a finite field of order $q$ and $E$ be a set in $\mathbb{F}_q^d$. The distance set of $E$ is defined by $\Delta(E):=\{\lVert x-y \rVert :x,y\in E\}$, where $\lVert \alpha \rVert=\alpha_1^2+\dots+\alpha_d^2$. Iosevich,…

For any sequence of matrix algebras that converge to a coadjoint orbit we give explicit formulas that show that the distances between the matrix algebras (viewed as quantum metric spaces) converges to 0. In the process we develop a general…

For a connected graph $G$ and $\alpha\in [0,1)$, the distance $\alpha$-spectral radius of $G$ is the spectral radius of the matrix $D_{\alpha}(G)$ defined as $D_{\alpha}(G)=\alpha T(G)+(1-\alpha)D(G)$, where $T(G)$ is a diagonal matrix of…

Let $\Gamma=\Gamma(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $\Gamma$. Let $\{R_i\}_{i=0}^D$ denote a partition of…