Related papers: Explicit genus formula for any separable cubic glo…
Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…
It is shown that the extension of $\R$ by a generic smooth function restricted to the unit cube is o-minimal. The generalization to countably many generic smooth functions is indicated. Possible applications are sketched.
We propose a generalization of separability in the context of global optimization. Our results apply to objective functions implemented as differentiable computer programs. They are presented in the context of a simple branch and bound…
In this paper, we study simple cubic fields in the function field setting, and also generalize the notion of a set of exceptional units to cubic function fields, namely the notion of $k$-exceptional units. We give a simple proof that the…
The genus spectrum of a finite group $G$ is the set of all $g$ such that $G$ acts faithfully on a compact Riemann surface of genus $g$. It is an open problem to find a general description of the genus spectrum of the groups in interesting…
In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of…
We provide an algorithm which decides whether a polynomial foliation $\mathcal{F}^{\mathbb{C}^2}$ on the complex plane has a polynomial first integral of genus $g\neq 1$. Except in a specific case, an extension of the algorithm also decides…
In this paper we introduce elementary and completely explicit formulas for the derivative of any order of any function of the type 1/p, where p is a polynomial with known zeros.
Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…
In addition to rather complicated general methods it is interesting and valuable to develop fast efficient methods for calculating generators of power integral bases in special types of number fields. We consider sextic fields containing a…
Every finite subunital of any generalized hermitian unital is itself a hermitian unital; the embedding is given by an embedding of quadratic field extensions. In particular, a generalized hermitian unital with a finite subunital is a…
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…
We give a construction of the genus field for Kummer $\ell^n$-cyclic extensions of rational congruence function fields, where $\ell$ is a prime number. First, we compute the genus field of a field contained in a cyclotomic function field,…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
For various nonsolvable groups $G$, we prove the existence of extensions of the rationals $\mathbb{Q}$ with Galois group $G$ and inertia groups of order dividing $ge(G)$, where $ge(G)$ is the smallest exponent of a generating set for $G$.…
Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, one can try to determine them by using class field theory. For this, it is…
We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
Recall that a group $G$ has finitely satisfiable generics ($fsg$) or definable $f$-generics ($dfg$) if there is a global type $p$ on $G$ and a small model $M_0$ such that every left translate of $p$ is finitely satisfiable in $M_0$ or…
Lusztig's algorithm of computing generalized Green functions of reductive groups involves an ambiguity of certain scalars. In this paper, for reductive groups of classical type with arbitrary characteristic, we determine those scalars…