Related papers: Coloring ordinals by reals
In the present article, real number representations, that are generalizations of classical positive and alternating representations of numbers, are introduced and investigated. The main metric relation, properties of cylinder sets are…
Motivated by bifurcation of branches of homoclinic orbits of dynamical systems, we consider families of first-order equations on the real line and introduce a generalisation of previous index theorems by Pejsachowicz, and by Hu and…
Based on M. Hall's theorem we prove a simple result dealing with real numbers which admit exact approximations by rationals.
Simpson and the second author asked whether there exists a characterization of the natural numbers by a second-order sentence which is provably categorical in the theory RCA$^*_0$. We answer in the negative, showing that for any…
his paper deals with approximating properties of the newly defined $q$-generalization of the Sz\'{a}sz operators in the case $q>1$. Quantitative estimates of the convergence in the polynomial weighted spaces and the Voronovskaja's theorem…
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…
We introduce a new topological generalization of the $\sigma$-projective hierarchy, not limited to Polish spaces. Earlier attempts have replaced $^{\omega}\omega$ by $^{\kappa}\kappa$, for $\kappa$ regular uncountable, or replaced countable…
Let $G$ be a multigraph and $L\,:\,E(G) \to 2^\mathbb{N}$ be a list assignment on the edges of $G$. Suppose additionally, for every vertex $x$, the edges incident to $x$ have at least $f(x)$ colors in common. We consider a variant of local…
We show that a collar lemma holds for Anosov representations of fundamental groups of surfaces into $\SL(n,\R)$ that satisfy partial hyperconvexity properties inspired from Labourie's work. This is the case for several open sets of Anosov…
The thin set theorem $\mathsf{RT}^n_{<\infty,\ell}$ asserts the existence, for every $k$-coloring of the subsets of natural numbers of size $n$, of an infinite set of natural numbers, all of whose subsets of size $n$ use at most $\ell$…
Let $P$ be a set of $n$ points in the plane, not all on a line, each colored \emph{red} or \emph{blue}. The classical Motzkin--Rabin theorem guarantees the existence of a \emph{monochromatic} line. Motivated by the seminal work of Green and…
We study amalgamation properties in a family of abstract elementary classes that we call coloring classes. The family includes the examples previously studied in previous work of Baldwin, Kolesnikov, and Shelah. We establish that the…
We prove that all arrangements (consistent with the Rolle theorem and some other natural restrictions) of the real roots of a real polynomial and of its $s$-th derivative are realizable by real polynomials.
A linearly ordered (LO) $k$-colouring of a hypergraph assigns to each vertex a colour from the set $\{0,1,\ldots,k-1\}$ in such a way that each hyperedge has a unique maximum element. Barto, Batistelli, and Berg conjectured that it is…
Only finite precision measurements are experimentally reasonable, and they cannot distinguish a dense subset from its closure. We show that the rational vectors, which are dense in S^2, can be colored so that the contradiction with hidden…
In 2003, Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. In this paper, we motivate and define a new list analogue of equitable coloring called proportional choosability. A…
Our point of departure is the following simple common generalisation of the Sylvester-Gallai theorem and the Motzkin-Rabin theorem: Let S be a finite set of points in the plane, with each point coloured red or blue or with both colours.…
We associate canonical virtual motives to definable sets over a field of characteristic zero. We use this construction to show that very general p-adic integrals are canonically interpolated by motivic ones.
We address the problem of characterizing $H$-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of…
Call a colouring of a graph distinguishing if the only automorphism which preserves it is the identity. We investigate the role of the Axiom of Choice in the existence of certain proper or distinguishing colourings in both vertex and edge…