English
Related papers

Related papers: On the Diophantine problem in some one-relator gro…

200 papers

We address the type I dichotomy for two-step nilpotent locally compact groups. Invoking work of Baggett-Kleppner, we characterize the closed points of the unitary dual of such a group $G$ purely in terms of the group structure. An algebraic…

Representation Theory · Mathematics 2025-10-01 Pierre-Emmanuel Caprace , Max Carter

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…

Group Theory · Mathematics 2014-02-26 Silvio Dolfi , Robert Guralnick , Marcel Herzog , Cheryl Praeger

How to find "best rational approximations" of maximal commutative subgroups of GL(n,R)? In this paper we pose and make first steps in the study of this problem. It contains both classical problems of Diophantine and simultaneous…

Number Theory · Mathematics 2009-10-20 O. Karpenkov , A. Vershik

In this paper, we explore several threads arising from our recent joint work on arithmetic holonomy bounds, which were originally devised to prove new irrationality results based on the method of Ap\'ery limits. We propose a new method to…

Number Theory · Mathematics 2025-10-07 Frank Calegari , Vesselin Dimitrov , Yunqing Tang

Let G be a finite group. By Riemann's Existence Theorem, braid orbits of generating systems of G with product 1 correspond to irreducible families of covers of the Riemann sphere with monodromy group G. Thus many problems on algebraic…

Group Theory · Mathematics 2007-05-23 K. Magaard , S. Shpectorov , Helmut Voelklein

A relative one-relator presentation has the form P = < X,H ; R > where X is a set, H is a group, and R is a group word on X and H. We show that if the group word on X obtained from R by deleting all the terms from H has what we call the…

Group Theory · Mathematics 2007-06-25 Stephen J Pride

We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…

Group Theory · Mathematics 2018-01-03 Sergei V. Ivanov

We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…

Discrete Mathematics · Computer Science 2025-09-19 Paul C. Bell , Reino Niskanen , Igor Potapov , Pavel Semukhin

We prove a dichotomy for $D$-rank 1 types in simple theories that generalizes Buechler's dichotomy for $D$-rank 1 minimal types in stable theories: every $D$-rank 1 type is either 1-based or part of its algebraic closure, defined by a…

Logic · Mathematics 2019-09-20 Ziv Shami

A finitely generated subgroup {\Gamma} of a real Lie group G is said to be Diophantine if there is \beta > 0 such that non-trivial elements in the word ball B_\Gamma(n) centered at the identity never approach the identity of G closer than…

Group Theory · Mathematics 2015-06-24 Menny Aka , Emmanuel Breuillard , Lior Rosenzweig , Nicolas de Saxcé

In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…

Number Theory · Mathematics 2022-04-27 L. Hajdu , R. Tijdeman

We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given…

Geometric Topology · Mathematics 2014-11-11 Ilya Kapovich , Richard Weidmann

The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…

Logic in Computer Science · Computer Science 2024-12-31 Umang Mathur , David Mestel , Mahesh Viswanathan

The Riemann hierarchy is the simplest example of rank one, ($1$+$1$)-dimensional integrable system of nonlinear evolutionary PDEs. It corresponds to the dispersionless limit of the Korteweg-de Vries hierarchy. In the language of formal…

Mathematical Physics · Physics 2025-10-10 Alexandr Buryak , Paolo Rossi

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

Group Theory · Mathematics 2008-07-21 Francesco Matucci

For any complex reductive group $G$ and any compact Riemann surface with genus $g>0$, we show that every connected component of the associated character variety is $\mathbb{Q}$-factorial and has symplectic singularities, and classify the…

Algebraic Geometry · Mathematics 2025-12-08 Cheng Shu

We introduce and study a family of groups $\mathbf{BB}_n$, called the blocked-braid groups, which are quotients of Artin's braid groups $\mathbf{B}_n$, and have the corresponding symmetric groups $\Sigma_n$ as quotients. They are defined by…

Category Theory · Mathematics 2013-07-23 D. Maglia , N. Sabadini , R. F. C. Walters

Exploring Bass' Triangulability Problem on unipotent algebraic subgroups of the affine Cremona groups, we prove a triangulability criterion, the existence of nontriangulable connected solvable affine algebraic subgroups of the Cremona…

Algebraic Geometry · Mathematics 2015-10-16 Vladimir L. Popov

Let $\alpha$ be a fixed quadratic irrational. Consider the Diophantine equation \[ y^a\ =\ q_{N_1} + \cdots + q_{N_K},\quad N_1 \geq \cdots \geq N_{K} \geq 0,\quad a, y \geq 2 \] where $(q_N)_{N\,\geq\,0}$ is the sequence of convergent…

Number Theory · Mathematics 2026-04-14 Divyum Sharma , L. Singhal

We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup generated by a given set of generators. In particular we consider the identity problem for the special linear group following recent…

Discrete Mathematics · Computer Science 2018-05-10 Sang-Ki Ko , Reino Niskanen , Igor Potapov