Related papers: Generalized Color Orderings: CEGM Integrands and D…
The weak $r$-coloring numbers $wcol_r(G)$ of a graph $G$ were introduced by the first two authors as a generalization of the usual coloring number $col(G)$, and have since found interesting theoretical and algorithmic applications. This has…
In this paper, we use semi-definite programming and generalized principal component analysis (GPCA) to distinguish between two or more different facial expressions. In the first step, semi-definite programming is used to reduce the…
It has recently been shown in [\emph{Discrete Appl. Math.} {\bf 366} (2025) 75--85] that the resonance graph of a plane elementary bipartite graph $G$ is a daisy cube if and only if $G$ is peripherally 2-colorable. Let $G$ be a peripherally…
In this paper, we investigate tree-level scattering amplitude relations in $U(N)$ non-linear sigma model. We use Cayley parametrization. As was shown in the recent works [23,24] both on-shell amplitudes and off-shell currents with odd…
We establish the existence of wave-like solutions to spatially coupled graphical models which, in the large size limit, can be characterized by a one-dimensional real-valued state. This is extended to a proof of the threshold saturation…
The Coulomb-gauge ghost propagator, and the color-Coulomb potential, are computed in an ensemble of configurations derived from our recently proposed Yang-Mills vacuum wavefunctional in 2+1 dimensions. The results are compared to the…
Recently, Rourke et al. reported point-contact spectroscopy results on the heavy-fermion superconductor CeCoIn$_5$ [1]. They obtained conductance spectra on the c-axis surfaces of CeCoIn$_5$ single crystals. Their major claims are two-fold:…
The microscopic spectral correlations of the Dirac operator in Yang-Mills theories coupled to fermions in (2+1) dimensions can be related to three universality classes of Random Matrix Theory. In the microscopic limit the Orthogonal…
Real-world applications of machine learning models often confront data distribution shifts, wherein discrepancies exist between the training and test data distributions. In the common multi-domain multi-class setup, as the number of classes…
In a recent work, Keith and Xiong gave a refinement of Glaisher's theorem by using a Sylvester-style bijection. In this paper, we introduce two families of colored partitions, flat and regular partitions, and generalize the bijection of…
For any $m,n\in\mathbb{N}$ we first give new proofs for the following well known combinatorial identities \begin{equation*} S_n(m)=\sum\limits_{k=1}^n\binom{n}{k}\frac{(-1)^{k-1}}{k^m}=\sum\limits_{n\geq r_1\geq r_2\geq...\geq r_m\geq…
For a colour cluster $\mathbb{C} =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\ldots,\mathcal{C}_\ell)$, where $\mathcal{C}_i$ is a colour class such that $|\mathcal{C}_i|=r_i$, a positive integer, we investigate two types of simple…
We consider a generalized chiral Gaussian Unitary Ensemble (chGUE) based on a weak confining potential. We study the spectral correlations close to the origin in the thermodynamic limit. We show that for eigenvalues separated up to the mean…
A coloring of a connected graph $G$ is a function $f$ mapping the vertex set of $G$ into the set of all integers. For any subgraph $H$ of $G$, we denote the sum of the values of $f$ on the vertices of $H$ as $f(H)$. If for any integer $k\in…
Hajnal and Szemer\'{e}di proved that if $G$ is a finite graph with maximum degree $\Delta$, then for every integer $k \geqslant \Delta+1$, $G$ has a proper coloring with $k$ colors in which every two color classes differ in size at most by…
We state and prove a general summation identity. The identity is then applied to derive various summation formulas involving the generalized harmonic numbers and related quantities. Interesting results, mostly new, are obtained for both…
In this paper, a $k$-edge-coloring of $G$ is any mapping $c:E(G)\longrightarrow [k]$. The edge-coloring $c$ of $G$ naturally defines a vertex-coloring $\sigma_{c}: V(G) \to \mathbb{N}$, where $\sigma_{c}(v)=\sum_{u\in N_G(v)}c(vu)$ for…
This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each…
After exhaustive inspection of bosonic coherent states appearing in physical literature two of us, Horzela and Szafraniec, came in 2012 to the reasonably general definition which relies exclusively on reproducing kernels. The basic feature…
The smallest integer $k$ needed for the assignment of colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vizing and Behzed conjectured that the total coloring can be…