Related papers: Recursive formulas for the motivic Milnor basis
Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…
We develop a "motivic integration" version of the Poisson summation formula for function fields, with values in the Grothendieck ring of definable exponential sums. We also study division algebras over the function field, and obtain…
We present a topological recursion formula for calculating the intersection numbers defined on the moduli space of open Riemann surfaces. The spectral curve is $x = \frac{1}{2}y^2$, the same as spectral curve used to calculate intersection…
Recursive formulas extending some known $_{2}F_{1}$ and $_{3}F_{2}$ summation formulas by using contiguous relations have been obtained. On the one hand, these recursive equations are quite suitable for symbolic and numerical evaluation by…
Using iterated vanishing cycles and convolution, we prove a motivic version of a conjecture of Steenbrink concerning the spectrum of hypersurface singularities
We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.
We use the theory of motivic integration in order to give a geometric explanation of the behavior of some p-adic integrals.
We consider a model for topological recursion based on the Hopf Algebra of planar binary trees of Loday and Ronco. We show that extending this Hopf Algebra by identifying pairs of nearest neighbor leaves and producing in this way graphs…
Given a family $X$ of complex varieties degenerating over a punctured disc, one is interested in computing related invariants called the motivic nearby fiber and the refined limit mixed Hodge numbers, both of which contain information about…
In the paper "The Steenrod algebra and its dual", J.Milnor determined the structure of the dual Steenrod algebra which is a graded commutative Hopf algebra of finite type. We consider the affine group scheme $G_p$ represented by the dual…
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories…
Recently obtained recurrence formulae for relativistic hydrogenic radial matrix elements are cast in a simpler and perhaps more useful form. This is achieved with the help of a new relation between the $r^a$ and the $\beta r^b$ terms…
In this paper, using geometric polynomials, we obtain a generating function of p-Bernoulli numbers. As a consequences this generating function, we derive closed formulas for the finite summation of Bernoulli and harmonic numbers involving…
In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
In this paper, we construct four binary linear codes closely connected with certain exponential sums over the finite field F_q and F_q-{0,1}. Here q is a power of two. Then we obtain four recursive formulas for the power moments of…
Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…
We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.
We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…
We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…