Related papers: Algorithms for Algebraic and Arithmetic Attributes…
We compute the Galois cohomology of any $p$-adic valuation field extension of a pre-perfectoid field. Moreover, we obtain a generalization and also a new proof of the classical results of Tate and Hyodo on discrete valuation fields, without…
It is known that solutions of the KZ equations can be written in the form of multidimensional hypergeometric integrals. In 2017 in a joint paper of the author with V. Schechtman the construction of hypergeometric solutions was modified, and…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
We present an algorithm to perform a simultaneous modular reduction of several residues. This algorithm is applied fast modular polynomial multiplication. The idea is to convert the $X$-adic representation of modular polynomials, with $X$…
We construct a class of representations of the quadratic R-matrix algebra, given by the reflection equation with the spectral parameter, in terms of certain ordinary difference operators. These operators turn out to act as parameter…
This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…
We present two algorithms for computing hypergeometric solutions of second order linear differential operators with rational function coefficients. Our first algorithm searches for solutions of the form \[ \exp(\int r \,…
We describe a uniform way of obtaining basic hypergeometric functions as limits of the elliptic beta integral. This description gives rise to the construction of a polytope with a different basic hypergeometric function attached to each…
We examine two binary operations on the set of algebraic polynomials, known as multiplicative and additive finite free convolutions, specifically in the context of hypergeometric polynomials. We show that the representation of a…
We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…
This thesis studies modular forms from a classical and adelic viewpoint. We use this interplay to obtain results about the arithmetic of the Fourier coefficients of modular forms and their generalisations. In Chapter 2, we compute lower…
Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…
We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…
We derive efficient algorithms for coarse approximation of algebraic hypersurfaces, useful for estimating the distance between an input polynomial zero set and a given query point. Our methods work best on sparse polynomials of high degree…
We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…
The A-hypergeometric system studied by I.M. Gelfand, M.I. Graev, A.V. Zelevinsky and the author, is defined for a set A of characters of an algebraic torus. In this paper we propose a generalization of the theory where the torus is replaced…
The two most commonly used hypergeometric functions are the confluent hypergeometric function and the Gauss hypergeometric function. We review the available techniques for accurate, fast, and reliable computation of these two hypergeometric…
Let F be a number field, p a prime number. We construct the (multi-variable) p-adic L-function of an automorphic representation of $GL_2(A_F)$ (with certain conditions at places above p and $\infty$), which interpolates the complex…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic. Here…