Related papers: A Recursion Backbone for Circular and Elliptic Cla…
We consider the configuration space of ordered points on the two-dimensional sphere that satisfy a specific system of quadratic equations. We construct periodic orbits in this configuration space using elliptic theta functions and show that…
We prove several vanishing theorems for a class of generalized elliptic genera on foliated manifolds, by using classical equivariant index theory. The main techniques are the use of the Jacobi theta-functions and the construction of a new…
The Kronecker theta function is a quotient of the Jacobi theta functions, which is also a special case of Ramanujan's $_1\psi_1$ summation. Using the Kronecker theta function as building blocks, we prove a decomposition theorem for theta…
A circular program contains a data structure whose definition is self-referential or recursive. The use of such a definition allows efficient functional programs to be written and can avoid repeated evaluations and the creation of…
Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two…
In this work we develop an algebraic theory of linear recurrence equations and systems with constant coefficients and reflection. We obtain explicit solutions and the Green's functions associated to different problems under general linear…
We define theta blocks as products of Jacobi theta functions divided by powers of the Dedekind eta-function and show that they give a powerful new method to construct Jacobi forms and Siegel modular forms, with applications also in lattice…
Recently the CHY approach has been extended to one loop level using elliptic functions and modular forms over a Jacobian variety. Due to the difficulty in manipulating these kind of functions, we propose an alternative prescription that is…
We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…
We develop the basic formulae of hyperspherical trigonometry in multidimensional Euclidean space, using multidimensional vector products, and their conversion to identities for elliptic functions. We show that the basic addition formulae…
Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper,…
We propose a general theory for constructing functorial assignments $\Sigma \longmapsto \Omega_{\Sigma} \in E(\Sigma)$ for a large class of functors $E$ from a certain category of bordered surfaces to a suitable target category of…
This is author's Habilitation Thesis (Dr. Sci. dissertation) submitted at the beginning of September 2004. It is written in Russian and is posted due to the continuing requests for the manuscript. The content: 1. Introduction, 2. Nonlinear…
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…
We establish discrete and continuous log-concavity results for a biparametric extension of the $q$-numbers and of the $q$-binomial coefficients. By using classical results for the Jacobi theta function we are able to lift some of our…
We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…
In this paper new classes of $L_2$-orthogonal functions are constructed as iterated $L_2$-orthogonal systems. In order to do this we use the theory of the Riemann's zeta-function as well as our theory of Jacob's ladders. The main result is…
The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…
New approach to systems of polynomial recursions is developed based on the Carleman linearization procedure. The article is divided into two main sections: firstly, we focus on the case of uni-variable depth-one polynomial recurrences.…