English
Related papers

Related papers: Explicit Approximations to Class Field Towers

200 papers

The category $\bcalNT$ was defined in \cite{Lobos2}, it is a category whose objects are commutative nil graded algebras over a field, defined by presentation encoded by triangular matrices. A natural problem related to this category is to…

Commutative Algebra · Mathematics 2025-12-19 Diego Lobos

Let $F$ be an irreducible binary form attached to a number field $K$ of degree $\geq 3$. Let $\epsilon\not\in \{-1, 1\}$ be a totally real unit of $K$. By twisting $F$ with the powers $\epsilon^a$ of $\epsilon$, ($a\in{\mathbf Z}$), we…

Number Theory · Mathematics 2015-05-26 Claude Levesque , Michel Waldschmidt

We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…

Number Theory · Mathematics 2011-01-18 Edinah K. Gnang

In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$…

Number Theory · Mathematics 2024-07-17 Jaroslav Hančl , Tho Phuoc Nguyen

A set of algebraic numbers has the Northcott property if each of its subsets of bounded Weil height is finite. Northcott's Theorem, which has many Diophantine applications, states that sets of bounded degree have the Northcott property.…

Number Theory · Mathematics 2012-05-14 Martin Widmer

Let us consider an algebraic function field defined over a finite Galois extension $K$ of a perfect field $k$. We give some conditions allowing the descent of the definition field of the algebraic function field from $K$ to $k$. We apply…

Number Theory · Mathematics 2007-05-23 Stephane Ballet , Dominique Le Brigand , Robert Rolland

We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with particular emphasis on the set D' comprised of differences between successive…

Logic · Mathematics 2025-04-16 Alfred Dolich , John Goodrick

In this paper we consider a tower of number fields $\cdots \supseteq K(1) \supseteq K(0) \supseteq K$ arising naturally from a continuous $p$-adic representation of $\mathrm{Gal}(\bar{\mathbb{Q}}/K)$, referred to as a $p$-adic Lie tower…

Number Theory · Mathematics 2018-01-10 James Upton

We look at a class of transcendental real numbers xi which, together with their square, satisfy some extremal property of simultaneous approximation by rational numbers with the same denominator. We give a sufficient condition for such a…

Number Theory · Mathematics 2013-01-07 Damien Roy

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Number Theory · Mathematics 2012-10-03 Ayah Almousa , Melanie Matchett Wood

In this work we construct sequences of locally recoverable AG codes arising from a tower of function fields and give bound for the parameters of the obtained codes. In a particular case of a tower over $\mathbb{F}_{q^2}$ for any odd $q$,…

Information Theory · Computer Science 2022-09-16 M. Chara , F. Galluccio , E. Martínez-Moro

There exists an absolute constant $\delta > 0$ such that for all $q$ and all subsets $A \subseteq \mathbb{F}_q$ of the finite field with $q$ elements, if $|A| > q^{2/3 - \delta}$, then \[ |(A-A)(A-A)| = |\{ (a -b) (c-d) : a,b,c,d \in A\}| >…

Combinatorics · Mathematics 2018-11-15 Brendan Murphy , Giorgis Petridis

Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…

Logic in Computer Science · Computer Science 2014-04-09 Jochen Burghardt

In 2021, Brock, Elkies, and Jordan generalized the theory of periodic continued fractions (PCFs) over $\mathbb{Z}$ to the ring of integers in a number field. In particular, they considered the case where the number field is an intermediate…

Number Theory · Mathematics 2025-04-15 Yoshinori Kanamura , Hyuga Yoshizaki

Let F be a number field and p be a prime. In the Successive Approximation Theorem, we prove that, for each positive integer n, finitely many candidates for the Galois group G(p,n,F) of the n-th stage F(p,n) of the p-class tower…

Number Theory · Mathematics 2017-10-13 Daniel C. Mayer

We consider natural polynomial truncations of hypergeometric power series defined over finite fields. For these truncations, we establish asymptotic upper bounds of order $O(p^{11/12})$ on the number of roots in the prime field…

Number Theory · Mathematics 2020-04-24 Amit Ghosh , Kenneth Ward

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…

Number Theory · Mathematics 2024-05-30 Jean-Marie De Koninck , William Verreault

Fix an irrational number $\theta$. For a real number $\tau >0$, consider the numbers $y$ satisfying that for all large number $Q$, there exists an integer $1\leq n\leq Q$, such that $\|n\theta-y\|<Q^{-\tau}$, where $\|\cdot\|$ is the…

Number Theory · Mathematics 2017-08-22 Dong Han Kim , Lingmin Liao

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

Combinatorics · Mathematics 2014-07-22 Amritanshu Prasad

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

Data Structures and Algorithms · Computer Science 2010-10-07 Ferdinando Cicalese , Ugo Vaccaro
‹ Prev 1 4 5 6 7 8 10 Next ›