Related papers: Fra\"iss\'e limits of metric structures
We prove that a function definable with parameters in an o-minimal structure is bounded away from infinity as its argument goes to infinity by a function definable without parameters, and that this new function can be chosen independently…
Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories that can be made all-loop finite. The requirement of all-loop finiteness leads to a severe reduction of the free parameters of the theory and, in turn, to a large…
We develop structure theory of finite Lie conformal superalgebras.
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
The aim of this paper is to obtain a uniform bound for a certain class of submodules from the following theorem: Let $(R,\frak m)$ be a local ring, let $M$ be a finite $R$--module of dimension $d\ge 1$ and let $\frak q$ be an ideal of $R$…
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…
Recent work from authors across disciplines has made substantial contributions to counting rules (Maxwell type theorems) which predict when an infinite periodic structure would be rigid or flexible while preserving the periodic pattern, as…
We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for…
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces are a convenient language for describing structures equipped with a family of equivalence relations. When $\Lambda$ is finite and distributive, there exists a generic…
We investigate the notions of \emph{localization} and \emph{filtration} in the context of extended affine Lie algebras. Our primary objective is to develop a localization theory that facilitates the construction of meaningful local…
Does a space enjoying good finiteness properties admit an algebraic model with commensurable finiteness properties? In this note, we provide a rational homotopy obstruction for this to happen. As an application, we show that the maximal…
A new sequential approach to investigations of structure of metric spaces at infinity is proposed. Criteria for finiteness and boundedness of metric spaces at infinity are found.
We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thi\'ery and the second author. A…
S-metric and b-metric spaces are metrizable, but it is still quite impossible to get an explicit form of the concerned metric function. To overcome this, the notion of $\phi$-metric is developed by making a suitable modification in triangle…
This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…
Self-similar sets require a separation condition to admit a nice mathematical structure. The classical open set condition (OSC) is difficult to verify. Zerner proved that there is a positive and finite Hausdorff measure for a weaker…
We develop a unified approach to defining a point at infinity for an arbitrary space and formalizing convergence to this point. Central to our work is a method to quantify and classify the rates at which functions approach their limits at…
A detection system, modeled in a graph, is composed of "detectors" positioned at a subset of vertices in order to uniquely locate an ``intruder" at any vertex. \emph{Identifying codes} use detectors that can sense the presence or absence of…