Related papers: Color evolution of 2 -> 3 processes
A single coloring channel is defined by a subset of letters it allows to pass through, while deleting all others. A sequence of coloring channels provides multiple views of the same transmitted letter sequence, forming a type of…
Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…
Colors observed in nature are very important to form our perception of an object as well as its design. The desire to reproduce vivid colors such as those found in birds, fishes, flowers and insects has driven extensive research into…
We introduce a new variant of graph coloring called correspondence coloring which generalizes list coloring and allows for reductions previously only possible for ordinary coloring. Using this tool, we prove that excluding cycles of lengths…
We develop an algorithm for recursively constructing orthogonal multiplet bases for the color space of QCD, for any order of partons and any Nc. This recipe is then applied for explicitly constructing some of these bases. Using the bases, a…
We review recent progress on the statiscal physics study of the problem of coloring random graphs with q colors. We discuss the existence of a threeshold at connectivity c_q=2q log q-log q-1+o(1) separting two phases which are respectivily…
For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…
We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require $\Omega(n^\frac{2}{3})$ edges each having $\Omega(n^\frac{1}{3})$ bends in the worst case. The lower bound…
It is shown that, by imposing reparametrization invariance, one may derive a variety of stochastic equations describing the dynamics of surface growth and identify the physical processes responsible for the various terms. This approach…
We study colored coverage and clustering problems. Here, we are given a colored point set where the points are covered by (unknown) $k$ clusters, which are monochromatic (i.e., all the points covered by the same cluster, have the same…
We begin by reviewing some probabilistic results about the Dirichlet Process and its close relatives, focussing on their implications for statistical modelling and analysis. We then introduce a class of simple mixture models in which…
To improve the accuracy of color image completion with missing entries, we present a recovery method based on generalized higher-order scalars. We extend the traditional second-order matrix model to a more comprehensive higher-order matrix…
Recent colorization works implicitly predict the semantic information while learning to colorize black-and-white images. Consequently, the generated color is easier to be overflowed, and the semantic faults are invisible. As a human…
Solvent-based techniques usually involve preparing dilute blends of electron-donor and electron-acceptor materials dissolved in a volatile solvent. After some form of coating onto a substrate, the solvent evaporates. An initially…
Edge Constrained Vertex Coloring (ECVC) problems are defined on a finite multigraph, their solutions are characterized, and a linear time algorithm is given for solving $N$ ECVCs on the same underlying multigraph. Using ECVC problems we…
For a connected graph, we define the proper-walk connection number as the minimum number of colors needed to color the edges of a graph so that there is a walk between every pair of vertices without two consecutive edges having the same…
Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…
A protocell model consisting of mutually catalyzing molecules is studied in order to investigate how chemical compositions are transferred recursively through cell divisions under replication errors. Depending on the path rate, the numbers…
Maximal planar graph refers to the planar graph with the most edges, which means no more edges can be added so that the resulting graph is still planar. The Four-Color Conjecture says that every planar graph without loops is 4-colorable.…
Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties…