Related papers: Tracking p-adic precision
We present a method for sampling points from an algebraic manifold, either affine or projective, defined over a local field, with a prescribed probability distribution. Inspired by the work of Breiding and Marigliano on sampling real…
The Paterson--Stockmeyer method is an evaluation scheme for matrix polynomials with scalar coefficients that arise in many state-of-the-art algorithms based on polynomial or rational approximation, for example, those for computing…
This work describes extensions to existing level-set algorithms developed for application within the field of Atom Probe Tomography (APT). We present a new simulation tool for the simulation of 3D tomographic volumes, using advanced level…
In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…
The aim of this paper is to present an algorithm the complexity of which is polynomial to compute the semi-simplified modulo $p$ of a semi-stable $\Q_p$-representation of the absolute Galois group of a $p$-adic field (\emph{i.e.} a finite…
In this paper adapting to $p$-adic case some methods of real valued Gibbs measures on Cayley trees we construct several $p$-adic distributions on the set $\mathbb{Z}_p$ of $p$-adic integers. Moreover, we give conditions under which these…
We present a version of Smale's $\alpha$-theory for ultrametric fields, such as the $p$-adics and their extensions, which gives us a multivariate version of Hensel's lemma.
The notion of a $p$-adic superspace is introduced and used to give a transparent construction of the Frobenius map on $p$-adic cohomology of a smooth projective variety over $\zp$ (the ring of $p$-adic integers), as well as an alternative…
We study the properties of ultrametric matrices aiming to design methods for fast ultrametric matrix-vector multiplication. We show how to encode such a matrix as a tree structure in quadratic time and demonstrate how to use the resulting…
This paper provides a review of Approximate Bayesian Computation (ABC) methods for carrying out Bayesian posterior inference, through the lens of density estimation. We describe several recent algorithms and make connection with traditional…
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a $p$-adic lifting technique combined with the use of block matrices with structured blocks. It achieves a sub-cubic…
We take the trace of Von-Neumann's ergodic theorem and get a trace formula of a unitary matrix family. It is an extension of Poisson summation formula in higher dimension. We also construct a family of crystalline measure with complex…
Recently Ono, Saad and the second author \cite{KHN} initiated a study of value distribution of certain families of Gaussian hypergeometric functions over large finite fields. They investigated two families of Gaussian hypergeometric…
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…
This article reports on an approach to point counting on algebraic varieties over finite fields that is based on a detailed investigation of the $2$-adic orthogonal group. Combining the new approach with a $p$-adic method, we count the…
We introduce LocoTrack, a highly accurate and efficient model designed for the task of tracking any point (TAP) across video sequences. Previous approaches in this task often rely on local 2D correlation maps to establish correspondences…
We describe a method for predicting a classification of an object given classifications of the objects in the training set, assuming that the pairs object/classification are generated by an i.i.d. process from a continuous probability…
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…
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
In this paper we develop a theory of class invariants associated to $p$-adic representations of absolute Galois groups of number fields. Our main tool for doing this involves a new way of describing certain Selmer groups attached to…