Related papers: Genus computation of global function fields

Let $\epsilon>0$. In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve $C$ of genus $g$ over a finite field $k$ of cardinality $q$ given by $y^2+h(x)y=f(x)$ such that the…

These notes form part of a joint research project on the logic of fields with many valuations, connected by a product formula. We define such structures and name them {\em globally valued fields} (GVFs). This text aims primarily at a proof…

The paper presents some results for reducing the computation of the M\"obius functon of a M\"obius category that arises from a combinatorial inverse semigroup to that of locally finite partially ordered sets. We illustrate the computation…

Let $k \geq 1$ be a natural number and $f \in \mathbb{F}_q[t]$ be a monic polynomial. Let $\omega_k(f)$ denote the number of distinct monic irreducible factors of $f$ with multiplicity $k$. We obtain asymptotic estimates for the first and…

A novel very simple method for finding roots of polynomials over finite fields has been proposed. The essence of the proposed method is to search the roots via nested cycles over the subgroups of the multiplicative group of the Galois…

We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…

If k is a commutative field and G a reductive (connected) algebraic group over k, we give bounds for the orders of the finite subgroups of G(k); these bounds depends on the type of G and on the Galois groups of the cyclotomic extensions of…

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…

In this paper we study genus 2 function fields K with degree 3 elliptic subfields. We show that the number of Aut(K)-classes of such subfields of K is 0,1,2, or 4. Also we compute an equation for the locus of such K in the moduli space of…

Let G be the space of generating functions of a periodic infinite order linear recurrence. In this paper we provide an explicit procedure for computing a basis of G.

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…

We obtain formulae giving global dimensions for fusion categories defined by Lie groups G at level k and for the associated module-categories obtained via conformal embeddings. The results can be expressed in terms of Lie quantum…

The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…

We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing…

Starting from PN functions, we introduce the concept of $k$-PN functions and classify $k$-PN monomials over finite fields of order $p, p^2$ and $p^4$ for small values of $k$.

Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…

We consider families of sparse Laurent polynomials f_1,...,f_n with a finite set of common zeroes Z_f in the complex algebraic n-torus. The global residue assigns to every Laurent polynomial g the sum of its Grothendieck residues over the…

We establish that all rings of $S$-integers are universally definable in function fields in one variable over certain ground fields including global and non-archimedean local fields. That is, we show that the complement of such a ring of…