Related papers: Distances on a one-dimensional lattice from noncom…
We are given the adjacency matrix of a geometric graph and the task of recovering the latent positions. We study one of the most popular approaches which consists in using the graph distances and derive error bounds under various…
We introduce and study the notion of orthosymmetric spaces over an Archimedean vector lattice as a generalization of finite-dimentional Euclidean inner spaces. A special attention has been paid to linear operators on these spaces.
Computing the Fr\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\'{e}chet distance for a…
An alternating distance is a link invariant that measures how far away a link is from alternating. We study several alternating distances and demonstrate that there exist families of links for which the difference between certain…
The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the…
Different symmetry formalisms for difference equations on lattices are reviewed and applied to perform symmetry reduction for both linear and nonlinear partial difference equations. Both Lie point symmetries and generalized symmetries are…
In this paper, we use the language of noncommutative differential geometry to formalise discrete differential calculus. We begin with a brief review of inverse limit of posets as an approximation of topological spaces. We then show how to…
Based on \cite{DH94}, we introduce a bijective correspondence between first order differential calculi and the graph structure of the symmetric lattice that allows one to encode completely the interconnection structure of the graph in the…
In the present paper we investigate geometric characteristics of compact metric spaces, which can be described in terms of Gromov-Hausdorff distances to simplexes, i.e., to finite metric spaces such that all their nonzero distances are…
The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…
The aim of the present article is to give an introduction to the concept of quasi-unitary equivalence and to define several (pseudo-)metrics on the space of self-adjoint operators acting possibly in different Hilbert spaces. As some of the…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
We study gauging interfaces and their defect descendants in lattice models with generalized symmetries in higher dimensions. We construct explicit interface Hamiltonians for gauging a $\mathbb Z_2^{(0)}$ symmetry in $(2+1)d$ and a $\mathbb…
In the framework of the so called link approach we study exact lattice supersymmetry for the simplest supersymmetric model: N=1 supersymmetry in D=1. The model is described by a lattice with spacing a/2, thus containing twice as many sites…
The matching distance is a computationally tractable topological measure to compare multi-filtered simplicial complexes. We design efficient algorithms for approximating the matching distance of two bi-filtered complexes to any desired…
A central property of a classical geometry is that the geodesic distance between two events is \emph{additive}. When considering quantum fluctuations in the metric or a quantum or statistical superposition of different spacetimes,…
We complete the quasi-isometric classification of irreducible lattices in semisimple Lie groups over nondiscrete locally compact fields of characteristic zero by showing that any quasi-isometry of a rank one S-arithmetic lattice in a…
We show that finiteness of the Lorentzian distance is equivalent to the existence of generalised time functions with gradient uniformly bounded away from light cones. To derive this result we introduce new techniques to construct and…
The main goal of this paper is to find the discrete analogue of the Bianchi system in spaces of arbitrary dimesion together with its geometric interpretation. We show that the proper geometric framework of such generalization is the…
The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a new analysis of the generating functions…