BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Shaoshi Chen

Shaoshi Chen contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Symbolic Computationmath.COmath.ACmath.CAmath.RAmath.AGDiscrete MathematicsMachine Learningmath.DSmath.NT

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
27works
0followers
10topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

27 published item(s)

preprint2026arXiv

Automated Formal Proofs of Combinatorial Identities via Wilf-Zeilberger Guidance and LLMs

Automating formal proofs of combinatorial identities is challenging for LLM-based provers, as long-horizon proof planning is required and unconstrained search quickly explodes. Symbolic methods such as the Wilf-Zeilberger (WZ) method can achieve a mechanized proof of combinatorial identities by constructing special auxiliary functions and demonstrating that they satisfy specific recurrence relations. We propose WZ-LLM, a neuro-symbolic framework that turns WZ proof plans into executable proof sketches in Lean 4 and uses an LLM-based prover to discharge the resulting machine-checkable subgoals. We also train a dedicated WZ-Prover via a Lean-kernel-verified bootstrapping loop with expert-verified iteration, followed by DAPO-based refinement. Experiments show that WZ-LLM achieves a 34% proof success rate on LCI-Test (100 classic combinatorial identities), outperforming strong baselines such as DeepSeek-V3 and Goedel-Prover-V2, and delivering consistent gains on CombiBench and PutnamBench-Comb. These results indicate that our framework provides two complementary strengths: improved direct proving for identities beyond the scope of WZ, and substantially higher end-to-end success when WZ sketches guide a specialized prover.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Symbolic Integration of Differential Forms: From Abel to Zeilberger

This paper focuses on symbolic integration of differential forms, with a particular emphasis on historical and modern developments, from Abel's addition theorems for Abelian integrals to Zeilberger's creative telescoping for parameterized integrals. It explores closed rational $p$-forms and provides algorithmic approaches for their integration, extending classical results like Hermite reduction and Liouville's theorem. The integration of closed differential forms with parameters is further examined through telescopers, offering a unified framework for handling both algebraic and transcendental cases.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Constructing minimal telescopers for rational functions in three discrete variables

We present a new algorithm for constructing minimal telescopers for rational functions in three discrete variables. This is the first discrete reduction-based algorithm that goes beyond the bivariate case. The termination of the algorithm is guaranteed by a known existence criterion of telescopers. Our approach has the important feature that it avoids the potentially costly computation of certificates. Computational experiments are also provided so as to illustrate the efficiency of our approach.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Stability Problems in Symbolic Integration

This paper aims to initialize a dynamical aspect of symbolic integration by studying stability problems in differential fields. We present some basic properties of stable elementary functions and D-finite power series that enable us to characterize three special families of stable elementary functions involving rational functions, logarithmic functions, and exponential functions. Some problems for future studies are proposed towards deeper dynamical studies in differential and difference algebra.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Lazy Hermite Reduction and Creative Telescoping for Algebraic Functions

Bronstein's lazy Hermite reduction is a symbolic integration technique that reduces algebraic functions to integrands with only simple poles without the prior computation of an integral basis. We sharpen the lazy Hermite reduction by combining it with the polynomial reduction to solve the decomposition problem of algebraic functions. The sharpened reduction is then used to design a reduction-based telescoping algorithm for algebraic functions in two variables.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Separability Problems in Creative Telescoping

For given multivariate functions specified by algebraic, differential or difference equations, the separability problem is to decide whether they satisfy linear differential or difference equations in one variable. In this paper, we will explain how separability problems arise naturally in creative telescoping and present some criteria for testing the separability for several classes of special functions, including rational functions, hyperexponential functions, hypergeometric terms, and algebraic functions.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Telescopers for differential forms with one parameter

Telescopers for a function are linear differential (resp. difference) operators annihilated by the definite integral (resp. definite sum) of this function. They play a key role in Wilf-Zeilberger theory and algorithms for computing them have been extensively studied in the past thirty years. In this paper, we introduce the notion of telescopers for differential forms with $D$-finite function coefficients. These telescopers appear in several areas of mathematics, for instance parametrized differential Galois theory and mirror symmetry. We give a sufficient and necessary condition for the existence of telescopers for a differential form and describe a method to compute them if they exist. Algorithms for verifying this condition are also given.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Integral P-Recursive Sequences

In an earlier paper, the notion of integrality known from algebraic number fields and fields of algebraic functions has been extended to D-finite functions. The aim of the present paper is to extend the notion to the case of P-recursive sequences. In order to do so, we formulate a general algorithm for finding all integral elements for valued vector spaces and then show that this algorithm includes not only the algebraic and the D-finite cases but also covers the case of P-recursive sequences.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

On the Existence of Telescopers for Rational Functions in Three Variables

Zeilberger's method of creative telescoping is crucial for the computer-generated proofs of combinatorial and special-function identities. Telescopers are linear differential or ($q$-)recurrence operators computed by algorithms for creative telescoping. For a given class of inputs, when telescopers exist and how to construct telescopers efficiently if they exist are two fundamental problems related to creative telescoping. In this paper, we solve the existence problem of telescopers for rational functions in three variables including 18 cases. We reduce the existence problem from the trivariate case to the bivariate case and some related problems. The existence criteria given in this paper enable us to determine the termination of algorithms for creative telescoping with trivariate rational inputs.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Existence Problem of Telescopers: Beyond the Bivariate Case

