English
Related papers

Related papers: Algorithms for twisted conjugacy classes of polycy…

200 papers

For a finite central extension $\tilde{G}$ of a classical $p$-adic reductive group, we consider the endomorphism algebra of some induced projective generator \`a la Bernstein of the category of smooth representations of $\tilde{G}$. In the…

Representation Theory · Mathematics 2025-08-07 Volker Heiermann , Chenyan Wu

In this paper we present the construction of explicit quasi-isomorphisms that compute the cyclic homology and periodic cyclic homology of crossed-product algebras associated with (discrete) group actions. In the first part we deal with…

K-Theory and Homology · Mathematics 2017-09-26 Raphael Ponge

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

Computational Complexity · Computer Science 2015-11-17 Anthony Widjaja Lin , Sanming Zhou

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

Group Theory · Mathematics 2024-12-25 Koichi Oyakawa

A Kronecker coefficient is the multiplicity of an irreducible representation of a finite group $G$ in a tensor product of irreducible representations. We define Kronecker Hecke algebras and use them as a tool to study Kronecker coefficients…

Representation Theory · Mathematics 2025-10-07 Jyotirmoy Ganguly , Digjoy Paul , Amritanshu Prasad , K N Raghavan , Velmurugan S

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

Group Theory · Mathematics 2023-05-04 Louis Mallet-Burgues

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

Group Theory · Mathematics 2019-04-09 Marius Tărnăuceanu

We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…

Group Theory · Mathematics 2013-03-25 O. Kharlampovich , A. Myasnikov , M. Sapir

This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.

Geometric Topology · Mathematics 2022-03-07 A. N. Bartholomew , M. J. Dunwoody

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

Combinatorics · Mathematics 2020-01-16 Rémi Bottinelli , Laura Grave de Peralta , Alexander Kolpakov

We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…

Group Theory · Mathematics 2014-01-14 Moon Duchin , Hao Liang , Michael Shapiro

We provide a new combinatorial approach to studying the collection of N-infinity-operads in G-equivariant homotopy theory for G a finite cyclic group. In particular, we show that for G the cyclic group of order p^n the natural order on the…

Algebraic Topology · Mathematics 2022-01-19 Scott Balchin , David Barnes , Constanze Roitzheim

The purpose of the present paper is to discuss the following conjecture of Fel'shtyn and Hill, which is a generalization of the classical Burnside theorem: Let G be a countable discrete group, f its automorphism, R(f) the number of…

Representation Theory · Mathematics 2016-09-07 Alexander Fel'shtyn , Evgenij Troitsky , Anatoly Vershik

In this paper, we consider the conjugacy growth function of a group, which counts the number of conjugacy classes which intersect a ball of radius $n$ centered at the identity. We prove that in the case of virtually polycyclic groups, this…

Group Theory · Mathematics 2010-06-08 M. Hull

We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…

Group Theory · Mathematics 2020-02-03 Ann Kiefer

We classify finite-dimensional Nichols algebras over finite nilpotent groups of odd order in group-theoretical terms. The main step is to show that the conjugacy classes of such finite groups are either abelian or of type C; this property…

Quantum Algebra · Mathematics 2021-04-13 Nicolás Andruskiewitsch

We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…

Group Theory · Mathematics 2019-05-15 A. S. Detinko , D. L. Flannery , E. A. O'Brien

We prove that finite groups have the same complex character tables iff the group algebras are twisted forms of each other as Drinfel'd quasi-bialgebras or iff there is non-associative bi-Galois algebra over these groups. The interpretations…

Representation Theory · Mathematics 2007-05-23 A. Davydov

We extend the class of abelian groups for which a conjecture of Asai and Yoshida on the number of crossed homomorphisms holds. We also prove a general result which connects certain problems concerning divisibility in groups to the…

Group Theory · Mathematics 2026-04-02 Alexander V. Khudyakov

We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…

Group Theory · Mathematics 2021-09-13 Marco Linton