Related papers: On Gosper-Karaji algebraic Identities
We describe a prototype of a new experimental GeoGebra command and tool, Discover, that analyzes geometric figures for salient patterns, properties, and theorems. This tool is a basic implementation of automated discovery in elementary…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
In 1977, Gosper conjectured many strange evaluations of hypergeometric series. One of them is a ${}_{2}F_{1}$-series identity with two free parameters, which was proved by Ebisu (2013), Chu (2017), and Campbell (2023) in different ways. In…
We state and prove a general summation identity. The identity is then applied to derive various summation formulas involving the generalized harmonic numbers and related quantities. Interesting results, mostly new, are obtained for both…
This work pioneers the systematic study and classification (up to Lie algebra automorphisms) of finite-dimensional coboundary Lie bialgebras through Grassmann algebras. Several mathematical structures on Lie algebras, e.g. Killing forms or…
We prove a number of new Rogers-Ramanujan type identities involving double, triple and quadruple sums. They were discovered after an extensive search using Maple. The main idea of proofs is to reduce them to some known identities in the…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
L. K. Grover's search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover's algorithm in a Hilbert-space framework for both…
Let i be a homomorphism of the multiplicative group into a connected reductive algebraic group over C. Let G^i be the centralizer of the image i. Let LG be the Lie algebra of G and let L_nG (n integer) be the summands in the direct sum…
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…
We outline an elementary method for proving numerical hypergeometric identities, in particular, Ramanujan-type identities for $1/\pi$. The principal idea is using algebraic transformations of arithmetic hypergeometric series to translate…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…
We prove upper bounds for the Hilbert-Samuel multiplicity of standard graded Gorenstein algebras. The main tool that we use is Boij-S\"oderberg theory to obtain a decomposition of the Betti table of a Gorenstein algebra as the sum of…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We introduce and discuss, through a computational algebraic geometry approach, the automatic reasoning handling of propositions that are simultaneously true and false over some relevant collections of instances. A rigorous, algorithmic…
We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…