Related papers: On the Complexity of Identifying Groups without Ab…

Subgraph Isomorphism is a very basic graph problem, where given two graphs $G$ and $H$ one is to check whether $G$ is a subgraph of $H$. Despite its simple definition, the Subgraph Isomorphism problem turns out to be very broad, as it…

The group isomorphism problem determines whether two groups, given by their Cayley tables, are isomorphic. For groups with order $n$, an algorithm with $n^{(\log n + O(1))}$ running time, attributed to Tarjan, was proposed in the 1970s…

A group is said to be cube-free if its order is not divisible by the cube of any prime. Let $f_{cf,sol}(n)$ denote the isomorphism classes of solvable cube-free groups of order $n$. We find asymptotic bounds for $f_{cf,sol}(n)$ in this…

In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…

Let $G$ be a finite group acting on $\mathbb{C}^N$. We study the problem of identifyng the class in $\mathbb{C}^N / G$ of a given signal: this encompasses several types of problems in signal processing. Some instances include certain…

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…

In this paper, we consider the problem of noiseless non-adaptive group testing under the for-each recovery guarantee, also known as probabilistic group testing. In the case of $n$ items and $k$ defectives, we provide an algorithm attaining…

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

In this paper we consider the problems of testing isomorphism of tensors, $p$-groups, cubic forms, algebras, and more, which arise from a variety of areas, including machine learning, group theory, and cryptography. These problems can all…

We deal with some pcf investigations mostly motivated by abelian group theory problems and deal their applications to test problems (we expect reasonably wide applications). We prove almost always the existence of aleph_omega-free abelian…

Non-parametric tests based on permutation, rotation or sign-flipping are examples of group-invariance tests. These tests test invariance of the null distribution under a set of transformations that has a group structure, in the algebraic…

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…

We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…

In this paper, we investigate the complexity of computing minimal faithful permutation representations for groups without abelian normal subgroups (a.k.a. Fitting-free groups). When our groups are given as quotients of permutation groups,…

This paper considers non-Abelian homology groups of a group diagram introduced as homotopy groups of a simplicial change. We prove a theorem stating that the non-Abelian homology groups of a group diagram are isomorphic to the homotopy…

The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the number of refinement rounds is small, this puts the corresponding isomorphism problem in a…

For an Abelian group $G$, any homomorphism $\mu\colon G\otimes G\rightarrow G$ is called a \textsf{multiplication} on $G$. The set $\text{Mult}\,G$ of all multiplications on an Abelian group $G$ itself is an Abelian group with respect to…

The isomorphism problem for finite groups of order n (GpI) has long been known to be solvable in $n^{\log n+O(1)}$ time, but only recently were polynomial-time algorithms designed for several interesting group classes. Inspired by recent…

In this work we prove non-trivial impossibility results for perhaps the simplest non-linear estimation problem, that of {\it Group Testing} (GT), via the recently developed Madiman-Tetali inequalities. Group Testing concerns itself with…

Let $C,A$ be countable abelian groups. In this paper we determine the complexity of classifying extensions $C$ by $A$, in the cases when $C$ is torsion-free and $A$ is a $p$-group, a torsion group with bounded primary components, or a free…