Related papers: Algorithms for Algebraic and Arithmetic Attributes…

Let ${\mathbb Z}_p$ denote the ring of all $p$-adic integers and call $${\mathcal U}=\{(x_1,\ldots,x_n):\,a_1x_1+\ldots+a_nx_n+b=0\}$$ a hyperplane over ${\mathbb Z}_p^n$, where at least one of $a_1,\ldots,a_n$ is not divisible by $p$. We…

A method for approximating continuous functions $\mathbb{Z}_{p}^{n}\rightarrow\mathbb{Z}_{p}$ by a linear superposition of continuous functions $\mathbb{Z}_{p}\rightarrow\mathbb{Z}_{p}$ is presented and a polynomial regression model is…

We present sharp lower bounds for the A-numerical radius of semi-Hilbertian space operators. We also present an upper bound. Further we compute new upper bounds for the $B$-numerical radius of $2 \times 2$ operator matrices where $B =…

We study the relationship between recent conjectures on slopes of overconvergent p-adic modular forms "near the boundary" of p-adic weight space. We also prove in tame level 1 that the coefficients of the Fredholm series of the U_p operator…

We study in detail certain natural continuous representations of G = GL(n,K) in locally convex vector spaces over a locally compact, non-archimedean field K of characteristic zero. We construct boundary value maps, or integral transforms,…

HYPERDIRE is a project devoted to the creation of a set of Mathematica-based programs for the differential reduction of hypergeometric functions. The current version allows for manipulations involving the full set of Horn-type…

We survey some recent applications of p-adic cohomology to machine computation of zeta functions of algebraic varieties over finite fields of small characteristic, and suggest some new avenues for further exploration.

In this paper, we study some extended hypergeometric functions from matrix point of view. We have given the integral representations of these matrix functions. Finally, we obtain some generating function relations using fractional…

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…

Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…

A new type of algorithms is presented that combine the advantages of quantum and classical ones. Those combined advantages along with aspects of Geometric Algebra that open possibilities unavailable to both of these computations are…

Motivated by an application to LDPC (low density parity check) algebraic geometry codes described by Voloch and Zarzar, we describe a computational procedure for establishing an upper bound on the arithmetic or geometric Picard number of a…

We systematically exploit a new generalized hypergeometric identity to obtain new hypergeometric summation formulas. As a consistency test, alternative proofs for some special cases are also provided. As a byproduct new summation formulas…

We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…

This paper explores the calculus of dual-valued functions and investigates the gamma function, beta function and generalized hypergeometric functions by incorporating dual numbers as parameters and variables. We examine its fundamental…

The umbral restyling of hypergeometric functions is shown to be a useful and efficient approach in simplifying the associated computational technicalities. In this article, the authors provide a general introduction to the umbral version of…

We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…

The generalization of the factorization method performed by Mielnik [J. Math. Phys. {\bf 25}, 3387 (1984)] opened new ways to generate exactly solvable potentials in quantum mechanics. We present an application of Mielnik's method to…

We formulate and prove a combinatorial criterion to decide if an A-hypergeometric system of differential equations has a full set of algebraic solutions or not. This criterion generalises the so-called interlacing criterion in the case of…