Related papers: Parallel Algorithms for Group Isomorphism via Code…

The automorphism group of a code is the group of permutations that map a code to itself. Berman codes are a class of binary linear codes characterized by two integer parameters $n\geq 2$ and $m\geq 1$, and this class includes the…

In this document we consider an exact sequence of group varieties $e\to N\to G\to Q\to e$ over an algebraically closed field. We show that for $l\neq \mathrm{char}(k)$ a prime there exists an isomorphism of graded $\mathbb{Q}_l$-algebras…

Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here we study the compatibility of these two…

Let $F$ be a totally real field. We study the root numbers $\epsilon(1/2, \pi)$ of self-dual cuspidal automorphic representations $\pi$ of $\mathrm{GL}_{2N}/F$ with conductor $\mathfrak n$ and regular integral infinitesimal character…

We construct finite-dimensional Hopf algebras whose coradical is the group algebra of a central extension of an abelian group. They fall into families associated to a semisimple Lie algebra together with a Dynkin diagram automorphism. We…

We classify up to isomorphism the gradings by arbitrary groups on the exceptional classical simple Lie superalgebras $G(3)$, $F(4)$ and $D(2,1;\alpha)$ over an algebraically closed field of characteristic $0$. To achieve this, we apply the…

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…

Let $K$ be a complete discrete valuation field with finite residue field of characteristic $p$, and let $D$ be a central division algebra over $K$ of finite index $d$. Thirty years ago, Suslin and Yufryakov showed that for all prime numbers…

Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…

Let \(\cU\) be the multiplicative group of order~\(n\) in the splitting field \(\bbF_{q^m}\) of \(x^n-1\) over the finite field \(\bbF_q\). Any map of the form \(x\rightarrow cx^t\) with \(c\in \cU\) and \(t=q^i\), \(0\leq i<m\), is…

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance…

How to design fair and (computationally) efficient voting rules is a central challenge in Computational Social Choice. In this paper, we aim at designing efficient algorithms for computing most equitable rules for large classes of…

Factorial designs are often used in various industrial and sociological experiments to identify significant factors and factor combinations that may affect the process response. In the statistics literature, several studies have…

With recent breakthroughs in the construction of good qLDPC codes and nearly good qLTCs, the study of (co)homological invariants of quantum code complexes, which fundamentally underlie their logical operations, has become evidently…

In this paper we present an efficiently scaling quantum algorithm which finds the size of the maximum common edge subgraph for a pair of arbitrary graphs and thus provides a meaningful measure of graph similarity. The algorithm makes use of…

We develop a theory of equivariant factorization algebras on varieties with an action of a connected algebraic group $G$, extending the definitions of Francis-Gaitsgory [FG] and Beilinson-Drinfeld [BD1] to the equivariant setting. We define…

Let $G$ be a group, define an equivalence relation $\sim$ as below: $$\forall \ g, h \in G, \ g \sim h \Longleftrightarrow |g| = |h|$$ the set of sizes of equivalence classes with respect to this relation is called the same-order type of…

We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…

The algebra of truncated polynomials A_m=Z[x]/(x^m) plays an important role in the theory of Khovanov and Khovanov-Rozansky homology of links. We have demonstrated that Hochschild homology is closely related to Khovanov homology via…