Related papers: Generalized Color Orderings: CEGM Integrands and D…
DP-coloring (also called correspondence coloring) is a generalization of list coloring recently introduced by Dvo\v{r}\'{a}k and Postle. Several known bounds for the list chromatic number of a graph $G$, $\chi_\ell(G)$, also hold for the…
In order to generalize the integration rules to general CHY integrands which include higher order poles, algorithms are proposed in two directions. One is to conjecture new rules, and the other is to use the cross-ratio identity method. In…
Let $P$ be a poset, $inc(P)$ its incomparability graph, and $X_{inc(P)}$ the corresponding chromatic symmetric function, as defined by Stanley in {\em Adv. Math.}, {\bf 111} (1995) pp.~166--194. Certain conditions on $P$ imply that the…
Loop amplitudes are conveniently expressed in terms of master integrals whose coefficients carry the process dependent information. Similarly before integration, the loop integrands may be expressed as a linear combination of propagator…
We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of…
Coherent ptychographic imaging experiments often discard over 99.9 % of the flux from a light source to define the coherence of an illumination. Even when coherent flux is sufficient, the stability required during an exposure is another…
Graph Coloring Problem (GCP) is an NP-Hard vertex labeling problem in graphs such that no two adjacent vertices can have the same color. Large instances of GCP cannot be solved in reasonable execution times by exact algorithms. Therefore,…
In \cite{st2017}, the authors introduced the so-called \emph{general divide and color models}. One of the most well-known examples of such a model is the Ising model with external field $h = 0$, which has a color representation given by the…
The total chromatic number, $\chi''(G)$ is the minimum number of colors which need to be assigned to obtain a total coloring of the graph $G$. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph,…
We present results referring to the Hadwiger-Nelson problem which asks for the minimum number of colours needed to colour the plane with no two points at distance $1$ having the same colour. Exoo considered a more general problem concerning…
We present an index structure, called the color-index, to boost the evaluation of acyclic conjunctive queries (ACQs) over binary schemas. The color-index is based on the color refinement algorithm, a widely used subroutine for graph…
I consider general reflection coefficients for arbitrary one-dimensional whole line differential or difference operators of order $2$. These reflection coefficients are semicontinuous functions of the operator: their absolute value can only…
We study 1-loop MHV amplitudes in N=4 super Yang-Mills theory and in N=8 supergravity. For Yang-Mills we find that the simple form for the full amplitude presented by Del Duca, Dixon and Maltoni naturally leads to one that has physical…
For bounded Lebesgue measurable functions $f,g,\phi$ and $\psi$ on the unit circle, $P_{+}fP_{+}+P_{-}gP_{+} +P_{+}\phi P_{-}+P_{-}\psi P_{-}$ is called a generalized singular integral operator (GSIO) on $L^{2}(\mathbb{T})$, where $P_{+}$…
One-loop integrands in Cachazo-He-Yuan (CHY) formula, which is based on the forward limit of tree-level amplitudes, involves linear propagators that are different from quadratic ones in traditional Feynman diagrams. In this paper, we…
A proper coloring $c$ of a simple graph $G$ is harmonious if, for every pair of distinct edges $uv,xy\in E(G)$, we have that $\{c(u),c(v)\}\neq \{c(x),c(y)\}$. The harmonious chromatic number of $G$, denoted by $h(G)$, is the least positive…
We study the $(\Delta+1)$-edge-coloring problem in the parallel $\left(\mathrm{PRAM}\right)$ model of computation. The celebrated Vizing's theorem [Viz64] states that every simple graph $G = (V,E)$ can be properly $(\Delta+1)$-edge-colored.…
For a graph $G$, the \emph{equitable chromatic number} of $G$, denoted by $\chi_e(G)$, is the smallest integer $k$ such that $G$ admits a proper $k$-coloring whose color classes differ in size by at most one. We prove that for every…
Region-of-Interest (ROI)-based image compression allocates bits unevenly according to the semantic importance of different regions. Such differentiated coding typically induces a sharp-peaked and heavy-tailed distribution. This distribution…
We generalize the low-rank decomposition problem, such as principal and independent component analysis (PCA, ICA) for continuous-time vector-valued signals and provide a model-agnostic implicit neural signal representation framework to…