English
Related papers

Related papers: Counting bounded elements of a number field

200 papers

We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here,…

Number Theory · Mathematics 2023-08-25 Asaki Saito , Jun-ichi Tamura , Shin-ichi Yasutomi

Consistent coupling of effective field theories with a quantum theory of gravity appears to require bounds on the the rank of the gauge group and the amount of matter. We consider landscapes of field theories subject to such to boundedness…

High Energy Physics - Theory · Physics 2009-12-22 Vijay Balasubramanian , Jan de Boer , Asad Naqvi

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

Information Theory · Computer Science 2016-08-17 Daniel Salmond , Alex Grant , Ian Grivell , Terence Chan

Let $K$ be a number field of degree $d$. Then every ideal $I$ in the ring of integers ${\mathcal O}_K$ contains infinitely many primitive elements, i.e. elements of degree $d$. A bound on smallest height of such an element in $I$ follows…

Number Theory · Mathematics 2025-02-12 Lenny Fukshansky , Sehun Jeong

Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…

Logic in Computer Science · Computer Science 2026-03-31 Mirai Ikebuchi

We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…

Algebraic Geometry · Mathematics 2021-01-22 Hao Wen , Chunhui Liu

In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…

Number Theory · Mathematics 2008-02-03 Hendrik W. Lenstra

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

Combinatorics · Mathematics 2021-09-07 Zhicheng Gao , Simon Kuttner , Qiang Wang

Refining a constructive combinatorial method due to MacLane and Schilling, we give several criteria for a valued field that guarantee that all of its maximal immediate extensions have infinite transcendence degree. If the value group of the…

Commutative Algebra · Mathematics 2013-04-05 Anna Blaszczok , Franz-Viktor Kuhlmann

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

Group Theory · Mathematics 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

We prove that several results in different areas of number theory such as the divergent series, summation of arithmetic functions, uniform distribution modulo one and summation over prime numbers which are currently considered to be…

Number Theory · Mathematics 2011-03-30 Nilotpal Kanti Sinha , Marek Wolf

A slip on a paper concerning near-vector spaces is fixed. New characterization of near-vector spaces determined by finite fields is provided and the number (up to the isomorphism) of these spaces is exhibited.

Commutative Algebra · Mathematics 2016-12-12 Kijti Rodtes , Wilasinee Chomjun

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

Information Theory · Computer Science 2007-07-13 Beniamin Mounits , Tuvi Etzion , Simon Litsyn

We consider the problem of counting the number of rational points of bounded height in the zero-loci of Brauer group elements on semi-simple algebraic groups over number fields. We obtain asymptotic formulae for the counting problem for…

Number Theory · Mathematics 2018-10-09 Daniel Loughran , Ramin Takloo-Bighash , Sho Tanimoto

Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…

Information Theory · Computer Science 2025-02-19 Sascha Kurz

For a simple, normal and finite extension of a valued field, we prove that we can related the order of the ramification group of the field extension and the set of key polynomials associated to the extension of the valuation. More…

Algebraic Geometry · Mathematics 2016-02-29 Jean-Christophe San Saturnino

We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.

Theoretical Economics · Economics 2024-03-25 Alfio Giarlotta , Angelo Petralia , Stephen Watson

We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…

Number Theory · Mathematics 2014-08-05 David Krumm

We present an axiomatic approach to finite- and infinite-dimensional differential calculus over arbitrary infinite fields (and, more generally, suitable rings). The corresponding basic theory of manifolds and Lie groups is developed.…

General Mathematics · Mathematics 2007-05-23 Wolfgang Bertram , Helge Glockner , Karl-Hermann Neeb

Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…

Logic · Mathematics 2023-03-07 Mariana Floricica Calin , Cristina Flaut , Dana Piciu