Related papers: Commutation classes of double wiring diagrams
A simple method for breaking gauge groups by orbifolding is presented. We extend the method of Kac and Peterson to include Wilson lines. The complete classification of the gauge group breaking, e.g. from heterotic string, is now possible.…
In this work, we show that the class of word-representable graphs is closed under split recomposition and determine the representation number of the graph obtained by recomposing two word-representable graphs. Accordingly, we show that the…
The commuting graph of a non-commutative ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two vertices $x, y$ are adjacent if and only if $xy = yx$. In this paper, we compute the spectrum…
In this paper we give a method for constructing systematically all simple 2-connected graphs with n vertices from the set of simple 2-connected graphs with n-1 vertices, by means of two operations: subdivision of an edge and addition of a…
A graph $G = (V,E)$ is a double-threshold graph if there exist a vertex-weight function $w \colon V \to \mathbb{R}$ and two real numbers $\mathtt{lb}, \mathtt{ub} \in \mathbb{R}$ such that $uv \in E$ if and only if $\mathtt{lb} \le…
This paper investigates the new notion of $2$-word-$\pi$-repre\-sentable graphs: the nodes of the graph correspond to the letters of the two words and there exists an edge between two nodes if the projections of any two letters of both…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
We introduce the normalising graph of a group and study the connectivity of the normalising and permuting graphs of a group when the group is finite and soluble. In particular, we classify finite soluble groups with disconnected normalising…
For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…
We generalize the fermionic renormalization group method to describe analytically transport through a double barrier structure in a one-dimensional system. Focusing on the case of weakly interacting electrons, we investigate thoroughly the…
A new graph dual formalism is presented for the analysis of line outages in electricity networks. The dual formalism is based on a consideration of the flows around closed cycles in the network. After some exposition of the theory is…
A method of Feynman diagrams summation, based on using Schwinger-Dyson equations and Ward identities, is verified by calculating some four-loop diagrams in N=1 supersymmetric electrodynamics, regularized by higher derivatives. In…
We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires in parallel are linked through the multiplicative structure…
The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…
In computing the two-loop QCD corrections to a class of Feynman diagrams for the process $q\overline{q} \rightarrow ZH$ in Higgs effective field theory, we discover a striking phenomenon. We find the need for an additional local composite…
In this paper, we study the group and list group colorings of total graphs and we give two group versions of the total and list total colorings conjectures. We establish the group version of the total coloring conjecture for the following…
How might one test the hypothesis that networks were sampled from the same distribution? Here, we compare two statistical tests that use subgraph counts to address this question. The first uses the empirical subgraph densities themselves as…
We study the coupling constant renormalization of gauge theories with an infinite multiplet of fermions, using the zeta function method to make sense of the infinite sums over fermions. If the gauge group K is the maximal compact subgroup…
String theories should reduce to ordinary four-dimensional field theories at low energies. Yet the formulation of the two are so different that such a connection, if it exists, is not immediately obvious. With the Schwinger proper-time…
Let $G$ be a graph with a perfect matching. Denote by $f(G)$ the minimum size of a matching in $G$ which is uniquely extendable to a perfect matching in $G$. Diwan (2019) proved by linear algebra that for $d$-hypercube $Q_d$ ($d\geq 2)$,…