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

We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras $USC(\mathcal{L})$ of sup-preserving…

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

Deciding termination is a fundamental problem in the analysis of probabilistic imperative programs. We consider the qualitative and quantitative probabilistic termination problems for an imperative programming model with discrete…

In this paper, we study the distribution of the cokernels of random $p$-adic matrices with fixed zero entries. Let $X_n$ be a random $n \times n$ matrix over $\mathbb{Z}_p$ in which some entries are fixed to be zero and the other entries…

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…

This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…

We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Many questions in number theory concern the nonvanishing of determinants of square matrices of logarithms (complex or p-adic) of algebraic numbers. We present a new conjecture that states that if such a matrix has vanishing determinant,…

The primary objective of this paper is the study of different instances of the elliptic Stark conjectures of Darmon, Lauder and Rotger, in a situation where the elliptic curve attached to the modular form $f$ has split multiplicative…

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…

In 1980, Gross conjectured a formula for the expected leading term at $s=0$ of the Deligne--Ribet $p$-adic $L$-function associated to a totally even character $\psi$ of a totally real field $F$. The conjecture states that after scaling by…

A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the…

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

A Skolem sequence is a sequence a_1,a_2,...,a_2n (where a_i \in A = {1,...,n }), each a_i occurs exactly twice in the sequence and the two occurrences are exactly a_i positions apart. A set A that can be used to construct Skolem sequences…

We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The characterization leads to a proof of what was known as the "runs" conjecture (Kolpakov \& Kucherov (FOCS '99)), which states that the…

We establish the existence theory of several commonly used finite element (FE) nonlinear fully discrete solutions, and the convergence theory of a linearized iteration. First, it is shown for standard FE, SUPG and edge-averaged method…

The Johnson-Lindenstrauss Lemma states that there exist linear maps that project a set of points of a vector space into a space of much lower dimension such that the Euclidean distance between these points is approximately preserved. This…

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…