Related papers: Diophantine problems over $\mathbb{Z}^{ab}$ modulo…

Let $A=\mathbb{F}_q[T]$ be the polynomial ring over $\mathbb{F}_q$, and $F$ be the field of fractions of $A$. Let $\phi$ be a Drinfeld $A$-module of rank $r\geq 2$ over $F$. For all but finitely many primes $\mathfrak{p}\lhd A$, one can…

We develop a method of reducing the size of quantum minors in the algebra of n x n quantum matrices. The method is used to show that quantum determinantal factor rings of n x n quantum matrices over the complex numbers are maximal orders,…

In this paper we study the behaviour of modules over finite dimensional algebras whose endomorphism algebra is a division ring. We show that there are finitely many such modules in the module category of an algebra if and only if the length…

We introduce a general constructive method to find a p-basis (and the Ulm invariants) of a finite Abelian p-group M. This algorithm is based on Groebner bases theory. We apply this method to determine the additive structure of…

Assuming the Generalized Riemann Hypothesis, we prove the following: If b is an integer greater than one, then the multiplicative order of b modulo N is larger than N^(1-\epsilon) for all N in a density one subset of the integers. If A is a…

Let d>2 and let p be a prime coprime to d. Let Z_pbar be the ring of integers of Q_pbar. Suppose f(x) is a degree-d polynomial over Qbar and Z_pbar. Let P be a prime ideal over p in the ring of integers of Q(f), where Q(f) is the number…

Let $m$ be a fixed square-free positive integer, then equivalence classes of solutions of Diophantine equation $x^2+m\cdot y^2=z^2$ form an infinitely generated abelian group under the operation induced by the complex multiplication. A…

We are motivated by a result of Alzer and Luca who presented all the integer solutions to the relations $(k!)^n-k^n=(n!)^k-n^k$ and $(k!)^n+k^n=(n!)^k+n^k$. We modify the equations by considering the double factorial instead and present all…

In this note, we use integral binary cubic forms to study the rational cube sum problem. We prove (unconditionally) that for any positive integer $d$, infinitely many primes in each of the residue classes $ 1 \pmod {9d}$ as well as $ -1…

We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…

We present an algebraic structure in modules over integer rings with cardinality prime powers, which allows to define bases. With such structure, we prove a similar version for the basis extension theorem of linear algebra over fields.…

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

We generalize the existence of maximal orders in a semi-simple algebra for general ground rings. We also improve several statements in Chapter 5 and 6 of Reiner's book concerning separable algebras by removing the separability condition,…

For a given irrational number, we consider the properties of best rational approximations of given parities. There are three different kinds of rational numbers according to the parity of the numerator and denominator, say odd/odd, even/odd…

Recently, M. Kompatscher proved that for each finite supernilpotent algebra $\mathbf{A}$ in a congruence modular variety, there is a polynomial time algorithm to solve polynomial equations over this algebra. Let $\mu$ be the maximal arity…

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

We consider first-order definability and decidability questions over rings of integers of algebraic extensions of $\Q$, paying attention to the uniformity of definitions. The uniformity follows from the simplicity of our first-order…

We study the general problem of extremality for metric Diophantine approximation on submanifolds of matrices. We formulate a criterion for extremality in terms of a certain family of algebraic obstructions and show that it is sharp. In…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…