Related papers: Explicit affine formulas for distances between tup…
We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…
We introduce a local coordinate description for the correspondence between the space of oriented affine lines in Euclidean ${\Bbb{R}}^3$ and the tangent bundle to the 2-sphere. These can be utilised to give canonical coordinates on surfaces…
This paper focuses on the fractional difference of Lyapunov functions related to Riemann-Liouville, Caputo and Grunwald-Letnikov definitions. A new way of building Lyapunov functions is introduced and then five inequalities are derived for…
We extend some of the results of Agler, Knese, and McCarthy [1] to $n$-tuples of commuting isometries for $n>2$. Let $\mathbb{V}=(V_1,\dots,V_n)$ be an $n$-tuple of a commuting isometries on a Hilbert space and let Ann$(\mathbb{V})$ denote…
A recent paper showed how to find sets of finite affine or projective planes constructed on a common set of points, so that lines of one plane meet lines of a different plane in at most two points. In this paper, those results are…
In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…
Given a set of points in the Euclidean space $\mathbb{R}^\ell$ with $\ell>1$, the pairwise distances between the points are determined by their spatial location and the metric $d$ that we endow $\mathbb{R}^\ell$ with. Hence, the distance…
Let G be a finite abelian group of order n. For a complex valued function f on G, let \fht denote the Fourier transform of f. The uncertainty inequality asserts that if f \neq 0 then |supp(f)| |supp(\fht)| \geq n. Answering a question of…
We develop various Ehrenfeucht-Fra\"{\i}ss\'{e} games for distances between metric structures. We study two forms of distances: pseudometrics stemming from mapping spaces onto each other with some form of approximate isomorphism, and…
Starting from simple and necessary axioms on a (derivator enhanced) four-functor-formalism, we construct derivator six-functor-formalisms using compactifications. This works, for instance, for the stable homotopy categories of…
In this paper we introduce the notion of the center of distances of a metric space, which is required for a generalization of the theorem by J. von Neumann about permutations of two sequences with the same set of cluster points in a compact…
The classical Artin--Whaples approximation theorem allows to simultaneously approximate finitely many different elements of a field with respect to finitely many pairwise inequivalent absolute values. Several variants and generalizations…
Given a fixed number field K, we give non-trivial lower bounds for the distance between the conjugates of any number a from K in terms of the Mahler measure M(a) of a. In the case that K is a cubic field, our bound is best possible in terms…
In this paper, we review the properties and representations of the Weyl groups relevant in the study of discrete integrable systems. Previously in \cite{jns4, Shi:19}, properties of Weyl groups of type $ADE$ (known as simply-laced) were…
The fact that the first variation of a variational functional must vanish along an extremizer is the base of most effective solution schemes to solve problems of the calculus of variations. We generalize the method to variational problems…
This article formalizes an abstraction of input/output relations, based on parameterized zonotopes, which we call affine sets. We describe the abstract transfer functions and prove their correctness, which allows the generation of accurate…
Motivated by recent works by Radchenko and Viazovska and by Ramos and Sousa, we find sufficient conditions for a pair of discrete subsets of the real line to be a uniqueness or a non-uniqueness pair for the Fourier transform. These…
We define a special network that exhibits the large embeddings in any class of similar algebras. With the aid of this network, we introduce a notion of distance that conceivably counts the minimum number of dissimilarities, in a sense,…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
In this paper, we prove a structure theorem for the infinite union of $n$-adic doubling measures via techniques which involve far numbers. Our approach extends the results of Wu in 1998, and as a by product, we also prove a classification…