Related papers: Generalized Color Orderings: CEGM Integrands and D…
We describe how to construct a spanning set of linearly-independent, automatically orthogonal colour tensors for scattering amplitudes involving coloured particles transforming under arbitrary representations of any gauge theory, sufficient…
Arkani-Hamed and collaborators have recently shown that scattering amplitudes for colored theories can be expressed as integrals over combinatorial objects simply constructed from surfaces decorated by kinematic data. In this paper we…
Let $G=G(n,m)$ be a random graph whose average degree $d=2m/n$ is below the $k$-colorability threshold. If we sample a $k$-coloring $\sigma$ of $G$ uniformly at random, what can we say about the correlations between the colors assigned to…
In 1970 Hajnal and Szemer\'edi proved a conjecture of Erd\"os that for a graph with maximum degree $\Delta$, there exists an equitable $\Delta+1$ coloring; that is a coloring where color class sizes differ by at most $1$. In 2007 Kierstand…
The universal, scaled order parameter profiles $P_{\pm}(z/\xi)$ for critical adsorption of a fluid or fluid mixture onto a wall or interface, and for the extraordinary transition of the semi-infinite Ising model, are discussed…
We provide a quantitative analysis of the splittings in low-lying numerical entanglement spectra (ES), at given momentum, of a number of quantum states that can be identified, based on "Li-Haldane state-counting", as ground states of…
Let $G=(V,E)$ be a graph. A (proper) $k$-edge-coloring is a coloring of the edges of $G$ such that any pair of edges sharing an endpoint receive distinct colors. A classical result of Vizing ensures that any simple graph $G$ admits a…
Using only the Britto-Cachazo-Feng-Witten(BCFW) on-shell recursion relation we prove color-order reversed relation, $U(1)$-decoupling relation, Kleiss-Kuijf(KK) relation and Bern-Carrasco-Johansson(BCJ) relation for color-ordered gauge…
Generalized Category Discovery (GCD) aims to identify both known and novel categories within unlabeled data by leveraging a set of labeled examples from known categories. Existing GCD methods primarily depend on semantic labels and global…
Linear structural equation models relate the components of a random vector using linear interdependencies and Gaussian noise. Each such model can be naturally associated with a mixed graph whose vertices correspond to the components of the…
The Gottesman-Kitaev-Preskill (GKP) code is an important type of bosonic quantum error-correcting code. Since the GKP code only protects against small shift errors in $\hat{p}$ and $\hat{q}$ quadratures, it is necessary to concatenate the…
Let $c$ be a proper edge colouring of a graph $G=(V,E)$ with integers $1,2,\ldots,k$. Then $k\geq \Delta(G)$, while by Vizing's theorem, no more than $k=\Delta(G)+1$ is necessary for constructing such $c$. On the course of investigating…
We calculate a general spectral correlation function of products and ratios of characteristic polynomials for a $N\times N$ random matrix taken from the chiral Gaussian Unitary Ensemble (chGUE). Our derivation is based upon finding an…
The asymptotics of characters $\chi_{k\lambda}(\exp(h/k))$ of irreducible representations of a compact Lie group $G$ for large values of the scaling factor $k$ are given by Duistermaat-Heckman (DH) integrals over coadjoint orbits of $G$.…
We study the symmetry and integrability of a Generalized Modified Camassa-Holm Equation (GMCH) of the form $$u_{t}-u_{xxt}+2nu_{x}(u^2-u_{x}^2)^{n-1}(u-u_{xx})^2+(u^2-u_{x}^2)^{n}(u_{x}-u_{xxx})=0.$$ We observe that for increasing values of…
K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…
An equitable colouring of a graph $G$ is a colouring of the vertices of $G$ so that no two adjacent vertices are coloured the same and, additionally, the colour class sizes differ by at most $1$. The equitable chromatic number $\chi_=(G)$…
We present recent evolutions of the detailed opacity code SCO-RCG which combines statistical modelings of levels and lines with fine-structure calculations. The code now includes the Partially-Resolved-Transition-Array model, which allows…
DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been widely studied in recent years after its introduction by Dvo\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an…
A Gaussian quantum theory of bosonic modes has been widely used to describe quantum optical systems, including coherent Ising machines (CIMs) that consist of $\chi^{(2)}$ degenerate optical parametric oscillators (DOPOs) as nonlinear…