English
Related papers

Related papers: Algorithmic recognition of infinite cyclic extensi…

200 papers

We show that for non-conjugate subgroups $G_1$ and $G_2$ of a finite group $G$ there exists an extension of $G$ (by a finite group) in which the pre-images of $G_1$ and $G_2$ are not isomorphic. This allows us to show that $\mathbb Z$-coset…

Group Theory · Mathematics 2026-05-06 Ido Karshon , Alexander Lubotzky , D. B. McReynolds , Alan W. Reid , Mark Shusterman

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

We classify polynomial models for real hypersurfaces in $\mathbb C^N$, which admit nonlinearizable infinitesimal CR automorphisms. As a consequence, this provides an optimal 1-jet determination result in the general case. Further we prove…

Complex Variables · Mathematics 2020-04-29 Martin Kolář , Francine Meylan

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 prove that every finitely-generated right-angled Artin group can be embedded into some Brin-Thompson group $nV$. It follows that many other groups can be embedded into some $nV$ (e.g., any finite extension of any of Haglund and Wise's…

Group Theory · Mathematics 2016-03-01 James Belk , Collin Bleak , Francesco Matucci

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Group Theory · Mathematics 2026-03-30 Alexey Talambutsa

We introduce the class of synchronous subsequential relations, a subclass of the synchronous relations which embodies some properties of subsequential relations. If we take relations of this class as forming the possible transitions of an…

Formal Languages and Automata Theory · Computer Science 2015-09-25 Christian Wurm

We discuss the possibility of lifting finite subgroups, and in particular finite cyclic subgroups, with respect to the canonical projections between automorphism and outer automorphism groups of free groups, surface groups and their…

Geometric Topology · Mathematics 2007-05-23 Bruno P. Zimmermann

Assume $G$ is a polycyclic group and $\phi:G\to G$ an endomorphism. Let $G\ast_{\phi}$ be the ascending HNN extension of $G$ with respect to $\phi$; that is, $G\ast_{\phi}$ is given by the presentation $$G\ast_{\phi}= < G, t \ |\ t^{-1}gt =…

Group Theory · Mathematics 2010-11-05 Karl Lorensen

We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…

Logic in Computer Science · Computer Science 2019-07-01 Daniel Danielski , Emanuel Kieronski

We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…

Group Theory · Mathematics 2019-09-23 S. P. Glasby , Cheryl E. Praeger , Colva M. Roney-Dougal

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

Group Theory · Mathematics 2007-05-23 Martin R. Bridson

The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…

Logic in Computer Science · Computer Science 2016-04-19 Tomer Kotek , Helmut Veith , Florian Zuleger

Many results in extremal graph theory can be formulated as certain polynomial inequalities in graph homomorphism densities. Answering fundamental questions raised by Lov{\'a}sz, Szegedy and Razborov, Hatami and Norine proved that…

Combinatorics · Mathematics 2025-05-13 Yaqiao Li

We investigate the conditions for a finite abelian group $G$ under which any cyclic subgroup $H$ and any group homomorphism $f \in \operatorname{Hom}(H,G)$ can be extended to an endomorphism $F \in \operatorname{End}(G)$. As a result, we…

Group Theory · Mathematics 2025-01-08 Yusuke Fujiyoshi

By a recent result of Livingston, it is known that if a knot has a prime power branched cyclic cover that is not a homology sphere, then there is an infinite family of non-concordant knots having the same Seifert form as the knot. In this…

Geometric Topology · Mathematics 2007-05-23 Taehee Kim

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

Group Theory · Mathematics 2019-04-26 Nathalie Aubrun , Sebastián Barbieri , Mathieu Sablik

We revisit the membership problem for subclasses of rational relations over finite and infinite words: Given a relation R in a class C_2, does R belong to a smaller class C_1? The subclasses of rational relations that we consider are formed…

Formal Languages and Automata Theory · Computer Science 2023-04-27 Pascal Bergsträßer , Moses Ganardi

We continue classification of finite groups which can be used as symmetry group of the scalar sector of the four-Higgs-doublet model (4HDM). Our objective is to systematically construct non-abelian groups via the group extension procedure,…

High Energy Physics - Phenomenology · Physics 2024-09-11 Jiazhen Shao , Igor P. Ivanov , Mikko Korhonen

We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…

Group Theory · Mathematics 2011-09-12 Charles F. Rocca
‹ Prev 1 8 9 10 Next ›