Related papers: Undecidability, unit groups, and some totally imag…

In this paper we prove that all irrational numbers from totally real cubic number fields are well approximable by rationals (i.e. the partial quotients in the continued fraction expansion of such a number are unbounded). This settles the…

We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the…

We show that the universal theory of torsion groups is strongly contained in the universal theory of finite groups. This answers a question of Dyson. We also prove that the universal theory of some natural classes of torsion groups is…

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…

We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in…

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

For each real quadratic field we constructively show the existence of infinitely many exceptional quartic number fields containing that quadratic field. On the other hand, another infinite collection of quartic exceptional fields without…

The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…

We prove a new polynomial refinement of the Capparelli's identities. Using a special case of Bailey's lemma we prove many infinite families of sum-product identities that root from our finite analogues of Capparelli's identities. We also…

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…

We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

We produce an explicit family of totally real cyclic quartic polynomials that are monogenic in many cases and, if the $abc$ conjecture holds, generate distinct monogenic quartic fields infinitely often. Additional families (also…

We show that elliptic curves whose Mordell-Weil groups are finitely generated over some infinite extensions of $\Q$, can be used to show the Diophantine undecidability of the rings of integers and bigger rings contained in some infinite…

We give a systematic method of providing numerical evidence for higher order Stark-type conjectures such as (in chronological order) Stark's conjecture over $\mathbb{Q}$, Rubin's conjecture, Popescu's conjecture, and a conjecture due to…

We study the extension of Presburger arithmetic by the class of sub-polynomial Hardy field functions, and show the majority of these extensions to be undecidable. More precisely, we show that the theory $\mathrm{Th}(\mathbb{Z}; <, +,…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…