Related papers: Improved bounds on number fields of small degree
For nonnegative integers $n$ and $d$, let $A(n,d)$ be the maximum cardinality of a binary code of length $n$ and minimum distance at least $d$. We consider a slight sharpening of the semidefinite programming bound of Gijswijt, Mittelmann…
Let $n (>3)$ be a prime number and $\Bbb F_{2^n}$ a finite field of $2^n$ elements. Let $L =\Bbb F_{2^n}\cup \{\infty\}$ be the support set and $g(x)$ an irreducible polynomial of degree $6$ over $\Bbb F_{2^n}$. In this paper, we obtain an…
An integral basis of the simplest number fields of degree 3,4 and 6 over $\mathbb{Q}$ are well-known, and widely investigated. We generalize the simplest number fields to any degree, and show that an integral basis of these fields is…
We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this…
We improve a result of H. L. Montgomery and J. P. Weinberger by establishing the existence of infinitely many fundamental discriminants $d>0$ for which the class number of the real quadratic field $\mathbb{Q}(\sqrt{d})$ exeeds…
The Hasse-Weil-Serre bound is improved for curves of low genera over finite fields with discriminant in {-3,-4,-7,-8,-11,-19} by studying optimal curves.
We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…
Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…
The classical Crossing Lemma by Ajtai et al.~and Leighton from 1982 gave an important lower bound of $c \frac{m^3}{n^2}$ for the number of crossings in any drawing of a given graph of $n$ vertices and $m$ edges. The original value was $c=…
We prove that, for any $\varepsilon>0$, the number of real quadratic fields $\mathbb{Q}(\sqrt{d})$ of discriminant $d<x$ whose class number is $\ll \sqrt{d}(\log{d})^{-2}(\log\log{d})^{-1}$ is at least $x^{1/2-\varepsilon}$ for $x$ large…
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…
In this paper, we shed new light on the spectrum of the relation algebra we call $A_{n}$, which is obtained by splitting the non-flexible diversity atom of $6_{7}$ into $n$ symmetric atoms. Precisely, we show that the minimum value in…
We consider cubic number fields ordered by their discriminants, and show that there exist arbitrarily long sequences that contain only fields with class numbers greater than a given bound.
In 2016 Astudillo, Diaz y Diaz and Friedman published sharp lower bounds for regulators of number fields of all signatures up to degree seven, except for fields of degree seven having five real places. We deal with this signature, proving…
We study the problem of bounding the least prime that does not split completely in a number field. This is a generalization of the classic problem of bounding the least quadratic non-residue. Here, we present two distinct approaches to this…
Upper bounds of the Hausdorff volume of scalar gradient field graphs are derived by means of geometric measure theory. The approach reproduces that scalar gradient fields along a mean imposed scalar gradient become space filling for…
We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices.…
We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…
This paper gives an improved sum-product estimate for subsets of a finite field whose order is not prime. It is shown, under certain conditions, that $$\max\{|A+A|,|A\cdot{A}|\}\gg{\frac{|A|^{12/11}}{(\log_2|A|)^{5/11}}}.$$ This new…
Codes over trees were introduced recently to bridge graph theory and coding theory with diverse applications in computer science and beyond. A central challenge lies in determining the maximum number of labelled trees over $n$ nodes with…