Related papers: Computing quadratic function fields with high 3-ra…

We present a method for tabulating all cubic function fields over $\mathbb{F}_q(t)$ whose discriminant $D$ has either odd degree or even degree and the leading coefficient of $-3D$ is a non-square in $\mathbb{F}_{q}^*$, up to a given bound…

This paper contains an account of arbitrary cubic function fields of characteristic three. We define a standard form for an arbitrary cubic curve and consider its function field. By considering an integral basis for the maximal order of…

This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…

We produce an infinite family of imaginary quadratic fields whose ideal class groups have $3$-rank at least $2$.

One of the main themes in this thesis is the description of the signature of both the infinite place and the finite places in cubic function fields of any characteristic and quartic function fields of characteristic at least 5. For these…

The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…

We present an improved algorithm for tabulating class groups of imaginary quadratic fields of bounded discriminant. Our method uses classical class number formulas involving theta-series to compute the group orders unconditionally for all…

This paper presents fundamental algorithms for the computational theory of quadratic forms over number fields. In the first part of the paper, we present algorithms for checking if a given non-degenerate quadratic form over a fixed number…

We present computational results on the divisor class number and the regulator of a cubic function field over a large base field. The underlying method is based on approximations of the Euler product representation of the zeta function of…

We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…

We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…

This paper presents a high-order accurate numerical quadrature algorithm for evaluating integrals over curved surfaces and regions defined implicitly via a level set of a given function restricted to a hyperrectangle. The domain is divided…

Let $n\ge1$, $r\ge0$ and $s\ge0$ be integers satisfying $4+r+3 s\le3^{n+1}$. Given linear polynomials $f_{i}(x)=m_{i} x+n_{i}$ for $1 \le i \le r+s$, where the coefficients $m_{i} , n_{i}$ are positive integers satisfying certain…

We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…

We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…

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…

In this work we give an explicit solution to the problem of differentiation of hyperelliptic functions in genus $3$ case. It is a genus $3$ analogue of the result of F. G. Frobenius and L. Stickelberger. Our method is based on the series of…

Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant…

This paper presents a quadratic formula-based nonlinear representation for a given single-variable function f(x), $-1 \leq x \leq 1$. First, we construct the explicit polynomial coefficient functions a(x), b(x), and c(x) using a…

A high-order quadrature algorithm is presented for computing integrals over curved surfaces and volumes whose geometry is implicitly defined by the level sets of (one or more) multivariate polynomials. The algorithm recasts the implicitly…