相关论文: Rational Interpolation and Basic Hypergeometric Se…

This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…

The last two decades have seen major developments in interpolatory methods for model reduction of large-scale linear dynamical systems. Advances of note include the ability to produce (locally) optimal reduced models at modest cost; refined…

We prove a conjecture that arose in the context of a subspace enumeration problem over finite fields. We prove, more generally, a bibasic, double-sum identity, which extends a $q$-analogue of the (terminating) binomial theorem.

Since the study by Jacobi and Hecke, Hecke-type series have received a lot of attention. Unlike such series associated with indefinite quadratic forms, identities on Hecke-type series associated with definite quadratic forms are quite rare…

We show that a vast class of finitary fragments of geometric logic admit a form of Craig interpolation property. In doing so, we provide a new dictionary to import technology from algebraic logic to categorical logic.

We give an $n$-space generalized $q$-binomial theorem, and some new $q$ series identities that resemble the traditional $q$ series partition generating functions. These identities enumerate stepping stone weighted vector partitions.

We give a natural geometric condition that ensures that sequences of Chung-Yao interpolation polynomials (of fixed degree) of sufficiently differentiable functions converge to a Taylor polynomial.

We study a polynomial sequence $C_n(x|q)$ defined as a solution of a $q$-difference equation. This sequence, evaluated at $q$-integers, interpolates Carlitz-Riordan's $q$-ballot numbers. In the basis given by some kind of $q$-binomial…

We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…

It is possible to generalize the fruitful interaction between (real or complex) Jacobi matrices, orthogonal polynomials and Pade approximants at infinity by considering rational interpolants, (bi-)orthogonal rational functions and linear…

When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…

We treat the interpolation problem $ \{f(x_j)=y_j\}_{j=1}^N $ for polynomial and rational functions. Developing the approach by C.Jacobi, we represent the interpolants by virtue of the Hankel polynomials generated by the sequences $…

We define natural classes of rational and polynomial representations of the Yangian of the general linear Lie algebra. We also present the classification and explicit realizations of all irreducible rational representations of the Yangian.

Rational approximations of generalized hypergeometric functions ${}_pF_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations…

This paper describes a method to find a connection between combinatorial identities and hypergeometric series with a number of examples. Combinatorial identities can often be written as hypergeometric series with unit argument. In a number…

We prove a new Bailey-type transformation relating WP-Bailey pairs. We then use this transformation to derive a number of new 3- and 4-term transformation formulae between basic hypergeometric series.

We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain…

For Fatou's interpolation theorem of 1906 we suggest a new elementary proof.

We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…

The goal of this paper is twofold; on one hand we wish to present some statements that can be formulated in terms of Interpolation theory which are equivalent to the truth or the falseness of the Riemann Hypothesis, on the other hand we…