Related papers: On the $p$-adic Skolem Problem

For any real polynomial $p(x)$ of even degree $n$, Shapiro [{\it Arnold Math. J.} 1(1) (2015), 91--99] conjectured that the sum of the number of real zeros of $(n-1)(p')^2 - np p''$ and the number of real zeros of $p$ is positive. We…

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note that the family of paddable languages apparently includes all…

The problem of finding a nonzero solution of a linear recurrence $Ly = 0$ with polynomial coefficients where $y$ has the form of a definite hypergeometric sum, related to the Inverse Creative Telescoping Problem of [14][Sec. 8], has now…

We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message $M$ can be deduced from a set of messages $\Gamma$ under the theory of blind signatures and arbitrary convergent…

Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…

Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…

An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates "almost surely". Proving that can be hard, and this paper presents a new method for doing so; it…

This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all feasible solutions have irrational entries, numerical…

We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…

We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of…

Let p be a fixed prime number. Let K be a totally real number field of discriminant D\_K and let T\_K be the torsion group of the Galois group of the maximal abelian p-ramified pro-p-extension of K (under Leopoldt's conjecture). We…

The $p$-adic Littlewood Conjecture due to De Mathan and Teuli\'e asserts that for any prime number $p$ and any real number $\alpha$, the equation $$\inf_{|m|\ge 1} |m|\cdot |m|_p\cdot |\langle m\alpha \rangle|\, =\, 0 $$ holds. Here, $|m|$…

We are interested in solving decision problem $\exists? t \in \mathbb{N}, \cos t \theta = c$ where $\cos \theta$ and $c$ are algebraic numbers. We call this the $\cos t \theta$ problem. This is an exploration of Diophantine equations with…

In this paper we consider the $p$-Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$-norm of its Hamming distances to the strings. Specifically, given a set of…

Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that…

The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…

We consider first the zero-nonzero determination problem, which consists in determining the list of zero-nonzero conditions realized by a finite list of polynomials on a finite set Z included in C^k with C an algebraic closed field. We…

The Skolem problem and the related Positivity problem for linear recurrence sequences are outstanding number-theoretic problems whose decidability has been open for many decades. In this paper, the inherent mathematical difficulty of a…

In the classical theory of $L$-series, the exact order (of zero) at a trivial zero is easily computed via the functional equation. In the characteristic $p$ theory, it has long been known that a functional equation of classical $s\mapsto…