Related papers: Rational reductions for holonomic sequences
The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential operators in the Weyl algebra D = k<x_1, ...,…
We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
We show that if $F(s)$ is a nondegenerate ordinary Dirichlet series with nonnegative coefficients and $F(k)$ is a rational number for all large enough positive integers $k$, then the denominators of those rational numbers are unbounded. In…
Motivated by the work on hypergeometric summation theorems (recorded in the table III of Prudnikov et al. pp. 541-546), we have established some new summation theorems for Clausen's hypergeometric functions with unit argument in terms of…
Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
We introduce sequences of functions orthogonal on a finite interval: proper orthogonal rational functions, orthogonal exponential functions, orthogonal logarithmic functions, and transmuted orthogonal polynomials
We study the number of real rational degree n functions (considered up to linear fractional transformations of the independent variable) with a given set of 2n-2 distinct real critical values. We present a combinatorial reformulation of…
Let F be a field of characteristic 2. In this paper we determine the Kato-Milne cohomology of the rational function field F(x) in one variable x. This will be done by proving an analogue of the Milnor exact sequence [4] in the setting of…
We recall that diagonals of rational functions naturally occur in lattice statistical mechanics and enumerative combinatorics. We find that a seven-parameter rational function of three variables with a numerator equal to one (reciprocal of…
We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational…
Functional equations satisfied by additive functions have a special interest not only in the theory of functional equations, but also in the theory of (commutative) algebra because the fundamental notions such as derivations and…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…
In this note we study some sequences whose ratio converges to the square root of rationals. Further we analyze some related sequences obtained when the above mentioned ratio simplifies.
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
Hooley proved that if $f\in \Bbb Z [X]$ is irreducible of degree $\ge 2$, then the fractions $\{ r/n\}$, $0<r<n$ with $f(r)\equiv 0\pmod n$, are uniformly distributed in $(0,1)$. In this paper we study such problems for reducible…
In this paper we present an algorithm to compute all unirational fields of transcendence degree one containing a given finite set of multivariate rational functions. In particular, we provide an algorithm to decompose a multivariate…