Related papers: Computing the fixing group of a rational function

Let ${\cal G}$ be a minor-closed graph class and let $G$ be an $n$-vertex graph. We say that $G$ is a $k$-apex of ${\cal G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to ${\cal G}$. Our first result…

Motivated by some algorithmic problems, we give lower bounds on the size of the multiplicative groups containing rational function images of low-dimensional affine subspaces of a finite field~$\mathbb{F}_{q^n}$ considered as a linear space…

Let $k$ be a field, $G$ be a finite group, $k(x(g):g\in G)$ be the rational function field with the variables $x(g)$ where $g\in G$. The group $G$ acts on $k(x(g):g\in G)$ by $k$-automorphisms where $h\cdot x(g)=x(hg)$ for all $h,g\in G$.…

Let $f\in K(t)$ be a univariate rational function. It is well known that any non-trivial decomposition $g \circ h$, with $g,h\in K(t)$, corresponds to a non-trivial subfield $K(f(t))\subsetneq L \subsetneq K(t)$ and vice-versa. In this…

Given a number field $k$, and a quadratic rational function $f(x) \in k(x)$, the associated arboreal representation of the absolute Galois group of $k$ is a subgroup of the automorphism group of a regular rooted binary tree. Boston and…

Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…

Let G be a finite group and V a finite-dimensional rational G-representation. We ask whether there exists a finite Galois extension L/K of number fields with Galois group G, an elliptic curve E/K, and a G-submodule of E(L) tensor Q…

Let f be an arbitrary positive integer valued function. The goal of this note is to show that one can construct a finitely generated group in which the discrete log problem is polynomially equivalent to computing the function f. In…

Let $k$ be any field, $G$ be a finite group acting on the rational function field $k(x_g:g\in G)$ by $h\cdot x_g=x_{hg}$ for any $h,g\in G$. Define $k(G)=k(x_g:g\in G)^G$. Noether's problem asks whether $k(G)$ is rational (= purely…

We give an algorithm to compute the following cohomology groups on $U = \C^n \setminus V(f)$ for any non-zero polynomial $f \in \Q[x_1, ..., x_n]$; 1. $H^k(U, \C_U)$, $\C_U$ is the constant sheaf on $U$ with stalk $\C$. 2. $H^k(U, \Vsc)$,…

Let $k$ be any field, $p>3$ be any prime number and $G$ be a nonabelian $p$-group of order $p^{5}$. Consider the action of $G$ on the rational function field $k(x_{h}:h\in G)$ by $g\cdot x_{h}=x_{gh}$ for all $g,h\in G$. Let $e$ be the…

In this paper we discuss the problem of performing elementary finite field arithmetic on a quantum computer. Of particular interest, is the controlled-multiplication operation, which is the only group-specific operation in Shor's algorithms…

We present an algorithm producing all rational functions $f$ with prescribed $n+1$ Taylor coefficients at the origin and such that $\|f\|_\infty\le 1$ and $\deg f\le k$ for every fixed $k\ge n$. The case where $k<n$ is also discussed.

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

Let $K$ be the function field of a smooth, irreducible curve defined over $\overline{\mathbb{Q}}$. Let $f\in K[x]$ be of the form $f(x)=x^q+c$ where $q = p^{r}, r \ge 1,$ is a power of the prime number $p$, and let $\beta\in \overline{K}$.…

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…

We propose a new method to compute the unipotent radical $R_u(H)$ of the differential Galois group $H$ associated to a parameterized second-order homogeneous linear differential equation of the form \[\tfrac{\partial^2}{\partial…

We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…