Related papers: Majority problems of large query size
For a fixed integer $q$, the $q$-Coloring problem asks to decide if a given graph has a vertex coloring with $q$ colors such that no two adjacent vertices receive the same color. In a series of papers, it has been shown that for every $q…
Given a locally finite set $A \subseteq \mathbb{R}^d$ and a coloring $\chi \colon A \to \{0,1,\ldots,s\}$, we introduce the chromatic Delaunay mosaic of $\chi$, which is a Delaunay mosaic in $\mathbb{R}^{s+d}$ that represents how points of…
We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.
Tensor models generalize random matrix models in yielding a theory of dynamical triangulations in arbitrary dimensions. Colored tensor models have been shown to admit a 1/N expansion and a continuum limit accessible analytically. In this…
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…
Let $G$ be a simple graph of order $n$. A majority dominator coloring of a graph $G$ is proper coloring in which each vertex of the graph dominates at least half of one color class. The majority dominator chromatic number $\chi_{md}(G)$ is…
We investigate the classical and distributed complexity of \emph{$k$-partial $c$-coloring} where $c=k$, a natural generalization of Brooks' theorem where each vertex should be colored from the palette $\{1,\ldots,c\} = \{1,\ldots,k\}$ such…
Suppose that each number $1,2,...,N$ has one of n colours assigned. We show that if there are no monochromatic solutions to the equation $x_1+x_2+x_3=y_1+y_2$, then $N=O((n!)^{1/2})$, improving upon a result of Cwalina and Schoen. Further,…
A majority coloring of an undirected graph is a vertex coloring in which for each vertex there are at least as many bi-chromatic edges containing that vertex as monochromatic ones. It is known that for every countable graph a majority…
If $S$ is a subset of an abelian group $G$, the polychromatic number of $S$ in $G$ is the largest integer $k$ so that there is a $k-$coloring of the elements of $G$ such that every translate of $S$ in $G$ gets all $k$ colors. We determine…
We study range-searching for colored objects, where one has to count (approximately) the number of colors present in a query range. The problems studied mostly involve orthogonal range-searching in two and three dimensions, and the dual…
This note proves a law of large numbers for predicting several steps ahead, which, in the case of uniformly bounded random variables, generalizes the standard law of large numbers for martingales; the standard law of large numbers…
In modeling parasitic diseases, it is natural to distinguish hosts according to the number of parasites that they carry, leading to a countably infinite type space. Proving the analogue of the deterministic equations, used in models with…
The minority model was introduced to study the competition between agents with limited information. It has the remarkable feature that, as the amount of information available increases, the collective gain made by the agents is reduced.…
Tiling models are classical statistical models in which different geometric shapes, the tiles, are packed together such that they cover space completely. In this paper we discuss a class of two-dimensional tiling models in which the tiles…
In this paper, we study the following two hypercube coloring problems: Given $n$ and $d$, find the minimum number of colors, denoted as ${\chi}'_{d}(n)$ (resp. ${\chi}_{d}(n)$), needed to color the vertices of the $n$-cube such that any two…
We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
We study the number of monochromatic solution to linear equation in $\{1,\dots,n\}$ when we color the set by at least three colors. We consider the $r$-commonness for $r\geq 3$ of linear equation with odd number of terms, and we also prove…
Permutation Mastermind is a version of the classical mastermind game in which the number of positions $n$ is equal to the number of colors $k$, and repetition of colors is not allowed, neither in the codeword nor in the queries. In this…
While models for Visual Question Answering (VQA) have steadily improved over the years, interacting with one quickly reveals that these models lack consistency. For instance, if a model answers "red" to "What color is the balloon?", it…