Related papers: Counting bounded elements of a number field
We study the number of degree $n$ number fields with discriminant bounded by $X$. In this article, we improve an upper bound due to Schmidt on the number of such fields that was previously the best known upper bound for $6 \leq n \leq 94$.
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 establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…
This is the second in a pair of papers about residually reducible Galois deformation rings with non-optimal level. In the first paper, we proved a Galois-theoretic criterion for the deformation ring to be as small as possible. This paper…
We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…
Power counting is applied to relativistic mean-field energy functionals to estimate contributions to the energy from individual terms. New estimates for isovector, tensor, and gradient terms in finite nuclei are shown to be consistent with…
We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at most $s$ and clique number at most $k$ for all admissible values of the parameters.
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 this paper we derive an estimate on the number of local maxima of the free boundary of some variational inequalities with pointwise gradient constraints. This also gives an estimate on the number of connected components of the free…
The random networks enriched with additional structures as metric and group-symmetry in background metric space are investigated. The important quantities like he clustering coefficient as well as the mean degree of separation in such…
The continuum limit and scaling properties of an asymptotically free field theory regularized on a random lattice are compared with those on a regular square lattice. We work on random lattices parametrized by a degree of ``randomness''…
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…
We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and…
This paper is a survey of author's mathematical and logical study of the problem of quantization of fields.
We compute the minimal cardinality of a covering (resp. an irredundant covering) of a vector space over an arbitrary field by proper linear subspaces. Analogues for affine linear subspaces are also given.
We give upper and lower bounds on the Chevalley-Bass number of a field of characteristic zero, whenever this quantity is well-defined. We also describe an algorithm which computes the Chevalley-Bass number of a field, provided its maximal…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
In [3] L.Zapponi studied the arithmetic of plane bipartite trees with prime number of edges. He obtained a lower bound on the degree of tree's definition field. Here we obtain a similar lower bound in the following case. There exists a…
The theory of modular forms and spherical harmonic analysis are applied to establish new best bounds towards the counting and equidistribution of rational points on spheres and other higher dimensional ellipsoids, in what may be viewed as a…