Related papers: Computably Categorical Fields via Fermat's Last Th…

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

In our work we give the examples using Fermat's Last Theorem for solving some problems from algebra and number theory.

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

We prove upper bounds on the number of rational points on transcendental curves in arbitrary $1$-h-minimal fields, similar to the Pila--Wilkie counting theorem in the o-minimal setting. These results extend results due to…

This is the first in a series of papers laying the foundations for a differential graded approach to derived differential geometry (and other geometries in characteristic zero). In this paper, we study theories of supercommutative algebras…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

Recent work of Freitas and Siksek showed that an asymptotic version of Fermat's Last Theorem holds for many totally real fields. Later this result was extended by Deconinck to generalized Fermat equations of the form $Ax^p +By^p +Cz^p = 0$,…

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

In this paper we obtain bounds for integer solutions of quadratic polynomials in two variables that represent a natural number. Also we get some results on twin prime numbers. In addition, we use linear functionals to prove some results of…

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a sum, product and quotient of some series of positive rational…

We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…

We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field…

We study infinite groups interpretable in three families of valued fields: $V$-minimal, power bounded $T$-convex, and $p$-adically closed fields. We show that every such group $G$ has unbounded exponent and that if $G$ is dp-minimal then it…