Related papers: Paradoxical decompositions and finitary rules
Partially or totally unsolved questions in number theory and geometry especially, such as coloration problems, elementary geometric conjectures, partitions, generalized periods of a number, length of a generalized period, arithmetic and…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining the bound) were studied before for regular graphs, for…
Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…
We study a model of random partitioning by nearest-neighbor coloring from Poisson rain, introduced independently by Aldous and Preater. Given two initial points in $[0,1]^d$ respectively colored in red and blue, we let independent uniformly…
We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R^3 can be colored with k…
A colouring of the edges of an $n \times n$ grid is said to be \emph{reconstructible} if the colouring is uniquely determined by the multiset of its $n^2$ \emph{tiles}, where the tile corresponding to a vertex of the grid specifies the…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
We investigate the problem of deciding whether a system of linear equations, together with divisibility conditions on the variables, has a solution over holomorphy subrings of global fields. We obtain decidability results when we allow…
We consider the problem of extending partial edge colorings of cartesian products of graphs. More specifically, we suggest the following Evans-type conjecture: If $G$ is a graph where every precoloring of at most $k$ precolored edges can be…
We study the Fox coloring invariants of rational knots. We express the propagation of the colors down the twists of these knots and ultimately the determinant of them with the help of finite increasing sequences whose terms of even order…
In an unfriendly coloring of a graph the color of every node mismatches that of the majority of its neighbors. We show that every probability measure preserving Borel graph with finite average degree admits a Borel unfriendly coloring…
The study of a machine learning problem is in many ways is difficult to separate from the study of the loss function being used. One avenue of inquiry has been to look at these loss functions in terms of their properties as scoring rules…
In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We propose a colored PROP to model computation in this framework,…
We use the Mallows permutation model to construct a new family of stationary finitely dependent proper colorings of the integers. We prove that these colorings can be expressed as finitary factors of i.i.d. processes with finite mean coding…
We study a restricted form of list colouring, for which every pair of lists that correspond to adjacent vertices may not share more than one colour. The optimal list size such that a proper list colouring is always possible given this…
The classical theorem of Vizing states that every graph of maximum degree $d$ admits an edge-coloring with at most $d+1$ colors. Furthermore, as it was earlier shown by K\H{o}nig, $d$ colors suffice if the graph is bipartite. We investigate…
Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not…
Following recent result of L. M. T\' oth [arXiv:1906.03137] we show that every $2\Delta$-regular Borel graph $\mathcal{G}$ with a (not necessarily invariant) Borel probability measure admits approximate Schreier decoration. In fact, we show…
A measure theoretic approach of the problem that there exits a finite unit-distance graphs in the plane that are not five (or four) colorable.