In this paper, we solve the existence problem of telescopers for rational functions in three discrete variables. We reduce the problem to that of deciding the summability of bivariate rational functions, which has been solved recently. The existence criteria we present is needed for detecting the termination of Zeilberger's algorithm to the function classes studied in this paper.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Some Open Problems related to Creative Telescoping

Creative telescoping is the method of choice for obtaining information about definite sums or integrals. It has been intensively studied since the early 1990s, and can now be considered as a classical technique in computer algebra. At the same time, it is still subject of ongoing research. In this paper, we present a selection of open problems in this context. We would be curious to hear about any substantial progress on any of these problems.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

A Modified Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms

The Abramov-Petkovsek reduction computes an additive decomposition of a hypergeometric term, which extends the functionality of the Gosper algorithm for indefinite hypergeometric summation. We modify the Abramov-Petkovsek reduction so as to decompose a hypergeometric term as the sum of a summable term and a non-summable one. The outputs of the Abramov-Petkovsek reduction and our modified version share the same required properties. The modified reduction does not solve any auxiliary linear difference equation explicitly. It is also more efficient than the original reduction according to computational experiments. Based on this reduction, we design a new algorithm to compute minimal telescopers for bivariate hypergeometric terms. The new algorithm can avoid the costly computation of certificates.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

A Generalized Apagodu-Zeilberger Algorithm

The Apagodu-Zeilberger algorithm can be used for computing annihilating operators for definite sums over hypergeometric terms, or for definite integrals over hyperexponential functions. In this paper, we propose a generalization of this algorithm which is applicable to arbitrary $\partial$-finite functions. In analogy to the hypergeometric case, we introduce the notion of proper $\partial$-finite functions. We show that the algorithm always succeeds for these functions, and we give a tight a priori bound for the order of the output operator.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Complexity of Creative Telescoping for Bivariate Rational Functions

The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration in Almkvist and Zeilberger's framework of (differential) creative telescoping. Our complexity-driven approach is to obtain tight degree bounds on the various expressions involved in the method. To make the problem more tractable, we restrict to bivariate rational functions. By considering this constrained class of inputs, we are able to blend the general method of creative telescoping with the well-known Hermite reduction. We then use our new method to compute diagonals of rational power series arising from combinatorics.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Desingularization Explains Order-Degree Curves for Ore Operators

Desingularization is the problem of finding a left multiple of a given Ore operator in which some factor of the leading coefficient of the original operator is removed. An order-degree curve for a given Ore operator is a curve in the $(r,d)$-plane such that for all points $(r,d)$ above this curve, there exists a left multiple of order $r$ and degree $d$ of the given operator. We give a new proof of a desingularization result by Abramov and van Hoeij for the shift case, and show how desingularization implies order-degree curves which are extremely accurate in examples.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Hermite Reduction and Creative Telescoping for Hyperexponential Functions

We present a reduction algorithm that simultaneously extends Hermite's reduction for rational functions and the Hermite-like reduction for hyperexponential functions. It yields a unique additive decomposition and allows to decide hyperexponential integrability. Based on this reduction algorithm, we design a new method to compute minimal telescopers for bivariate hyperexponential functions. One of its main features is that it can avoid the costly computation of certificates. Its implementation outperforms Maple's function DEtools[Zeilberger]. Moreover, we derive an order bound on minimal telescopers, which is more general and tighter than the known one.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Order-Degree Curves for Hypergeometric Creative Telescoping

Creative telescoping applied to a bivariate proper hypergeometric term produces linear recurrence operators with polynomial coefficients, called telescopers. We provide bounds for the degrees of the polynomials appearing in these operators. Our bounds are expressed as curves in the (r,d)-plane which assign to every order r a bound on the degree d of the telescopers. These curves are hyperbolas, which reflect the phenomenon that higher order telescopers tend to have lower degree, and vice versa.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Residues and Telescopers for Rational Functions

We give necessary and sufficient conditions for the existence of telescopers for rational functions of two variables in the continuous, discrete and q-discrete settings and characterize which operators can occur as telescopers. Using this latter characterization, we reprove results of Furstenberg and Zeilberger concerning diagonals of power series representing rational functions. The key concept behind these considerations is a generalization of the notion of residue in the continuous case to an analogous concept in the discrete and q-discrete cases.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Telescopers for Rational and Algebraic Functions via Residues

We show that the problem of constructing telescopers for functions of m variables is equivalent to the problem of constructing telescopers for algebraic functions of m -1 variables and present a new algorithm to construct telescopers for algebraic functions of two variables. These considerations are based on analyzing the residues of the input. According to experiments, the resulting algorithm for rational functions of three variables is faster than known algorithms, at least in some examples of combinatorial interest. The algorithm for algebraic functions implies a new bound on the order of the telescopers.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Trading Order for Degree in Creative Telescoping

We analyze the differential equations produced by the method of creative telescoping applied to a hyperexponential term in two variables. We show that equations of low order have high degree, and that higher order equations have lower degree. More precisely, we derive degree bounding formulas which allow to estimate the degree of the output equations from creative telescoping as a function of the order. As an application, we show how the knowledge of these formulas can be used to improve, at least in principle, the performance of creative telescoping implementations, and we deduce bounds on the asymptotic complexity of creative telescoping for hyperexponential terms.

0 citations0 reviewsNo code linkedOpen access