Related papers: Exact Covering Systems in Number Fields

We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…

We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…

Let $K$ be an imaginary quadratic field. Modular forms for GL(2) over $K$ are known as Bianchi modular forms. Standard modularity conjectures assert that every weight 2 rational Bianchi newform has either an associated elliptic curve over…

After recalling the definition of Zilber fields, and the main conjecture behind them, we prove that Zilber fields of cardinality up to the continuum have involutions, i.e., automorphisms of order two analogous to complex conjugation on…

Introduced by Erd\H{o}s in 1950, a covering system of the integers is a finite collection of arithmetic progressions whose union is the set $\mathbb{Z}$. Many beautiful questions and conjectures about covering systems have been posed over…

We consider infinite parametric families of high degree number fields composed of quadratic fields with pure cubic, pure quartic, pure sextic fields and with the so called simplest cubic, simplest quartic fields. We explicitly describe an…

A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more…

This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$)…

We find sufficient conditions for the existence of an exact uniform modulus continuity for the class of $q$-isotropic Gaussian random fields introduced in [8]. We apply the result to a $d$-dimensional version of the $B^{\gamma}$ Gaussian…

We show that the shape of a complex cubic field lies on the geodesic of the modular surface defined by the field's trace-zero form. We also prove a general such statement for all orders in \'etale Q-algebras. Applying a method of Manjul…

If $X$ is a variety with an additional structure $\xi$, such as a marked point, a divisor, a polarization, a group structure and so forth, then it is possible to study whether the pair $(X,\xi)$ is defined over the field of moduli. There…

We show the finiteness of perfect powers in orbits of polynomial dynamical systems over an algebraic number field. We also obtain similar results for perfect powers represented by ratios of consecutive elements in orbits. Assuming the…

The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such…

The space of unitary local systems of rank one on the complement of an arbitrary divisor in a complex projective algebraic variety can be described in terms of parabolic line bundles. We show that multiplier ideals provide natural…

We show how to fill "countable" gaps in Hardy fields. We use this to prove that any two maximal Hardy fields are back-and-forth equivalent.

We sketch recent interactions between model theory and a roughly 150-year old study of analytic functions involving complex analysis, algebraic topology, and number theory, centered in canonicity of universal covers. Towards this goal we…

We prove that the number of natural exact covering systems of cardinality $k$ is equal to the coefficient of $x^k$ in the reversion of the power series $\sum_{k \ge 1} \mu (k) x^k$, where $\mu(k)$ is the usual number-theoretic M\"obius…

We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…

We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times. We show that…

Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given…