Related papers: Inter model sets in $\mathbb R^d$ are model sets
The aim of this paper is to introduce the class of ${\cal A}{\cal B}$-sets as the sets that are the intersection of an open and a semi-regular set. Several classes of well-known topological spaces are characterized via the new concept. A…
The work lays the foundations of the theory of changeable sets. In author opinion, this theory, in the process of it's development and improvement, can become one of the tools of solving the sixth Hilbert problem least for physics of…
We study relations of some classes of $k$-convex, $k$-visible bodies in Euclidean spaces. We introduce and study \textrm{circular projections} in normed linear spaces and classes of bodies related with families of such maps, in particular,…
There has been great interest in developing a theory of "Khintchine types" for manifolds embedded in Euclidean space, and considerable progress has been made for curved manifolds. We treat the case of translates of coordinate hyperplanes,…
An ideal on a set $X$ is a collection of subsets of $X$ closed under the operations of taking finite unions and subsets of its elements. Ideals are a very useful notion in topology and set theory and have been studied for a long time. We…
The relationship according to which one physical theory encompasses the domain of empirical validity of another is widely known as "reduction." Here it is argued that one popular methodology for showing that one theory reduces to another,…
Werner's set-theoretical model is one of the most intuitive models of ECC. It combines a functional view of predicative universes with a collapsed view of the impredicative sort Prop. However this model of Prop is so coarse that the…
If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…
In this project we show the existence of arbitrary length arithmetic progressions in model sets and Meyer sets in the Euclidean $d$-space. We prove a van der Waerden type theorem for Meyer sets. We show that pure point subsets of Meyer sets…
This article is devoted to the study of classical and new results concerning equidistant sets, both from the topological and metric point of view. We start with a review of the most interesting known facts about these sets in the euclidean…
A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…
As the intermediate-level representations bridging the two levels, structured representations of visual scenes, such as visual relationships between pairwise objects, have been shown to not only benefit compositional models in learning to…
Prototypical Learning is based on the idea that there is a point (which we call prototype) around which the embeddings of a class are clustered. It has shown promising results in scenarios with little labeled data or to design explainable…
A powerful data transformation method named guided projections is proposed creating new possibilities to reveal the group structure of high-dimensional data in the presence of noise variables. Utilising projections onto a space spanned by a…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
In this thesis, we develop various techniques for working with sets in machine learning. Each input or output is not an image or a sequence, but a set: an unordered collection of multiple objects, each object described by a feature vector.…
Representation choice is of fundamental importance to our ability to communicate and reason effectively. A major unsolved problem, addressed in this paper, is how to devise representational-system (RS) agnostic techniques that drive…
We consider general structures where formulas have truth values in the real unit interval as in continuous model theory, but whose predicates and functions need not be uniformly continuous with respect to a distance predicate. Every general…
A countable structure is said to be extendible if it has the same Scott sentence as some uncountable structure. Rigid structures are not extendible. We give an example of an extendible model with a rigid elementary extension.
A matrix (and any associated linear system) will be referred to as structured if it has a small displacement rank. It is known that the inverse of a structured matrix is structured, which allows fast inversion (or solution), and reduced…