Related papers: Graph Theoretic Method for Determining non Hurwitz…
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however Motwani and Sudan proved that it is NP-complete to determine…
The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…
By using tensor analysis, we find a connection between normed algebras and the parallelizability of the spheres S$^1$, S$^3$ and S$^7.$ In this process, we discovered the analogue of Hurwitz theorem for curved spaces and a geometrical…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
We classify homomorphisms from the braid group on $n$ strands to the pure mapping class group of a nonoriantable surface of genus $g$. For $n\ge 14$ and $g\le 2\lfloor{n/2}\rfloor+1$ every such homomorphism is either cyclic, or it maps…
We study two-dimensional topological gauge theories with gauge group equal to the symmetric group $S_n$ and their string theory duals. The simplest such theory is the topological quantum field theory of principal $S_n$ fiber bundles. Its…
We classify Nichols algebras of irreducible Yetter-Drinfeld modules over groups such that the underlying rack is braided and the homogeneous component of degree three of the Nichols algebra satisfies a given inequality. This assumption…
The factorization number $F_2(G)$ of a finite group $G$ is the number of all possible factorizations of $G=HK$ as product of its subgroups $H$ and $K$, while the subgroup commutativity degree $\mathrm{sd}(G)$ of $G$ is the probability of…
We prove that two reflection factorizations of a given element in an exceptional rank-2 complex reflection group of tetrahedral type are Hurwitz-equivalent if and only if they generate the same subgroup and have the same multiset of…
We continue our computation, using a combinatorial method based on Gronthendieck's dessins d'enfant, of the number of (weak) equivalence classes of surface branched covers matching certain specific branch data. In this note we concentrate…
We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices $V$ and a permutation group $\Gamma$ over domain $V$, and asking whether there is a permutation $\gamma \in \Gamma$ that…
One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…
Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of…
We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…
Given a smooth, projective curve $Y$, a point $y_0 \in Y$, a positive integer $n$, and a transitive subgroup $G$ of the symmetric group $S_{d}$ we study smooth, proper families, parameterized by algebraic varieties, of pointed degree $d$…
We investigate the Hurwitz action of the $m$-braid group on the $m$-fold Cartesian product of the universal dihedral quandle. We introduce three computable invariants and prove that they give a complete classification of the orbits under…
A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…
In this paper, we explore the concept of the ``matrix product of graphs," initially introduced by Prasad, Sudhakara, Sujatha, and M. Vinay. This operation involves the multiplication of adjacency matrices of two graphs with assigned labels,…
We resolve the computational complexity of Graph Isomorphism for classes of graphs characterized by two forbidden induced subgraphs $H_1$ and $H_2$ for all but six pairs $(H_1,H_2)$. Schweitzer had previously shown that the number of open…
We show that the factorization problem $\theta (z)=\theta_2(z)\theta_1(z)$ is solvable in the class of Hilbert space operator-valued functions holomorphic on some neighbourhood of $z=0$ in $\nspace{C}{N}$ and having a zero at $z=0$ (here…