Related papers: A Measure Theoretic Paradox from a continuous colo…
How do subregion boundary representations transform under conformal transformations? In this paper we conjecture a transformation rule and provide evidence for it. We also show how this transformation rule helps mitigate the subregion…
In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…
We consider some coloring issues related to the famous Erd\H {o}s Discrepancy Problem. A set of the form $A_{s,k}=\{s,2s,\dots,ks\}$, with $s,k\in \mathbb{N}$, is called a \emph{homogeneous arithmetic progression}. We prove that for every…
If a quantum system is prepared and later post-selected in certain states, "paradoxical" predictions for intermediate measurements can be obtained. This is the case both when the intermediate measurement is strong, i.e. a projective…
Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, register allocation, computer security and so on. Graph proper…
Generalized equations are problems emerging in contexts of modern variational analysis as an adequate formalism to treat such issues as constraint systems, optimality and equilibrium conditions, variational inequalities, differential…
Proper conflict-free coloring is an intermediate notion between proper coloring of a graph and proper coloring of its square. It is a proper coloring such that for every non-isolated vertex, there exists a color appearing exactly once in…
In this paper we make a systematic use of the quantum measurement theory to describe perceived colors and analyze some of their fundamental properties. After motivating the naturalness of the quantum measurement approach in the mathematical…
Let $\mathcal{F}$ be a family of convex sets in ${\mathbb R}^d$, which are colored with $d+1$ colors. We say that $\mathcal{F}$ satisfies the Colorful Helly Property if every rainbow selection of $d+1$ sets, one set from each color class,…
One method to obtain a proper vertex coloring of graphs using a reasonable number of colors is to start from any arbitrary proper coloring and then repeat some local re-coloring techniques to reduce the number of color classes. The Grundy…
We introduce a notion of color-criticality in the context of chromatic-choosability. We define a graph $G$ to be strong $k$-chromatic-choosable if $\chi(G) = k$ and every $(k-1)$-assignment for which $G$ is not list-colorable has the…
In this paper, we consider a weighted generalization of the chromatic number of a Binomial random graph~\(G.\) We equip each edge with a random weight and then colour the vertices in such a way that the absolute colour difference between…
Circular coloring is a constraints satisfaction problem where colors are assigned to nodes in a graph in such a way that every pair of connected nodes has two consecutive colors (the first color being consecutive to the last). We study…
Finding necessary and sufficient conditions for isomorphism between two semigroups of order-preserving transformations over an infinite domain with restricted range was an open problem in \cite{FHQS}. In this paper, we show a proof strategy…
For a fixed graph $H$, what is the smallest number of colours $C$ such that there is a proper edge-colouring of the complete graph $K_n$ with $C$ colours containing no two vertex-disjoint colour-isomorphic copies, or repeats, of $H$? We…
We devise a new formulation for the vertex coloring problem. Different from other formulations, decision variables are associated with the pairs of vertices. Consequently, colors will be distinguishable. Although the objective function is…
We prove that, to each synchronous non-local game $\mathcal{G}=(I,O,\lambda)$ with $|I|=n$ and $|O|=m \geq 3$, there is an associated graph $G_{\lambda}$ for which approximate winning strategies for the game $\mathcal{G}$ and the…
In the \textsc{Coloring Reconfiguration} problem, we are given two proper $k$-colorings of a graph and asked to decide whether one can be transformed into the other by repeatedly applying a specified recoloring rule, while maintaining a…
Given a natural $n$, we construct a two-coloring of $\mathbb{R}^n$ with the maximum metric satisfying the following. For any finite set of reals $S$ with diameter greater than $5^{n}$ such that the distance between any two consecutive…
In this work we reexamine the EPR paradox for composite systems with a finite number of levels. The analysis emphasizes the connection between measurements and conditional probabilities. This connection implies that when a measurement is…