Related papers: Computably Categorical Fields via Fermat's Last Th…
We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
We continue previous work to count non-equivalent dynamical systems over finite fields generated by polynomials or rational functions.
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…
In this paper we give a survey of recent methods for the asymptotic and exact enumeration of number fields with given Galois group of the Galois closure. In particular, the case of fields of degree up to 4 is now almost completely solved,…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
The main result of the present article is a proof of Fermat's Last Theorem for sufficiently large prime exponents $p$ with $p \equiv 2 \pmod{3}$ over certain number fields. A particular case of these fields are the maximal real subfields of…
In our work we give the examples using Fermat's Last Theorem for solving some problems from algebra, geometry and number theory
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
We prove the following theorems: Theorem 1: For any E-field with cyclic kernel, in particular $\mathbb C$ or the Zilber fields, all real abelian algebraic numbers are pointwise definable. Theorem 2: For the Zilber fields, the only pointwise…
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…
Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type…
A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…
We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…
In this note, we first discuss some properties of generated $\sigma$-fields and a simple approach to the construction of finite $\sigma$-fields. It is shown that the $\sigma$-field generated by a finite class of $\sigma$-distinct sets which…
We classify, up to equivalence, all finite-dimensional simple graded division algebras over the field of real numbers. The grading group is any finite abelian group.
In this article we prove lower and upper bounds for class numbers of algebraic curves defined over finite fields. These bounds turn out to be better than most of the previously known bounds obtained using combinatorics. The methods used in…