Related papers: Two gluing methods for string C-group representati…
An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching…
We study commutative Schur rings over the symplectic groups Sp$(n,2)$ containing the class $\mathcal C$ of symplectic transvections. We find the possible partitions of $\mathcal C$ determined by the Schur ring. We show how this restricts…
Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…
Graph-level contrastive learning, aiming to learn the representations for each graph by contrasting two augmented graphs, has attracted considerable attention. Previous studies usually simply assume that a graph and its augmented graph as a…
We use binary trees to study the Bratteli diagram of Sylow 2-subgroups of symmetric groups. We show that it is simple, has a recursive structure, and self-similarities at all scales. We contrast its subgraph of one-dimensional…
Recently, contrastive learning (CL) has emerged as a successful method for unsupervised graph representation learning. Most graph CL methods first perform stochastic augmentation on the input graph to obtain two graph views and maximize the…
From an N=1 supersymmetric electric gauge theory with the gauge group SU(N_c) x SU(N_c') x SU(N_c'') with fundamentals for each gauge group and the bifundamentals, we apply Seiberg dual to each gauge group and obtain the N=1 supersymmetric…
We use the structure of finite-dimensional graded algebras to develop the theory of antilinear representations of finite $C_2$-graded groups. A finite $C_2$-graded group is a finite group with a subgroup of index 2. In this theory the…
There are some similarities between cohomology of SU(2)-representation varieties of the fundamental group of some link complements and the Khovanov homology of the links. We start here a program to explain a possible source of these…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
We start with definitions of the general notions of the theory of $\Bbb Z_{2}$-graded algebras. Then we consider theory of inductive families of $\Bbb Z_{2}$-graded semisimple finite-dimensional algebras and its representations in the…
We construct two-dimensional N=(2,2) supersymmetric gauge theories with orthogonal and symplectic groups using branes and orientifold planes in Type IIA string theory. A number of puzzles regarding the construction, including the effect of…
We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show…
We use dyonic brane configurations of type 0 string theory to study large N non-supersymmetric 4d gauge theories. The brane configurations define theories similar to the supersymmetric ones which arise in type II. We find the non-SUSY…
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…
We introduce path-conjoined graphs defined for two rooted graphs by joining their roots with a path, and investigate the chromatic symmetric functions of its two generalizations: spider-conjoined graphs and chain-conjoined graphs. By using…
We define new statistics, (c, d)-descents, on the colored permutation groups Z_r \wr S_n and compute the distribution of these statistics on the elements in these groups. We use some combinatorial approaches, recurrences, and generating…
We give two proofs of a level-rank duality for braided fusion categories obtained from quantum groups of type $C$ at roots of unity. The first proof uses conformal embeddings, while the second uses a classification of braided fusion…
A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…