Related papers: Generators of Arithmetic Quaternion Groups and a D…

Let $p$ be a prime and $a$ a quadratic non-residue $\bmod p$. Then the set of integral solutions of the diophantine equation $x_0^2 - ax_1^2 -px_2^2 + apx_3^2=1$ form a cocompact discrete subgroup $\Gamma_{p,a}\subset SL(2,\mathbb{R})$ and…

A classical result about unit equations says that if $\Gamma_1$ and $\Gamma_2$ are finitely generated subgroups of $\mathbb C^\times$, then the equation $x+y=1$ has only finitely many solutions with $x\in\Gamma_1$ and $y\in \Gamma_2$. We…

In this paper we study the Diophantine equation $x^{4}-q^{4}=py^{5},$ with the following conditions: $p$ and $q$ are different prime natural numbers, $y$ is not divisible with $p$, $p\equiv3$ (mod20), $q\equiv4$ (mod5), $\overline{p}$ is a…

We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…

In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…

We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…

We propose a class of generating functions denoted by $\textrm{RGF}_p(x)$, which is related to the Sylvester denumerant for the quotients of numerical semigroups. Using MacMahon's partition analysis, we can obtain $\textrm{RGF}_p(x)$ by…

For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…

We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots,…

In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued…

This work introduces a new kind of semigroup of $\N^p$ called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical…

In the study of Fuchsian groups, it is a nontrivial problem to determine a set of generators. Using a dynamical approach we construct for any cocompact arithmetic Fuchsian group a fundamental region in $\mathbf{SL}_2(\mathbb{R})$ from which…

Let $p$ be an odd prime and $G$ be a nonabelian group of order $p^{n}$ with the presentation $$<\alpha,\beta,\gamma\mid \alpha^{p^{a}}=\beta^{p^{b}}=\gamma^{p^{c}}=1,…

A square complex is a 2-complex formed by gluing squares together. This article is concerned with the fundamental group $\Gamma$ of certain square complexes of nonpositive curvature, related to quaternion algebras. The abelian subgroup…

Let $x$, $y$ be two integral quaternions of norm $p$ and $l$, respectively, where $p$, $l$ are distinct odd prime numbers. We investigate the structure of $<x,y>$, the multiplicative group generated by $x$ and $y$. Under a certain condition…

Equivalence classes of solutions of the Diophantine equation $a^2+mb^2=c^2$ form an infinitely generated abelian group $G_m$, where $m$ is a fixed square-free positive integer. Solutions of Pell's equation $x^2-my^2=1$ generate a subgroup…

We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…

Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…