Related papers: Optimal embedding of Meyer sets into model sets

In this paper we explore a connection between descriptive set theory and inner model theory. From descriptive set theory, we will take a countable, definable set of reals, A. We will then show that A is equal to the reals of M, where M is a…

We show for each positive integer $a$ that, if $\mathcal{M}$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $c$ such that either every rank-$r$ matroid in $\mathcal{M}$ can…

In this work we focus on the problem of colorization for image compression. Since color information occupies a large proportion of the total storage size of an image, a method that can predict accurate color from its grayscale version can…

Let M be a compact, connected surface, possibly with a finite set of points removed from its interior. Let d,n be positive integers, and let N be a d-fold covering space of M. We show that the covering map induces an embedding of the n-th…

By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…

In this note we describe conditions under which the algebras for a monad on a presheaf category equipped with some additional structure are fibrant objects in a model structure. We also prove that when these conditions are satisfied the…

We prove the following optimal colorful Tverberg-Vrecica type transversal theorem: For prime r and for any k+1 colored collections of points C^l of size |C^l|=(r-1)(d-k+1)+1 in R^d, where each C^l is a union of subsets (color classes) C_i^l…

We provide a short proof of a conic version of the colorful Carath\'eodory theorem for oriented matroids. Holmsen's extension of the colorful Carath\'eodory theorem to oriented matroids (Advances in Mathematics, 2016) already encompasses…

We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…

A coloring of a matroid is proper if elements of the same color form an independent set. For a loopless matroid M, its chromatic number \chi(M) is the minimum number of colors that suffices to color properly the ground set E of M. In this…

In this note we introduce and study a new class of maps called oriented colored broken submersions. This is the simplest class of maps that satisfies a version of the b-principle and in dimension 2 approximates the class of oriented…

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

We use some of the largest order statistics of the random projections of a reference signal to construct a binary embedding that is adapted to signals correlated with such signal. The embedding is characterized from the analytical…

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

We show that it is consistent relative to the existence of suitable large cardinals that for any countable-to-one coloring $c: [\omega_2]^2\to \omega_2$, there exists a closed subset $A\subseteq \omega_2$ of order type $\omega_1$ such that…

We establish a theorem regarding the maximum size of an {\it{induced}} matching in the bipartite complement of the incidence graph of a set system $(X,\mathcal{F})$. We show that this quantity plus one provides an upper bound on the…

We investigate how embedding dimension affects the emergence of an internal "world model" in a transformer trained with reinforcement learning to perform bubble-sort-style adjacent swaps. Models achieve high accuracy even with very small…

We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More generally, we prove that if $H$ is a fixed planar graph that has a planar embedding with all the vertices with degree at least 4 on a single…

Let ${\bf A}={\bf A}_{n,m,k}$ be a random $n\times m$ matrix over $\mathbf{GF}_2$ wher each column consists of $k$ randomly chosen ones. Let $M$ be an arbirary fixed binary matroid. We show that if $m/n$ and $k$ are sufficiently large then…

We study a class of design problems in solid mechanics, leading to a variation on the classical question of equi-dimensional embeddability of Riemannian manifolds. In this general new context, we derive a necessary and sufficient existence…