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

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…

We provide a characterisation of differentially large fields in arbitrary characteristic and a single derivation in the spirit of Blum axioms for differentially closed fields. In the case of characteristic zero, we use these axioms to…

Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…

Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…

We complete the description of group gradings on finite-dimensional incidence algebras. Moreover, we classify the finite-dimensional graded algebras that can be realized as incidence algebras endowed with a group grading.

We construct an infinite family of imaginary quadratic number fields with 2-class groups of type (2,2,2) whose Hilbert 2-class fields are finite.

The first part is expository: it explains how finite fields may be used to prove theorems on infinite fields by a reduction mod p process. The second part gives a variant of P.Smith's fixed point theorem which applies in any characteristic.

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

We consider random fields that can be represented as integrals of deterministic functions with respect to infinitely divisible random measures and show that these random fields are infinitely divisible.

Let ${\mathbb F}_q$ be a finite field of characteristic two and ${\mathbb F}_q(X_1,...,X_n)$ a rational function field. We use matrix methods to obtain explicit transcendental bases of the invariant subfields of orthogonal groups and…

We prove an asymptotic formula for class numbers of totlally imaginary quartic number fields, ie for number fields of degree 4 over Q with only complex embeddings. After previous work for real quadratic fields (Sarnak) and complex cubic…

We classify the algebraic combinatorial geometries of arbitrary field extensions of transcendence degree greater than 4 and describe their groups of automorphisms. Our results and proofs extend similar results and proofs by Evans and…

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

We consider the issue of computability at the most fundamental level of physical reality: the Planck scale. To this aim, we consider the theoretical model of a quantum computer on a non commutative space background, which is a computational…

We prove that generating subspaces of matrix rings over finite fields are counted by polynomials. We use this result to define and study two-variable versions of polynomials counting isomorphism classes of absolutely irreducible…

We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.