Related papers: Generalized Color Orderings: CEGM Integrands and D…
The paper deals with the decoupling problem of general quasilinear first order systems in two independent variables. We consider either the case of homogeneous and autonomous systems or the one of nonhomogeneous and/or nonautonomous…
The purpose of this note is to draw attention to problems related to a concept called majority colouring recently studied by Kreutzer, Oum, Seymour, van der Zypen and Wood. They raised a problem of determining, for a natural number $k$, the…
Given a graph $G$, a coloring $c:V(G)\longrightarrow \{1,\ldots,k\}$ such that $c(u)=c(v)=i$ implies that vertices $u$ and $v$ are at distance greater than $i$, is called a packing coloring of $G$. The minimum number of colors in a packing…
In this letter, a low-complexity iterative detector with frequency domain equalization is proposed for generalized spatial modulation (GSM) aided single carrier (SC) transmissions operating in frequency selective channels. The detector…
Let $2\le k\in\mathbb{Z}$. A total coloring of a $k$-regular simple graph via $k+1$ colors is an {\it efficient total coloring} if each color yields an efficient dominating set, where the efficient domination condition applies to the…
We introduce a new color decomposition for multi-parton amplitudes in QCD, free of fundamental-representation matrices and structure constants. This decomposition has a physical interpretation in terms of the flow of color, which makes it…
We introduce the total dominator edge chromatic number of a graph $G$. A total dominator edge coloring (briefly TDE-coloring) of $G$ is a proper edge coloring of $G$ in which each edge of the graph is adjacent to every edge of some color…
Fix $m \in \mathbb N$. A new generalization of the $H$-join operation of a family of graphs $\{G_1, G_2, \dots, G_k\}$ constrained by indexing maps $I_1,I_2,\dots,I_k$ is introduced as $H_m$-join of graphs, where the maps $I_i:V(G_i)$ to…
This is the first in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a finite graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…
Writing the fully color dressed and graviton amplitudes, respectively, as ${\bf A}=<C|A> =<C|M|N> $ and ${\bf A}_{gr}= <\tilde N|M|N> $, where $|A> $ is a set of Kleiss-Kuijf color-ordered basis, $|N>, $|\tilde N> $ and $|C>$ are the…
Colour an element of $\mathbb{Z}^d$ white if its coordinates are coprime and black otherwise. What does this colouring look like when seen from a "uniformly chosen" point of $\mathbb{Z}^d$? More generally, label every element of…
We consider the problem of extending partial edge colorings of iterated cartesian products of even cycles and paths, focusing on the case when the precolored edges satisfy either an Evans-type condition or is a matching. In particular, we…
For a positive integer $k$, a proper $k$-coloring of a graph $G$ is a mapping $f: V(G) \rightarrow \{1,2, \ldots, k\}$ such that $f(u) \neq f(v)$ for each edge $uv$ of $G$. The smallest integer $k$ for which there is a proper $k$-coloring…
In two recent papers, Rudolph and Destexhe (Neural Comp. {\bf 15}, 2577-2618, 2003; Neural Comp. in press, 2005) studied a leaky integrator model (i.e. an RC-circuit) driven by correlated (``colored'') Gaussian conductance noise and…
An equitable coloring of a graph is a proper coloring where the sizes of any two different color classes do not differ by more than one. A graph is IC-planar if it can be drawn in the plane so that no two crossed edges have a common…
Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…
In this work, generalized nearest neighbor decoding (GNND), a recently proposed receiver architecture, is studied for channels under general input constellations, and multiuser uplink interference suppression is employed as a case study for…
Generalized Fourier integral operators (FIOs) acting on Colombeau algebras are defined. This is based on a theory of generalized oscillatory integrals (OIs) whose phase functions as well as amplitudes may be generalized functions of…
Vizing's theorem states that every graph $G$ of maximum degree $\Delta$ can be properly edge-colored using $\Delta + 1$ colors. The fastest currently known $(\Delta+1)$-edge-coloring algorithm for general graphs is due to Sinnamon and runs…
The paper is devoted to integral quantization, a procedure based on operator-valued measure and resolution of the identity. We insist on covariance properties in the important case where group representation theory is involved. We also…