相关论文: Mallows Permutations and Finite Dependence

An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear…

In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by…

We consider the class of integer rectifiable currents without boundary satisfying a positivity condition. We establish that these currents can be written as a linear superposition of graphs of finitely many functions with bounded variation.

A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-chromatic number of a graph is the minimum number of colors…

We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We…

Fixed points ${\bf u}=\varphi({\bf u})$ of marked and primitive morphisms $\varphi$ over arbitrary alphabet are considered. We show that if ${\bf u}$ is palindromic, i.e., its language contains infinitely many palindromes, then some power…

We examine the measurable chromatic number of distance colorings on the surface of 2-dimensional spheres of varying radii, showing in particular that similar arguments to those used to raise lower bounds in the plane work for all but a…

The main contributions of this paper are three-fold. First, we use a dynamic approach based on Reiter's pioneering work on Karp-Miller computation graphs to give a new and short proof of Mohar's Minty-type Theorem. Second, we bridge…

A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex $v$ and every color $\alpha$, there are at most as many edges incident to $v$ colored with $\alpha$ as with all other colors.…

A coloring of a matroid is proper if elements of the same color form an independent set. A theorem of Seymour asserts that a k-colorable matroid is also colorable from any lists of size k. In this note we generalize this theorem to the…

We study a graph coloring problem motivated by a fun Sudoku-style puzzle. Given a bipartition of the edges of a graph into {\em near} and {\em far} sets and an integer threshold $t$, a {\em threshold-coloring} of the graph is an assignment…

We show that, given an infinite cardinal $\mu$, a graph has colouring number at most $\mu$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its…

We revisit finite racks and quandles using a perspective based on permutations which can aid in the understanding of the structure. As a consequence we recover old results and prove new ones. We also present and analyze several examples.

In this work we study Stieltjes differential systems of which the derivators are allowed to change sign. This leads to the definition of the notion of \emph{function of controlled variation}, a characterization of precompact sets of…

Let $\rho$ f,$\lambda$ be the residual Galois representation attached to a newform f and a prime ideal $\lambda$ in the integer ring of its coefficient field. In this paper, we prove explicit bounds for the residue characteristic of the…

One open problem in source coding is to characterize the limits of representing losslessly a non-identity discrete function of the data encoded independently by the encoders of several correlated sources with memory. This paper investigates…

We consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…

Let $G \leq \mathrm{Sym} (X)$ for a countable set $X$. Call a colouring of $X$ asymmetric, if the identity is the only element of $G$ which preserves all colours. The motion (also called minimal degree) of $G$ is the minimal number of…

In this paper, we prove lower and upper bounds on the achromatic and the pseudoachromatic indices of the $n$-dimensional finite projective space of order $q$.

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…