Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Abstract Recently we constructed Mahler discrete residues for rational functions and showed they comprise a complete obstruction to the Mahler summability problem of deciding whether a given rational function $f(x)$ is of the form $$g(x^{p})-g(x)$$ for some rational function $g(x)$ and an integer $p> 1$. Here we develop a notion of $$\lambda $$-twisted Mahler discrete residues for $$\lambda \in \mathbb{Z}$$, and show that they similarly comprise a complete obstruction to the twisted Mahler summability problem of deciding whether a given rational function $f(x)$ is of the form $$p^{\lambda } g(x^{p})-g(x)$$ for some rational function $g(x)$ and an integer $p>1$. We provide some initial applications of twisted Mahler discrete residues to differential creative telescoping problems for Mahler functions and to the differential Galois theory of linear Mahler equations.more » « less
-
In 2012 Chen and Singer introduced the notion of discrete residues for rational functions as a complete obstruction to rational summability. More explicitly, for a given rational function f(x), there exists a rational function g(x) such that f(x) = g(x+1) - g(x) if and only if every discrete residue of f(x) is zero. Discrete residues have many important further applications beyond summability: to creative telescoping problems, thence to the determination of (differential-)algebraic relations among hypergeometric sequences, and subsequently to the computation of (differential) Galois groups of difference equations. However, the discrete residues of a rational function are defined in terms of its complete partial fraction decomposition, which makes their direct computation impractical due to the high complexity of completely factoring arbitrary denominator polynomials into linear factors. We develop a factorization-free algorithm to compute discrete residues of rational functions, relying only on gcd computations and linear algebra.more » « less
-
Abstract We study normal reflection subgroups of complex reflection groups. Our approach leads to a refinement of a theorem of Orlik and Solomon to the effect that the generating function for fixed-space dimension over a reflection group is a product of linear factors involving generalised exponents. Our refinement gives a uniform proof and generalisation of a recent theorem of the second author.more » « less
-
We study normal reflection subgroups of complex reflection groups. Our point of view leads to a refinement of a theorem of Orlik and Solomon to the effect that the generating function for fixed-space dimension over a reflection group is a product of linear factors involving generalized exponents. Our refinement gives a uniform proof and generalization of a recent theorem of the second author.more » « less
An official website of the United States government

Full Text Available