Related papers: Using Walnut to solve problems from the OEIS
The explicit solution of the initial-values problem is exhibited of a subclass of the autonomous system of 2 coupled first-order ODE s with second-degree polynomial right-hand sides, hence featuring 12 a prior arbitrary (time-independent)…
We prove an effective equidistribution result for a class of higher step nilflows, called filiform nilflows, and derive bounds on Weyl sums for higher degree polynomials with a power saving comparable to the best known, derived by J.…
We show that polynomials associated with automatic sequences satisfy a certain recurrence relation when evaluated at a root of unity, which generalizes a result of Brillhart, Lomont and Morton on the Rudin--Shapiro polynomials. We study the…
Recent work [1] produced an efficient method for computing Weil-Petersson volumes using two ordinary differential equations (ODEs) that appear naturally in double scaled random matrix models. One is the defining string equation of the model…
Given a finite-dimensional Lie algebra, and a representation by derivations on the completed symmetric algebra of its dual, a number of interesting twisted constructions appear: certain twisted Weyl algebras, deformed Leibniz rules,…
Windowed recurrences are sliding window calculations where a function is applied iteratively across the window of data, and are ubiquitous throughout the natural, social, and computational sciences. In this monograph we explore the…
We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…
In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of…
We show how the continuous Almkvist-Zeilberger algorithm can be used to efficiently discover and prove differential equations satisfied by generating functions of sequences defined as integrals of powers of C-finite polynomial sequences…
We consider the Ehrhart polynomial of hypersimplices. It is proved that these polynomials have positive coefficients and we give a combinatorial formula for each of them. This settles a problem posed by Stanley and also proves that uniform…
We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…
We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…
In one of his last papers, Boris Weisfeiler proved that if modular semisimple Lie algebra possesses a solvable maximal subalgebra which defines in it a long filtration, then associated graded algebra is isomorphic to one constructed from…
We show that automatic sequences are asymptotically orthogonal to periodic exponentials of type $e_q(f(n))$, where $f$ is a rational fraction, in the P\'olya-Vinogradov range. This applies to Kloosterman sums, and may be used to study…
Let $\mu(t) = \sum_{\tau\in S} \alpha_\tau \delta(t-\tau)$ denote an $|S|$-atomic measure defined on $[0,1]$, satisfying $\min_{\tau\neq \tau'}|\tau - \tau'|\geq |S|\cdot n^{-1}$. Let $\eta(\theta) = \sum_{\tau\in S} a_\tau D_n(\theta -…
We introduce a shifted convolution sum that is parametrized by the squarefree natural number $t$. The asymptotic growth of this series depends explicitly on whether or not $t$ is a \emph{congruent number}, an integer that is the area of a…
We obtain several asymptotic formulas for the sum of the divisor function $\tau(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced…
We give an extension of Sister Celine's method of proving hypergeometric sum identities that allows it to handle a larger variety of input summands. We then apply this to several problems. Some give new results, and some reprove already…
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The underlying synthesis problem, however, is challenging and…
In this paper, the formulas of some exponential sums over finite field, related to the Coulter's polynomial, are settled based on the Coulter's theorems on Weil sums, which may have potential application in the construction of linear codes…