Searcharxiv⌕ Search

arXiv subjects

Ruyong Feng

Publications and source records attributed to Ruyong Feng.

27 records · Page 2Linked to original sources

Difference Galois groups under specialization

We present a difference analogue of a result given by Hrushovski on differential Galois groups under specialization. Let $k$ be an algebraically closed field of characteristic zero and $\mathbb{X}$ an irreducible affine algebraic variety over $k$. Consider the linear difference equation $$ σ(Y)=AY $$ where $A\in \mathrm{GL}_n(k(\mathbb{X})(x))$ and $σ$ is the shift operator $σ(x)=x+1$. Assume that the Galois group $G$ of the above equation over $\overline{k(\mathbb{X})}(x)$ is defined over $k(\mathbb{X})$ i.e. the vanishing ideal of $G$ is generated by a finite set $S\subset k(\mathbb{X})[X,1/\det(X)]$. For a ${\bf c}\in \mathbb{X}$, denote by $v_{\bf c}$ the map from $k[\mathbb{X}]$ to $k$ given by $v_{\bf c}(f)=f({\bf c})$ for any $f\in k[\mathbb{X}]$. We prove that the set of ${\bf c}\in \mathbb{X}$ satisfying that $v_{\bf c}(A)$ and $v_{\bf c}(S)$ are well-defined and the affine variety in $\mathrm{GL}_n(k)$ defined by $v_{\bf c}(S)$ is the Galois group of $σ(Y)=v_{\bf c}(A)Y$ over $k(x)$ is Zariski dense in $\mathbb{X}$. We apply our result to van der Put-Singer's conjecture which asserts that an algebraic subgroup $G$ of $\mathrm{GL}_n(k)$ is the Galois group of a linear difference equation over $k(x)$ if and only if the quotient $G/G^\circ$ by the identity component is cyclic. We show that if van der Put-Singer's conjecture is true for $k=\mathbb{C}$ then it will be true for any algebraically closed field $k$ of characteristic zero.

math.RA↗

Hrushovski's Algorithm for Computing the Galois Group of a Linear Differential Equation

We present a detailed and simplified version of Hrushovski's algorithm that determines the Galois group of a linear differential equation. There are three major ingredients in this algorithm. The first is to look for a degree bound for proto-Galois groups, which enables one to compute one of them. The second is to determine the identity component of the Galois group that is the pullback of a torus to the proto-Galois group. The third is to recover the Galois group from its identity component and a finite Galois group.

cs.SC↗

Parallel Telescoping and Parameterized Picard--Vessiot Theory

Parallel telescoping is a natural generalization of differential creative-telescoping for single integrals to line integrals. It computes a linear ordinary differential operator $L$, called a parallel telescoper, for several multivariate functions, such that the applications of $L$ to the functions yield antiderivatives of a single function. We present a necessary and sufficient condition guaranteeing the existence of parallel telescopers for differentially finite functions, and develop an algorithm to compute minimal ones for compatible hyperexponential functions. Besides computing annihilators of parametric line integrals, we use the parallel telescoping for determining Galois groups of parameterized partial differential systems of first order.

cs.SC↗

On the Structure of Compatible Rational Functions

A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the structure of compatible rational functions. The theorem enables us to decompose a solution of such a system as a product of a rational function, several symbolic powers, a hyperexponential function, a hypergeometric term, and a q-hypergeometric term. We outline an algorithm for computing this product, and present an application.

cs.SC↗

On the Existence of Telescopers for Mixed Hypergeometric Terms

We present a criterion for the existence of telescopers for mixed hypergeometric terms, which is based on multiplicative and additive decompositions. The criterion enables us to determine the termination of Zeilberger's algorithms for mixed hypergeometric inputs.

cs.SC↗

On Functional Decomposition of Multivariate Polynomials with Differentiation and Homogenization

In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which are proposed by Ye, Dai, Lam (1999) and Faug$μ$ere, Perret (2006, 2008, 2009). We show that a degree proper functional decomposition for a set of randomly decomposable quartic homogenous polynomials can be computed using the algorithm with high probability. This solves a conjecture proposed by Ye, Dai, and Lam (1999). We also propose a conjecture such that the decomposition for a set of polynomials can be computed from that of its homogenization with high probability. Finally, we prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space. Combining these results together, we prove that the algorithm can compute a degree proper decomposition for a set of randomly decomposable quartic polynomials with probability one when the base field is of characteristic zero, and with probability close to one when the base field is a finite field with sufficiently large number under the assumption that the conjeture is correct.

cs.CR↗

Liouvillian Solutions of Difference-Differential Equations

For a field k$with an automorphism σand a derivation δ, we introduce the notion of liouvillian solutions of linear difference-differential systems {σ(Y) = AY, δ(Y) = BY} over k and characterize the existence of liouvillian solutions in terms of the Galois group of the systems. We will give an algorithm to decide whether such a system has liouvillian solutions when k = C(x,t), σ(x) = x+1, δ= d/dt$ and the size of the system is a prime.

cs.SC↗