Related papers: Generalized Color Orderings: CEGM Integrands and D…

We describe coherent states and associated generalized Grassmann variables for a system of $m$ independent $q$-boson modes. A resolution of unity in terms of generalized Berezin integrals leads to generalized Grassmann symbolic calculus.…

Let $c:E(G)\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\bar{c}(v)=(a_1,\ldots,a_k)$, where $a_i$ is the number of edges incident to $v$ with color $i$. Reorder $\bar{c}(v)$ for every $v$ in…

We introduce a parametrization of formal deformations of Verma modules of $\mathfrak{sl}_2$. A point in the moduli space is called a colouring. We prove that for each colouring $\psi$ satisfying a regularity condition, there is a formal…

Feynman diagrams for gluon tree amplitudes are studied in the Feynman gauge and in any number of spacetime dimensions. The color-kinematics combinations $\Delta=n_s-n_t-n_u$ of numerators are explicitly calculated for $N=4,5,6$ gluons to…

A signed graph $(G,\sigma)$ consists of a graph $G$ and the signature $\sigma : E(G) \rightarrow \{+1,-1\}$. An incidence of $G$ is a pair $(v,e)$, where $v$ is one of the end vertices of an edge $e \in E(G)$. A proper $q$-edge coloring…

Generalized Tanner graphs have been implicitly studied by a number of authors under the rubric of generalized parity-check matrices. This work considers the conditioning of binary hidden variables in such models in order to break all cycles…

We introduce a new concept in graph coloring motivated by the popular Sudoku puzzle. Let $G=(V,E)$ be a graph of order $n$ with chromatic number $\chi(G)=k$ and let $S\subseteq V.$ Let $\mathscr C_0$ be a $k$-coloring of the induced…

Integration by parts identities (IBPs) can be used to express large numbers of apparently different d-dimensional Feynman Integrals in terms of a small subset of so-called master integrals (MIs). Using the IBPs one can moreover show that…

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…

The phase diagram of dense QCD at nonvanishing temperatures and large quark chemical potentials is studied with Dyson-Schwinger equations for 2+1 quark flavors, focusing on color-superconducting phases with 2SC and CFL-like pairing. The…

We consider the problem of distributed lossless computation of a function of two sources by one common user. To do so, we first build a bipartite graph, where two disjoint parts denote the individual source outcomes. We then project the…

We establish new algorithmic guarantees with matching hardness results for coloring and independent set problems in one-sided expanders and related classes of graphs. For example, given a $3$-colorable regular one-sided expander, we compute…

For a colour cluster $\C =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\dots,\mathcal{C}_\ell)$, $\mathcal{C}_i$ is a colour class, and $|\mathcal{C}_i|=r_i \geq 1$, we investigate a simple connected graph structure $G^{\C}$, which…

In a fractional coloring, vertices of a graph are assigned measurable subsets of the real line and adjacent vertices receive disjoint subsets; the fractional chromatic number of a graph is at most $k$ if it has a fractional coloring in…

Consider generalized adapted stochastic integrals with respect to independently scattered random measures with second moments. We use a decoupling technique, known as the "principle of conditioning", to study their stable convergence…

The Global Colour Model (GCM) of QCD is a quark-gluon quantum field theory that very successfully models QCD for low energy hadronic processes. An effective gluon correlator models the interaction between quark currents. Functional integral…

Decoherence in nearly-isolated GaAs quantum dots is investigated using the change in average Coulomb blockade peak height upon breaking time-reversal symmetry. The normalized change in average peak height approaches the predicted universal…

In Defective Coloring we are given a graph $G$ and two integers $\chi_d$, $\Delta^*$ and are asked if we can $\chi_d$-color $G$ so that the maximum degree induced by any color class is at most $\Delta^*$. We show that this natural…

The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…

Let $G$ be a finite group and $\chi: G \rightarrow \mathbb{C}$ a class function. Let $H = (V,E)$ be a directed graph with for each vertex a cyclic order of the edges incident to it. The cyclic orders give a collection $F$ of faces of $H$.…