English
Related papers

Related papers: On the counting function of cubic function fields

200 papers

We construct several sequences of asymptotically optimal definite quadrature formulae of fourth order and evaluate their error constants. Besides the asymptotical optimality, an advantage of our quadrature formulae is the explicit form of…

Numerical Analysis · Mathematics 2016-05-10 Ana Avdzhieva , Geno Nikolov

We give an algorithm to compute a one-dimensional shape-constrained function that best fits given data in weighted-$L_{\infty}$ norm. We give a single algorithm that works for a variety of commonly studied shape constraints including…

Data Structures and Algorithms · Computer Science 2019-05-30 David Durfee , Yu Gao , Anup B. Rao , Sebastian Wild

Let $F$ be a non-degenerate quadratic form on an $n$-dimensional vector space $V$ over the rational numbers. One is interested in counting the number of zeros of the quadratic form whose coordinates are restricted in a smoothed box of size…

Number Theory · Mathematics 2019-11-01 Thomas Huong Tran

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

Combinatorics · Mathematics 2026-01-05 Robert Coulter , Steven Senger

In this paper we find a new lower bound on the number of imaginary quadratic extensions of the function field $\mathbb{F}_{q}(x)$ whose class groups have elements of a fixed odd order. More precisely, for $q$, a power of an odd prime, and…

Number Theory · Mathematics 2011-02-21 Pradipto Banerjee , Srinivas Kotyada

We derive an asymptotic formula which counts the number of abelian extensions of prime degrees over rational function fields. Specifically, let $\ell$ be a rational prime and $K$ a rational function field $\Bbb F_q(t)$ with $\ell \nmid q$.…

Number Theory · Mathematics 2015-09-07 Chih-Yun Chuang , Yen-Liang Kuan

The $ \beta $-functions of marginal couplings are known to be closely related to the $ A $-function through Osborn's equation, derived using the local renormalization group. It is possible to derive strong constraints on the…

High Energy Physics - Theory · Physics 2019-10-02 Colin Poole , Anders Eller Thomsen

Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…

Number Theory · Mathematics 2011-04-21 Andreas Philipp

Two approximations of the integral of a class of sinusoidal composite functions, for which an explicit form does not exist, are derived. Numerical experiments show that the proposed approximations yield an error that does not depend on the…

Numerical Analysis · Mathematics 2024-01-17 Alberto Costa

We show how the Selberg $\Lambda^2$-sieve can be used to obtain power saving error terms in a wide class of counting problems which are tackled using geometry of numbers. Specifically, we give such an error term for the counting function of…

Number Theory · Mathematics 2013-10-10 Arul Shankar , Jacob Tsimerman

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

Analogues of the prime number theorem and Merten's theorem are well-known for dynamical systems with hyperbolic behaviour. In this paper a 3-adic extension of the circle doubling map is studied. The map has a 3-adic eigendirection in which…

Dynamical Systems · Mathematics 2007-05-23 G. Everest , V. Stangoe , T. Ward

We study the logarithm of the least common multiple of the sequence of integers given by $1^2+1, 2^2+1,..., n^2+1$. Using a result of Homma on the distribution of roots of quadratic polynomials modulo primes we calculate the error term for…

Number Theory · Mathematics 2011-10-12 Juanjo Rué , Paulius Šarka , Ana Zumalacárregui

We obtain the ratio of semiclassical partition functions for the extension under mixed flux of the minimal surfaces subtending a circumference and a line in Euclidean $AdS_{3}\times S^{3}\times T^{4}$. We reduce the problem to the…

High Energy Physics - Theory · Physics 2020-03-11 Rafael Hernandez , Juan Miguel Nieto , Roberto Ruiz

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

Combinatorics · Mathematics 2014-03-04 Zipei Nie , Anthony Y. Wang

We use the circle method to count $\mathbb{F}_q(t)$-rational points of bounded naive height on a quadric hypersurface $X\subseteq \mathbb{P}^{n-1}$ defined over $\mathbb{F}_q$, provided that $\mathrm{char}(\mathbb{F}_q)>2$ and $n\ge 3$.…

Number Theory · Mathematics 2026-04-03 Johanna Mettasch

We obtain new complexity bounds for computing a triangular integral basis of a number field or a function field. We reach for function fields a softly linear cost with respect to the size of the output when the residual characteristic is…

Number Theory · Mathematics 2024-05-24 Adrien Poteaux , Martin Weimann

Andrade and Keating computed the mean value of quadratic Dirichlet $L$--functions at the critical point, in the hyperelliptic ensemble over a fixed finite field $\mathbb{F}_q$. Summing $L(1/2,\chi_D)$ over monic, square-free polynomials $D$…

Number Theory · Mathematics 2015-05-13 Alexandra Florea

We improve known estimates for the number of points of bounded height in semigroup orbits of polarized dynamical systems. In particular, we give exact asymptotics for generic semigroups acting on the projective line. The main new ingredient…

Number Theory · Mathematics 2024-12-04 Jason P. Bell , Wade Hindes , Xiao Zhong

We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…

Data Structures and Algorithms · Computer Science 2018-07-23 Eric Bach , Bryce Sandlund
‹ Prev 1 4 5 6 7 8 10 Next ›