Related papers: Computing with Hypergeometric-Type Terms
New sequences of hyperoperations \cite{BE15,HI26,ACK28,GO47,TAR69} are presented together with their local algebraic properties. The commutative hyperoperations reported by Bennet \cite{BE15} are presented as a sequence of monoids. After…
Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category…
We apply a version of the Chas-Sullivan-Cohen-Jones product on the higher loop homology of a manifold in order to compute the homology of the spaces of continuous and holomorphic maps of the Riemann sphere into a complex projective space.…
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also give applications and connections to polynomial identity…
We give a new practical method for computing subvarieties of projective hypersurfaces. By computing the periods of a given hypersurface X, we find algebraic cohomology cycles on X. On well picked algebraic cycles, we can then recover the…
The Deligne-Ogus-Shioda theorem guarantees the existence of isomorphisms between products of supersingular elliptic curves over finite fields. In this paper, we present methods for explicitly computing these isomorphisms in polynomial time,…
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
Given a commutative ring with identity $R$, many different and interesting operations can be defined over the set $H_R$ of sequences of elements in $R$. These operations can also give $H_R$ the structure of a ring. We study some of these…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
We adapt the rectangular splitting technique of Paterson and Stockmeyer to the problem of evaluating terms in holonomic sequences that depend on a parameter. This approach allows computing the $n$-th term in a recurrent sequence of suitable…
We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…
It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…
In [8] a notion of generalized Hadamard product was introduced. We show that when certain kinds of tensors interact with the eigenvalues of symmetric matrices the resulting formulae can be nicely expressed using the generalized Hadamard…
We study a new type of sequences whose elements are defined in terms of the position, sign and magnitude of another element of the sequence. The name ultra-recursive comes from the fact that these sequences possess terms that are generated…
In this work we study orthogonal polynomials via polynomial mappings in the framework of the $H_q-$semiclassical class. We consider two monic orthogonal polynomial sequences $\{p_n (x)\}_{n\geq0}$ and $\{q_n(x)\}_{n\geq0}$ such that $$…
General structure of the multivariate plain and q-hypergeometric terms and univariate elliptic hypergeometric terms is described. Some explicit examples of the totally elliptic hypergeometric terms leading to multidimensional integrals on…
In Homotopy Type Theory, few constructions have proved as troublesome as the smash product. While its definition is just as direct as in classical mathematics, one quickly realises that in order to define and reason about functions over…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
Let $R$ be a commutative Noetherian ring of dimension $d$. First, we define the "geometric subring" $A$ of a polynomial ring $R[T]$ of dimension $d+1$ (the definition of geometric subring is more general, see (1.2)). Then we prove that…
Polynomial reduction, designed first for hypergeometric terms, can be used to automatically prove and generate new hypergeometric identities from old ones. In this paper, we extend the reduction method to holonomic sequences. As…