Related papers: Integral point sets over $\mathbb{Z}_n^m$
Let $X$ be a finite set in the Euclidean space $\mathbb{R}^d$. If the squared distance between any two distinct points in $X$ is an odd integer, then the cardinality of $X$ is bounded above by $d+2$, as shown by Rosenfeld (1997) or Smith…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
This article describes some aspects of Cauchy integrals and related geometry of sets and measures in Euclidean spaces, etc.
In this paper we make some observations concerning m-metric spaces and point out some discrepancies in the proofs found in the literature. To remedy this, we propose a new topological construction and prove that it is in fact a…
We study the S-integral points on the complement of a union of hyperplanes in projective space, where S is a finite set of places of a number field k. In the classical case where S consists of the set of archimedean places of k, we…
Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case…
Sets in R^n in which every pair of elements x, y can be connected by a path in the set of length bounded by a constant multiple of the distance between x and y are considered.
We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…
We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.
Let $m>1$ be an integer, and let $I(\mathbb{Z}_m)^*$ be the set of all non-zero proper ideals of $\mathbb{Z}_m$. The intersection graph of ideals of $\mathbb{Z}_m$, denoted by $G(\mathbb{Z}_m)$, is a graph with vertices $I(\mathbb{Z}_m)^*$…
We show that any translate of a model set is a model set in some modified cut-and-project scheme. Restricting to Euclidean direct space, we show that any translate of an inter model set is a model set in some modified cut-and-project scheme…
We generalise the definition of the characteristic of an integral triangle to integral simplices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm…
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of…
Various topics concerning the entanglement of composite quantum systems are considered with particular emphasis concerning the strict relations of such a problem with the one of attributing objective properties to the constituents. Most of…
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…
A geometrical pattern is a set of points with all pairwise distances (or, more generally, relative distances) specified. Finding matches to such patterns has applications to spatial data in seismic, astronomical, and transportation…
Let $\mathbb{F}_q$ be an arbitrary finite field, and $\mathcal{E}$ be a set of points in $\mathbb{F}_q^d$. Let $\Delta(\mathcal{E})$ be the set of distances determined by pairs of points in $\mathcal{E}$. By using the Kloosterman sums,…
The sets used to construct other mathematical objects are pure sets, which means that all of their elements are sets, which are themselves pure. One set may therefore be within another, not as an element, but as an element of an element, or…
In this paper we consider finite hybrid point sets that are the digital analogs to finite hybrid point sets introduced by Kritzer. Kritzer considered hybrid point sets that are a combination of lattice point sets and Hammersley point sets…
Distance Geometry is based on the inverse problem that asks to find the positions of points, in a Euclidean space of given dimension, that are compatible with a given set of distances. We briefly introduce the field, and discuss some open…