Related papers: An algorithm of computing special values of Dwork'…

We study the problem of computing the largest root of a real rooted polynomial $p(x)$ to within error $\varepsilon $ given only black box access to it, i.e., for any $x \in {\mathbb R}$, the algorithm can query an oracle for the value of…

Casually introduced thirty years ago, a simple algebraic equation of degree 4, with coefficients in Fp[T], has a solution in the field of power series in 1/T, over the finite field Fp. For each prime p > 3, the continued fraction expansion…

In this paper, we will show that the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers is unusually large. This generalizes the very recent results by the author and by A. Dubickas, which are both…

This paper presents a polynomial-time $1/2$-approximation algorithm for maximizing nonnegative $k$-submodular functions. This improves upon the previous $\max\{1/3, 1/(1+a)\}$-approximation by Ward and \v{Z}ivn\'y~(SODA'14), where…

Single variable hypergeometric functions pFq arise in connection with the power series solution of the Schrodinger equation or in the summation of perturbation expansions in quantum mechanics. For these applications, it is of interest to…

In this paper, we first study the sharp weak estimate for the $p$-adic $n$-dimensional fractional Hardy operator from $L^p$ to $L^{q,\infty}$. Secondly, we study the sharp bounds for the $m$-linear $n$-dimensional $p$-adic integral operator…

In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…

We analyze algorithms for computing the $n$th prime $p_n$ and establish asymptotic bounds for several approaches. Using existing results on the complexity of evaluating the prime-counting function $\pi(x)$, we show that the binary search…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

In the paper it is shown that there exist infinite classes of fast DFT algorithms having multiplicative complexity lower than O(NlogN), i.e. smaller than their arithmetical complexity. The derivation starts with nesting of Discrete Fourier…

The concept of p-ordering for a prime p was introduced by Manjul Bhargava (in his PhD thesis) to develop a generalized factorial function over an arbitrary subset of integers. This notion of p-ordering provides a representation of…

We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…

For certain class of hypergeometric functions ${}_3F_2$ with rational parameters, we give a sufficient condition for the special value at $1$ to be expressed in terms of logarithms of algebraic numbers. We give two proofs, both of which are…

(Quoted from the article) This article pursue the series, initiated by [Ric14], dedicated to Pulita's {\pi}-exponentials and p-adic differential equation of rank one with coefficients a polynomial in a ultrametric extension of the field of…

Maximizing a DR-submodular function subject to a general convex set is an NP-hard problem arising from many applications in combinatorial optimization and machine learning. While it is highly desirable to design efficient approximation…

E. Bach, following an idea of T. Itoh, has shown how to build a small set of numbers modulo a prime p such that at least one element of this set is a generator of $\pF{p}$\cite{Bach:1997:sppr,Itoh:2001:PPR}. E. Bach suggests also that at…

Let $p\in\mathbb{Z}[x]$ be an arbitrary polynomial of degree $n$ with $k$ non-zero integer coefficients of absolute value less than $2^\tau$. In this paper, we answer the open question whether the real roots of $p$ can be computed with a…

In this paper we give an algorithm to calculate the coefficients of the p-adic expansion of a rational numbers, and we give a method to decide whether this expansion is periodic or ultimately periodic.