English
Related papers

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

200 papers

A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic…

Group Theory · Mathematics 2012-12-11 Eldho K. Thomas , Nadya Markin , Frédérique Oggier

We continue our investigation of a variation of the group ring isomorphism problem for twisted group algebras. Contrary to previous work, we include cohomology classes which do not contain any cocycle of finite order. This allows us to…

Rings and Algebras · Mathematics 2023-03-17 L. Margolis , O. Schnabel

The Resolution Theorem for Compact Abelian Groups is applied to show that the profinite subgroups of a finite-dimensional compact connected abelian group (protorus) which induce tori quotients comprise a lattice under intersection (meet)…

Group Theory · Mathematics 2025-03-28 Wayne Lewis

In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup $\mathcal{H}$ of a FATF group $\mathcal{G}$,…

Group Theory · Mathematics 2023-07-28 Mallika Roy , Enric Ventura

The isomorphism and quasi-isomorphism relations on the $p$-local torsion-free abelian groups of rank $n\geq3$ are incomparable with respect to Borel reducibility.

Logic · Mathematics 2019-08-16 Samuel Coskey

In 1979, Miller proved that for a group $G$ of odd order, two minimal group codes in $\mathbb{F}_2G$ are $G$-equivalent if and only they have identical weight distribution. In 2014, Ferraz-Guerreiro-Polcino Milies disprove Miller's result…

Group Theory · Mathematics 2022-12-15 Fatma Altunbulak Aksu , İpek Tuvay

We exhibit examples of finitely presented subgroups $P$ of direct products of hyperbolic groups for which there is no algorithm that detects whether a finitely presented group has a quotient isomorphic to $P$. For any torsion-free, linear,…

Group Theory · Mathematics 2025-12-30 Konstantinos Tsouvalas

In this paper we study (logical) types and isotypical equivalence of torsion free Abelian groups. We describe all possible types of elements and standard 2-tuples of elements in these groups and classify separable torsion free Abelian…

Group Theory · Mathematics 2024-09-13 Elena Bunina

Given an associative $\mathbb{C}$-algebra $A$, we call $A$ strongly rigid if for any pair of finite subgroups of its automorphism groups $G, H,$ such that $A^G\cong A^H$, then $G$ and $H$ must be isomorphic. In this paper we show that a…

Quantum Algebra · Mathematics 2025-03-12 Akaki Tikaradze

We study testing $\pi$-freeness of functions $f:[n]^d\to\mathbb{R}$, where $f$ is $\pi$-free if there there are no $k$ indices $x_1\prec\cdots\prec x_k\in [n]^d$ such that $f(x_i)<f(x_j)$ and $\pi(i) < \pi(j)$ for all $i,j \in [k]$, where…

Data Structures and Algorithms · Computer Science 2025-10-28 Harish Chandramouleeswaran , Ilan Newman , Tomer Pelleg , Nithin Varma

This is the third and final installment of an exposition of an ACL2 formalization of finite group theory. Part I covers groups and subgroups, cosets, normal subgroups, and quotient groups. Part II extends the theory in the developmnent of…

Discrete Mathematics · Computer Science 2023-11-16 David M. Russinoff

We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…

Data Structures and Algorithms · Computer Science 2014-12-02 David J. Rosenbaum

For non-abelian simple objects in a unitary modular category, the density of their braid group representations, the #P-hard evaluation of their associated link invariants, and the BQP-completeness of their anyonic quantum computing models…

Quantum Algebra · Mathematics 2015-06-15 Matthew B. Hastings , Chetan Nayak , Zhenghan Wang

We explore countable ordered Archimedean groups from the point of view of descriptive set theory. We introduce the space of Archimedean left-orderings $\mathrm{Ar}(G)$ for a given countable group $G$, and prove that the equivalence relation…

Logic · Mathematics 2023-01-16 Filippo Calderoni , David Marker , Luca Motto Ros , Assaf Shani

We prove new parameterized complexity results for the FO Model Checking problem on a well-known generalization of interval and circular-arc graphs: the class of $H$-graphs, for any fixed multigraph $H$. In particular, we research how the…

Computational Complexity · Computer Science 2025-10-27 Flavia Bonomo-Braberman , Nick Brettell , Noleen Köhler , Andrea Munaro , Daniël Paulusma

We consider two variants of those Abelian groups with all proper strongly invariant subgroups isomorphic and give an in-depth study of their basic and specific properties in either parallel or contrast to the Abelian groups with all proper…

Group Theory · Mathematics 2023-08-01 Andrey R. Chekhlov , Peter V. Danchev

The groups of order 64p without a normal sylow p-subgroup are listed, and their automorphism groups are also determined. As a by-product of our original effort to get these groups, we needed to determine the automorphism groups of those…

Group Theory · Mathematics 2013-10-02 Walter Becker , Elaine W. Becker

Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…

Computational Complexity · Computer Science 2025-12-16 Marek Černý , Tim Seppelt

Let $p$ be a prime number. A longstanding conjecture asserts that every finite non-abelian $p$-group has a non-inner automorphism of order $p$. In this paper, we prove that if $G$ is an odd order finite non-abelian monolithic $p$-group such…

Group Theory · Mathematics 2024-06-18 Mandeep Singh , Mahak Sharma

Let $G$ be a finite group. Denote by $\textrm{Irr}(G)$ the set of all irreducible complex characters of $G.$ Let $\textrm{cd}(G)=\{\chi(1)\;|\;\chi\in \textrm{Irr}(G)\}$ be the set of all irreducible complex character degrees of $G$…

Group Theory · Mathematics 2011-02-23 Hung P. Tong-Viet