Related papers: Commutation classes of double wiring diagrams

We describe a graph reduction operation, generalizing three graph reduction operations related to gene assembly in ciliates. The graph formalization of gene assembly considers three reduction rules, called the positive rule, double rule,…

In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of voltage graphs and Paley graphs in the Galois field GF(pr), where p is a…

Construction of a universal finite-type invariant can be reduced, under suitable assumptions, to the solution of certain equations (the hexagon and pentagon equations) in a particular graded associative algebra of chord diagrams. An…

A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel compositions. Since different syntactic terms may represent the…

We present a calculating method for the quark and lepton mixing angles. After a general discussion in field theoretic models, we present a working model from a string compactification through $Z_{12-I}$ orbifold compactification. It is…

A permutation array $A$ is a set of permutations on a finite set $\Omega$, say of size $n$. Given distinct permutations $\pi, \sigma\in \Omega$, we let $hd(\pi, \sigma) = |\{ x\in \Omega: \pi(x) \ne \sigma(x) \}|$, called the Hamming…

In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean…

Making a combined use of bosonization and fermionization techniques, we build nonlocal transformations between dual fermion operators, describing junctions of strongly interacting spinful one-dimensional quantum wires. Our approach allows…

We present enumeration results on the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (a cospectral mate), or at least one other graph with the same Smith normal form…

We investigate two conjectured spectral graph theoretic strengthenings of Tur\'an's theorem. Let $\mu_1 \ge \ldots \ge \mu_n$ denote the eigenvalues of a graph $G$ with $n$ vertices, $m$ edges and clique number $\omega(G)$. The concise…

Let $P(G)$ denotes the set of sizes of fibers of non-trivial commutators of the commutator word map. Here, we prove that $|P(G)|=1$, for any finite group $G$ of nilpotency class $3$ with exactlly two conjugacy class sizes. We also show that…

Using the standard Coxeter presentation for the symmetric group $S_n$, two reduced expressions for the same group element are said to be commutation equivalent if we can obtain one expression from the other by applying a finite sequence of…

In this work, we characterize the class of word-representable graphs with respect to the modular decomposition. Consequently, we determine the representation number of a word-representable graph in terms of the permutation-representation…

For a commutative ring $R$, the zero-divisor graph of $R$ is a simple graph with the vertex set as the set of all zero-divisors of $R$ and two distinct vertices $x$ and $y$ are adjacent if and only if $xy = 0$. This article attempts to…

We give a new proof of the non-triviality of wheel graph homology classes using higher operations on Lie graph homology and a derived version of Koszul duality for modular operads.

In a recent paper, Polchinski and Strassler found a string theory dual of a gauge theory with reduced supersymmetry. Motivated by their approach, we perturb the $\N=8$ theory living on a set of N M2 branes to $\N=2$, by adding fermion mass…

Monotone grid classes of permutations have proven very effective in helping to determine structural and enumerative properties of classical permutation pattern classes. Associated with grid class $\mathrm{Grid}(M)$ is a graph, $G(M)$, known…

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

Let $\gamma'_s(G)$ be the signed edge domination number of G. In 2006, Xu conjectured that: for any $2$-connected graph G of order $ n (n \geq 2),$ $\gamma'_s(G)\geq 1$. In this article we show that this conjecture is not true. More…

In this paper, we consider the problem of reducing the semitotal domination number of a given graph by contracting $k$ edges, for some fixed $k \geq 1$. We show that this can always be done with at most 3 edge contractions and further…