English
Related papers

Related papers: Graph Theoretic Method for Determining non Hurwitz…

200 papers

Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…

Discrete Mathematics · Computer Science 2017-07-18 Alexander V. Evako

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue…

Spectral Theory · Mathematics 2014-01-10 Polona Oblak , Helena Šmigoc

Multi-attributed graph matching is a problem of finding correspondences between two sets of data while considering their complex properties described in multiple attributes. However, the information of multiple attributes is likely to be…

Computer Vision and Pattern Recognition · Computer Science 2017-04-25 Han-Mu Park , Kuk-Jin Yoon

The anomaly of non-invertible higher-form symmetries is determined by the braiding of topological operators implementing them. In this paper, we study a method to classify braidings on topological line and surface operators by leveraging…

High Energy Physics - Theory · Physics 2025-03-19 Pavel Putrov , Rajath Radhakrishnan

2-group symmetries are generalized symmetries that arise when 1-form and 0-form symmetries mix with each other. We uncover the existence of a class of 2-group symmetries in general 4d N=2 theories of Class S that can be constructed by…

High Energy Physics - Theory · Physics 2022-05-11 Lakshya Bhardwaj

In the study of 2d (the space dimension) topological orders, it is well-known that bulk excitations are classified by unitary modular tensor categories. But these categories only describe the local observables on an open 2-disk in the long…

Quantum Algebra · Mathematics 2018-06-18 Yinghua Ai , Liang Kong , Hao Zheng

The Burau representation of braid groups and knot Floer homology share a link to the Fox calculus. We make this connection explicit, with the following outcome: if $B$ is the full Burau matrix of any braid, and $A$ is any square submatrix…

Geometric Topology · Mathematics 2025-10-14 Joe Boninger

The concept of a $1$-rotational factorization of a complete graph under a finite group $G$ was studied in detail by Buratti and Rinaldi. They found that if $G$ admits a $1$-rotational $2$-factorization, then the involutions of $G$ are…

Combinatorics · Mathematics 2018-10-25 Daniel McGinnis , Eirini Poimenidou

The paper deals with the cohomological invariants of smooth and connected linear algebraic groups over an arbitrary field. More precisely, we study degree $2$ invariants with coefficients $\mathbb{Q}/\mathbb{Z}(1)$, that is invariants…

Algebraic Geometry · Mathematics 2025-09-30 Alexandre Lourdeaux

For graphs $H_1$ and $H_2$, if we glue them by identifying a given pair of vertices $u \in V(H_1)$ and $v \in V(H_2)$, what is the extremal number of the resulting graph $H_1^u \odot H_2^v$? In this paper, we study this problem and show…

Combinatorics · Mathematics 2025-11-07 Zichao Dong , Jun Gao , Hong Liu

We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$-factor $\mathcal{C}$ and a $1$-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where…

Combinatorics · Mathematics 2026-01-19 Brian Alspach , Primoz Sparl

This thesis concerns the study of homogeneous factorisations of complete graphs with edge-transitive factors. A factorisation of a complete graph $K_n$ is a partition of its edges into disjoint classes. Each class of edges in a…

Combinatorics · Mathematics 2007-05-23 Tian Khoon Lim

We propose an algorithm for obtaining the common transfer digraph $ D^*_m$ for enumeration of 2-factors in graphs from the title all of which with $m n$ vertices ($m, n \in N, m >1 $). The numerical data gathered for $m <19$ reveal some…

Combinatorics · Mathematics 2022-10-24 Jelena Đokić , Ksenija Doroslovački , Olga Bodroža-Pantić

There is an established bijection between finite-index subgroups Gamma of Gamma(2) and bipartite graphs on surfaces, or, equivalently, certain triples of permutations. We utilize this relationship to study both congruence and noncongruence…

Number Theory · Mathematics 2013-07-29 Erica J. Whitaker

Classical knot theory deals with {\em diagrams} and {\em invariants}. By means of horizontal {\em trisecants}, we construct a new theory of classical braids with invariants valued in {\em pictures}. These pictures are closely related to…

Geometric Topology · Mathematics 2015-01-22 Vassily Olegovich Manturov

We consider different variants of factorization of a 2x2 matrix Schroedinger/Pauli operator in two spatial dimensions. They allow to relate its spectrum to the sum of spectra of two scalar Schroedinger operators, in a manner similar to…

High Energy Physics - Theory · Physics 2008-11-26 M. V. Ioffe , A. I. Neelov

We compute the quantum double, braiding and other canonical Hopf algebra constructions for the bicrossproduct Hopf algebra $H$ associated to the factorization of a finite group into two subgroups. The representations of the quantum double…

q-alg · Mathematics 2016-09-08 E. Beggs , J. Gould , S. Majid

Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…

Social and Information Networks · Computer Science 2018-11-30 Jiankai Sun , Srinivasan Parthasarathy

We construct graph-valued analogues of the Kuperberg sl(3) and G2 invariants for virtual knots. The restriction of the sl(3) or G2 invariants for classical knots coincides with the usual Homflypt sl(3) invariant and G2 invariants. For…

Geometric Topology · Mathematics 2014-07-11 Louis Hirsch Kauffman , Vassily Olegovich Manturov

Let $G$ be a simple graph of order $n$. The double vertex graph $F_2(G)$ of $G$ is the graph whose vertices are the $2$-subsets of $V(G)$, where two vertices are adjacent in $F_2(G)$ if their symmetric difference is a pair of adjacent…

Combinatorics · Mathematics 2021-08-09 Luis Enrique Adame , Luis Manuel Rivera , Ana Laura Trujillo-Negrete