Related papers: Algorithms for Algebraic and Arithmetic Attributes…
In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…
Some integral properties of Jack polynomials, hypergeometric functions and invariant polynomials are studied for real normed division algebras.
We introduce a geometric formalism for studying modular forms of half-integral weight and explore some of its basic properties. Geometric Hecke operators are constructed and some basic spaces of $p$-adic forms are introduced. The $p$-adic…
This paper describes an algorithm for determining radii of convergence of power expansions for algebraic functions and the testing done to check it. Since the current methods for computing these series are iterative, standard methods for…
The main object of the present paper is to, introduce the. class of meromorphic univalent functions Involving! hypergeomatrc function .We obtain~ some interesting geometric properties according to coefficient inequality , growth and…
We introduce new p-adic convergent functions, which we call the p-adic hypergeometric functions of logarithmic type. The first main result is to prove the congruence relations that are similar to Dwork's. The second main result is that the…
Explicit representations of the eigenvalues of the peridynamic operator have been recently derived in [5]. These representations are given in terms of generalized hypergeometric functions. Asymptotic analysis of the hypergeometric functions…
Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying…
We describe an algorithm to compute the local Coleman-Gross p-adic height at p on a hyperelliptic curve. Previously, this was only possible using an algorithm due to Balakrishnan and Besser, which was limited to odd degree. While we follow…
We study the question of when the coefficients of a hypergeometric series are p-adically unbounded for a given rational prime p. Our first main result is a necessary and sufficient criterion (applicable to all but finitely many primes) for…
We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…
The purpose of this article is to newly define the $p$-adic polylogarithm as an equivariant class in the cohomology of a certain infinite disjoint union of algebraic tori associated to a totally real field. We will then express the special…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…
An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…
In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm…
In this paper, we introduce degenertae generalized hypergeometric functions and study degenerate hypergeometric numbers of order p. These numbers involving of lambda-binomial coefficients and lambda-falling sequence, and can be represented…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer…
The p-adic formulation of replica symmetry breaking is presented. In this approach ultrametricity is a natural consequence of the basic properties of the p-adic numbers. Many properties can be simply derived in this approach and p-adic…