Related papers: Formal residue and computer proofs of combinatoria…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
Two new identities about Catalan numbers are treated with Zeilberger's algorithm and Watson's hypergeometric series evaluation.
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…
We present recent computer algebra methods that support the calculations of (multivariate) series solutions for (certain coupled systems of partial) linear differential equations. The summand of the series solutions may be built by…
Formal verification has been successfully developed in computer science for verifying combinatorial classes of models and specifications. In like manner, formal verification methods have been developed for dynamical systems. However, the…
Many classical $q$-series identities, such as the Rogers--Ramanujan identities, yield combinatorial interpretations in terms of integer partitions. Here we consider algebraically manipulating some of the classical $q$-series to yield…
A class of determinants is introduced. Different kind of mathematical objects, such as Fibonacci, Lucas, Tchebychev, Hermite, Laguerre, Legendre polynomials, sums and covergents are represented as determinants from this class. A closed…
This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such…
Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…
Let $\psi$ and $F$ be positive definite forms with integral coefficients of equal degree. Using the circle method, we establish an asymptotic formula for the number of identical representations of $\psi$ by $F$, provided $\psi$ is…
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…
We verify new cases of the Arithmetic Fundamental Lemma (AFL) of Wei Zhang. This relies on a recursive algorithm which allows, under certain conditions, to reduce the AFL identity in question to an AFL identity in lower dimension. The main…
We discuss some aspects of the search for identities using computer algebra and symbolic methods. The focus is on so-called Apery-like formulae for special values of the Riemann Zeta function. Much work lays ahead in formally proving and…
We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first…
In this paper, we clarified the relationship between continued fractions, determinants, and identities, making it easier to apply these methods systematically in other settings. In particular, we studied finite continued fractions from the…
This is a sequel to math.AG/0003009. Here we study identities for the Fourier transform of "elementary functions" over finite field containing "exponents" of monomial rational functions. It turns out that these identities are governed by…
We investigate the coefficients generated by expressing the falling factorial $(xy)_k$ as a linear combination of falling factorial products $(x)_l (y)_m$ for $l,m =1,...,k$. Algebraic and combinatoric properties of these coefficients are…