Related papers: Computing the fixing group of a rational function
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…
Let $F$ be a field of characteristic $0$ containing all roots of unity. We construct a functorial compact Hausdorff space $X_F$ whose profinite fundamental group agrees with the absolute Galois group of $F$, i.e. the category of finite…
Let K be a number field and let f(x) = x^q + c where q is a prime power, c is in K, and f is not post-critically finite. We show that for any strictly preperiodic b in K, the iterated Galois group at b with respect to f has finite index in…
Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis…
Let $K$ be a field, and let $f\in K(z)$ be rational function. The preimages of a point $x_0\in P^1(K)$ under iterates of $f$ have a natural tree structure. As a result, the Galois group of the resulting field extension of $K$ naturally…
The main purpose of this paper is to provide explicit computations of the fundamental group of several algebras. For this purpose, given a $k$-algebra $A$, we consider the category of all connected gradings of $A$ by a group $G$ and we…
We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…
Let k be a p-adic field. Some time ago, D. Harbater [9] proved that any finite group G may be realized as a regular Galois group over the rational function field in one variable k(t), namely there exists a finite field extension $F/k(t)$,…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
We develop algorithms to compute the differential Galois group $G$ associated to a parameterized second-order homogeneous linear differential equation of the form \[ \tfrac{\partial^2}{\partial x^2} Y + r_1 \tfrac{\partial}{\partial x} Y +…
Let $f\_1,\ldots, f\_s$ be formal power series (respectively polynomials) in thevariable $x$. We study the semigroup of orders of the formal series inthe algebra $K[[ f1,\ldots, f\_s]] \subseteq K[[ x ]]$ (respectively the semigroup of…
For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…
Let $K$ be an algebraically closed field. Let $G$ be a non-trivial connected unipotent group, which acts effectively on an affine variety $X.$ Then every non-empty component $R$ of the set of fixed points of $G$ is a $K$-uniruled variety,…
In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…
We introduce an extension of fixed-point logic ($\mathsf{FP}$) with a group-order operator ($\mathsf{ord}$), that computes the size of a group generated by a definable set of permutations. This operation is a generalization of the rank…
We develop Kummer theory for algebraic function fields in finitely many transcendental variables. We consider any finitely generated Kummer extension (possibly, over a cyclotomic extension) of an algebraic function field, and describe the…
The affine line and the punctured affine line over a finite field F are taken as benchmarks for the problem of describing geometric \'etale fundamental groups. To this end, using a reformulation of Tannaka duality we construct for a…
Let $F$ be a finitely generated regular field extension of transcendence degree $\geq 2$ over a perfect field $k$. We show that the multiplicative group $F^\times/k^\times$ endowed with the equivalence relation induced by algebraic…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…