Related papers: Computational aspects of rational residuosity

We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first…

We study rational Cherednik algebras over an algebraically closed field of positive characteristic. We first prove several general results about category O, and then focus on rational Cherednik algebras associated to the general and special…

Goulden-Rattan polynomials give the exact value of the subdominant part of the normalized characters of the symmetric groups in terms of certain quantities ($C_i$) which describe the macroscopic shape of the Young diagram. The…

The purpose of this note is give some evidence in support of conjectures of Poonen, and Morton and Silverman, on the periods of rational numbers under the iteration of quadratic polynomials. In particular, Poonen conjectured that there are…

Given a complex polynomial $P$ with zeroes $z_1,\dotsc,z_d$, we show that the asymptotic zero-counting measure of the iterated derivatives $Q^{(n)}, \ n=1,2,\dotsc$, where $Q=R/P$ is any irreducible rational function, converges to an…

Coefficients of super Jacobi polynomials of type $B(1,n)$ are rational functions in three parameters $k,p,q$. At the point $(-1,0,0)$ these coefficient may have poles. Let us set $q=0$ and consider pair $(k,p)$ as a point of $\Bbb A^2$. If…

We present a simulation code which can solve broad ranges of partial differential equations in a full sphere. The code expands tensorial variables in a spectral series of spin-weighted spherical harmonics in the angular directions and a…

This paper aims to derive explicit and computable error bounds for the asymptotic expansion of the Jacobi polynomials as their degree approaches infinity, using an integral method. The analysis focuses on the outer or oscillatory region of…

We introduce a new approach to the study of a system of algebraic equations in the algebraic torus whose Newton polytopes have sufficiently general relative positions. Our method is based on the theory of Parshin's residues and tame symbols…

Consider the set $\mathcal{K}$ of integers $k$ for which there are infinitely many primes $p$ such that $p+k$ is a power of $2$. The aim of this paper is to show a relationship between $\mathcal{K}$ and the limits points of some set…

We study properties of coefficients of a linear form, originating from a multiple integral. As a corollary, we prove Vasilyev's conjecture, connected with the problem of irrationality of the Riemann zeta function at odd integers.

We introduce Residue Hyperdimensional Computing, a computing framework that unifies residue number systems with an algebra defined over random, high-dimensional vectors. We show how residue numbers can be represented as high-dimensional…

Using Bochner-Martinelli type residual currents we prove some generalizations of Jacobi's Residue Formula, which allow proper polynomial maps to have `common zeroes at infinity', in projective or toric situations.

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

We consider expansions of vectors by a general class of multidimensional continued fraction algorithms. If the expansion is eventually periodic, then we describe the possible structure of a matrix corresponding to the repetend, and use it…

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…

Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…

Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…

Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…

We consider extensions of the Shannon relative entropy, referred to as $f$-divergences.Three classical related computational problems are typically associated with these divergences: (a) estimation from moments, (b) computing normalizing…