Related papers: Parallel Algorithms for Group Isomorphism via Code…

The graph isomorphism problem is considered. We assign modified $n$-variable characteristic polynomials for graphs and reduce the graph isomorphism problem to the problem of the polynomials isomorphism. It is required to find out, is there…

Consider a locally compact group $G=Q\ltimes V$ such that $V$ is abelian and the action of $Q$ on the dual abelian group $\hat V$ has a free orbit of full measure. We show that such a group $G$ can be quantized in three equivalent ways: (1)…

We give a $O^*(k^{O(k)})$ time isomorphism testing algorithm for graphs of eigenvalue multiplicity bounded by $k$ which improves on the previous best running time bound of $O^*(2^{O(k^2/\log k)})$.

We prove a local analog of the Deligne-Riemann-Roch isomorphism in the case of line bundles and relative dimension $1$. This local analog consists in computation of the class of $12$th power of the determinant central extension of a group…

Let $n$ be a positive integer. The main result of this manuscript is a construction of a filtration on the cohomology ring of a regular nilpotent Hessenberg variety in $GL(n,{\mathbb{C}})/B$ such that its associated graded ring has graded…

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

We develop and collect techniques for determining Hochschild cohomology of skew group algebras S(V)#G and apply our results to graded Hecke algebras. We discuss the explicit computation of certain types of invariants under centralizer…

We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the…

Motivic equivalence for algebraic groups was recently introduced in [9], where a characterization of motivic equivalent groups in terms of higher Tits indexes is given. As a consequence, if the quadrics associated to two quadratic forms…

A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be…

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

Employing isomorphisms between their ambient rings, we propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This reduces the number of previously known…

This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all…

In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…

The index coding problem is concerned with broadcasting encoded information to a collection of receivers in a way that enables each receiver to discover its required data based on its side information, which comprises the data required by…

Let $A$ be an $n$-dimensional algebra over a field $k$ and $a(A)$ its quantum symmetry semigroup. We prove that the automorphisms group ${\rm Aut}_{\rm Alg} (A)$ of $A$ is isomorphic to the group $U \bigl( G(a (A)^{\rm o} ) \bigl)$ of all…

The Subgraph Isomorphism problem is of considerable importance in computer science. We examine the problem when the pattern graph H is of bounded treewidth, as occurs in a variety of applications. This problem has a well-known algorithm via…

It is known that the minimum broadcast rate of a linear index code over $\mathbb{F}_q$ is equal to the $minrank_q$ of the underlying digraph. In [3] it is proved that for $\mathbb{F}_2$ and any positive integer $k$, $minrank_q(G)\leq k$ iff…

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…