English
Related papers

Related papers: The isomorphism problem for plain groups is in $\S…

200 papers

A finitely generated group $\Gamma$ is called strongly scale-invariant if there exists an injective endomorphism $\varphi: \Gamma \to \Gamma$ with the image $\varphi(\Gamma)$ of finite index in $\Gamma$ and the subgroup $\displaystyle…

Group Theory · Mathematics 2021-03-11 Jonas Deré

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…

Group Theory · Mathematics 2020-08-03 Ruvim Lipyanski , Natalia Vanetik

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel , Alexander Schwartz

We show that, if $\Gamma$ is a point group of $\mathbb{R}^{k+1}$ of order two for some $k\geq 2$ and $\mathcal S$ is a $k$-pseudomanifold which has a free automorphism of order two, then either $\mathcal S$ has a $\Gamma$-symmetric…

Combinatorics · Mathematics 2025-01-29 James Cruickshank , Bill Jackson , Shinichi Tanigawa

We show that the classification of simple finite group schemes over an algebraically closed field reduces to the classification of abstract simple finite groups and of simple restricted Lie algebras in positive characteristic. Both these…

Algebraic Geometry · Mathematics 2015-03-13 Filippo Viviani

The question whether non-isomorphic finite $p$-groups can have isomorphic modular group algebras was recently answered in the negative by Garc\'ia-Lucas, Margolis and del R\'io [J. Reine Angew. Math. 783 (2022), pp. 269-274]. We embed these…

Rings and Algebras · Mathematics 2025-08-14 Leo Margolis , Taro Sakurai

We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…

Group Theory · Mathematics 2015-08-12 Alexei Myasnikov , Andrey Nikolaev , Alexander Ushakov

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

Combinatorics · Mathematics 2021-01-08 Ken-ichi Kawarabayashi , Bojan Mohar , Roman Nedela , Peter Zeman

A class of exact infinitesimal renormalization group transformations is proposed and studied. These transformations are pure changes of variables (i.e., no integration or elimination of some degrees of freedom is required) such that a…

High Energy Physics - Theory · Physics 2017-11-08 Ariel Caticha

We show that the modular isomorphism problem has a positive answer for groups of nilpotency class 2 with cyclic center, i.e. that for such p-groups G and H an isomorphism between the group algebras FG and FH implies an isomorphism of the…

Group Theory · Mathematics 2023-06-13 Diego García-Lucas , Leo Margolis

We discuss the decomposability of torsion-free abelian groups. We show that among computable groups of finite rank this property is $\Sigma^0_3$-complete. However, when we consider groups of infinite rank, it becomes $\Sigma^1_1$-complete,…

Logic · Mathematics 2013-11-11 Kyle Riggs

It is shown that the problem of reduction can be formulated in a uniform way using the theory of invariants. This provides a powerful tool of analysis and it opens the road to new applications of these algebras, beyond the context of…

Exactly Solvable and Integrable Systems · Physics 2015-05-14 Sara Lombardo , Jan A. Sanders

We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. The method to achieve these results relies on a natural map of…

Group Theory · Mathematics 2024-12-10 Frédérique Bassino , Cyril Nicaud , Pascal Weil

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2016-09-07 Wesley Calvert

We apply the method of Arzhantseva-Ol'shanskii to prove that for an exponentially generic (in the sense of Ol'shanskii) class of one-relator groups the isomorphism problem is solvable in at most exponential time. This is obtained as a…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Paul Schupp

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

Group Theory · Mathematics 2025-12-17 Antonio Díaz Ramos , Rémi Molinier , Antonio Viruel

This paper addresses several isotopy problems on $4$-manifolds. First, we classify the isotopy classes of embeddings of $\Sigma$ in $\Sigma\times S^2$ that are geometrically dual to $\{\mbox{pt}\}\times S^2$, where $\Sigma$ is a closed…

Geometric Topology · Mathematics 2026-02-03 Jianfeng Lin , Weiwei Wu , Yi Xie , Boyu Zhang

Let $X$ denote the `conifold smoothing', the symplectic Weinstein manifold which is the complement of a smooth conic in $T^*S^3$, or equivalently the plumbing of two copies of $T^*S^3$ along a Hopf link. Let $Y$ denote the `conifold…

Symplectic Geometry · Mathematics 2026-04-15 Ailsa Keating , Ivan Smith

In this paper, we show that the constant-dimensional Weisfeiler-Leman algorithm for groups (Brachter & Schweitzer, LICS 2020) can be fruitfully used to improve parallel complexity upper bounds on isomorphism testing for several families of…

Data Structures and Algorithms · Computer Science 2025-09-09 Joshua A. Grochow , Michael Levet

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

Data Structures and Algorithms · Computer Science 2019-10-29 Giannis Nikolentzos , Michalis Vazirgiannis