Related papers: Inter model sets in $\mathbb R^d$ are model sets
Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove that every reflexive directed graph can be interpreted as a program…
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…
Variations on the notions of Reedy model structures and projective model structures on categories of diagrams in a model category are introduced. These allow one to choose only a subset of the entries when defining weak equivalences, or to…
Transforming constraint models is an important task in re- cent constraint programming systems. User-understandable models are defined during the modeling phase but rewriting or tuning them is manda- tory to get solving-efficient models. We…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
An interval translation map (ITM) is a map $T \colon I \to I$ defined as a piecewise translation on a finite partition of an interval $I$ into $r \ge 2$ subintervals. Unlike classical interval exchange transformations (IETs), the images of…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
Model sets are always Meyer sets but the converse is generally not true. In this work we show that for a repetitive Meyer multiple sets of $\mathbb{R}^d$ with associated dynamical system $(\mathbb{X}, \mathbb{R}^d)$, the property of being a…
This paper uses a connection between bounded remainder sets in $\mathbb{R}^d$ and cut-and-project sets in $\mathbb{R}$ together with the fact that each one-dimensional Pisot substitution sequence is bounded distance equivalent to some…
We study point sets arising from cut-and-project constructions. An important class is weak model sets, which include squarefree numbers and visible lattice points. For such model sets, we give a non-trivial upper bound on their pattern…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
We use the measurable Hall's theorem due to Cie\'sla and Sabok to prove that (i) if two measurable sets $A,B \subset \mathbb{R}^d$ of the same measure are bounded remainder sets with respect to a given irrational $d$-dimensional vector…
As a generalization of Hausdorff's extension theorem of metrics, we prove an interpolation theorem of a family of metrics defined on closed subsets of metrizable spaces. As an application, we investigate typicality of subsets of moduli…
The internal representations learned by deep networks are often sensitive to architecture-specific choices, raising questions about the stability, alignment, and transferability of learned structure across models. In this paper, we…
We prove that in any totally irrational cut-and-project setup with codimension (internal space dimension) one, it is possible to choose sections (windows) in non-trivial ways so that the resulting sets are bounded displacement to lattices.…
There are many papers studying properties of point sets in the Euclidean space $\mathbb{E}^m$ or on integer grids $\mathbb{Z}^m$, with pairwise integral or rational distances. In this article we consider the distances or coordinates of the…
A planar integral point set is a set of non-collinear points in plane such that for any pair of the points the Euclidean distance between the points is integral. We discuss the classification of planar integral point sets and provide…
In this paper we prove equivalence of sets of axioms for non-discrete affine buildings, by providing different types of metric, exchange and atlas conditions. We apply our result to show that the definition of a Euclidean building depends…
A datatset $X$ on $R^2$ is a finite topological space. Current research of a dataset focuses on statistical methods and the algebraic topological method \cite{carlsson}. In \cite{hu}, the concept of typed topological space was introduced…
A powerful and flexible approach to structured prediction consists in embedding the structured objects to be predicted into a feature space of possibly infinite dimension by means of output kernels, and then, solving a regression problem in…