Related papers: Genus computation of global function fields

We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…

We present an algorithm that unconditionally computes a representation of the unit group of a number field of discriminant $\Delta_K$, given a full-rank subgroup as input, in asymptotically fewer bit operations than the baby-step giant-step…

We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…

It is a well known result that the number of points over a finite field on the Legendre family of elliptic curves can be written in terms of a hypergeometric function modulo $p$. In this paper, we extend this result, due to Igusa, to a…

Let K be a complete discretely valued field with residue field k and F be a function field of a curve over K. Let L/F be a Galois extension of degree n. If n is coprime to char(k), then under some assumptions on k(e.g. k is algebraically…

For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{\omega/2 + \epsilon})$ operations, for any $\epsilon > 0$. Here, $\omega$ is the exponent…

For a finite field $\mathbb{F}$, it is a basic result of Galois theory that the fixed field $E$ of $\text{Aut}(\mathbb{F}(x)/\mathbb{F})$ is a proper extension of $\mathbb{F}$. In this expository paper we construct, for all finite fields,…

It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…

The necessity to find the global optimum of multiextremal functions arises in many applied problems where finding local solutions is insufficient. One of the desirable properties of global optimization methods is \emph{strong homogeneity}…

An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and…

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…

Let $K/k$ be a finite extension of a global field. Such an extension can be generated over $k$ by a single element. The aim of this article is to prove the existence of a "small" generator in the function field case. This answers the…

We prove finiteness results on integral points on complements of large divisors in projective varieties over finitely generated fields of characteristic zero. To do so, we prove a function field analogue of arithmetic finiteness results of…

We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an equivariant extension known as '$\Gamma$-species' which incorporates data about 'structural' group actions). This culminates…

We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…

We prove the finiteness of the genus of finite-dimensional division algebras over many infinitely generated fields. More precisely, let $K$ be a finite field extension of a field which is a purely transcendental extension of infinite…

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

Given a graphical model (GM), computing its partition function is the most essential inference task, but it is computationally intractable in general. To address the issue, iterative approximation algorithms exploring certain local…

We present a branch and bound method for maximizing an arbitrary set function h mapping 2^V to R. By decomposing h as f-g, where f is a submodular function and g is the cut function of a (simple, undirected) graph G with vertex set V, our…

The main purpose of this paper is to describe the abelian part $\mathcal G^{ab}_{K}$ of the absolute Galois group of a global function field $K$ as pro-finite group. We will show that the characteristic $p$ of $K$ and the non $p$-part of…