English
Related papers

Related papers: A Division Algorithm Approach to $p$-Adic Sylveste…

200 papers

In number theory, we know Legendre's formula $ v_p(n!) = \sum_{k \ge 1} \lfloor \frac{n}{p^k} \rfloor $, which calculates the $p$-adic valuation of the factorial, i.e. the exponent of the greatest power of a prime $p$ that divides $n!$.…

Number Theory · Mathematics 2019-07-30 Gennady Eremin

The paper deals with a construction of a separating system of rational invariants for finite dimensional generic algebras. In the process of dealing an approach to a rough classification of finite dimensional algebras is offered by…

Rings and Algebras · Mathematics 2018-01-17 U. Bekbaev

We consider summation of some finite and infinite functional p-adic series with factorials. In particular, we are interested in the infinite series which are convergent for all primes p, and have the same integer value for an integer…

Number Theory · Mathematics 2014-11-18 Branko Dragovich , Natasa Z. Misic

Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…

Symbolic Computation · Computer Science 2025-11-03 Bertrand Teguia Tabuguia

We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…

Statistics Theory · Mathematics 2009-09-29 Andrew R. Barron , Albert Cohen , Wolfgang Dahmen , Ronald A. DeVore

The goal of this paper is to show a (derived) $p$-adic Simpson correspondence for (locally) unipotent coefficients on smooth rigid-analytic varieties. Our results depend on a deformation to $\mathbf{B}_\mathtt{dr}^+/\xi^2$, and not on a…

Algebraic Geometry · Mathematics 2024-03-08 Thiago Solovera e Nery

Gosper developed an algorithm for performing arithmetic operations on continued fractions (CFs), getting a CF as the result. Straightforward implementation of the algorithm leads to infinite loops on some inputs. Here we present a modified…

Combinatorics · Mathematics 2025-08-20 Michael J. Collins

The submodular maximization problem is widely applicable in many engineering problems where objectives exhibit diminishing returns. While this problem is known to be NP-hard for certain subclasses of objective functions, there is a greedy…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-01 Haoyuan Sun , David Grimsman , Jason R Marden

In this paper, we present some generalizations of Lagrange's theorem in the classical theory of continued fractions motivated by the geometric interpretation of the classical theory in terms of closed geodesics on the modular curve. As a…

Number Theory · Mathematics 2017-12-25 Hohto Bekki

We construct Fourier transforms relating functions and distributions on finite height $p$-divisible rigid analytic groups and objects in a dual category of $\mathbb{Z}_p$-local systems with analyticity conditions. Our Fourier transforms are…

Number Theory · Mathematics 2025-07-09 Andrew Graham , Pol van Hoften , Sean Howe

We develop a full 6-functor formalism for $p$-torsion \'etale sheaves in rigid-analytic geometry. More concretely, we use the recently developed condensed mathematics by Clausen--Scholze to associate to every small v-stack (e.g.…

Algebraic Geometry · Mathematics 2022-06-07 Lucas Mann

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…

Mathematical Physics · Physics 2018-01-17 U. A. Rozikov , Z. T. Tugyonov

In this paper, using $p$-adic analysis and $p$-adic L-functions, we show how to extend classical congruences (due to Wilson, Gauss, Dirichlet, Jacobi, Wolstenholme, Glaisher, Morley, Lemher and other people) to modulo $p^k$ for any $k>0$.

Number Theory · Mathematics 2018-04-24 Xianzu Lin

The problem of computing functions of values at the nodes in a network in a totally distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer,…

Networking and Internet Architecture · Computer Science 2007-05-23 Damon Mosk-Aoyama , Devavrat Shah

The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity which is uniformly linear whith respect to the degree of the extension. Recently, Randriambololona has generalized…

Algebraic Geometry · Mathematics 2016-11-10 Stéphane Ballet , Nicolas Baudru , Alexis Bonnecaze , Mila Tukumuli

A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…

Representation Theory · Mathematics 2020-06-19 Sajid Ali , Hassan Azad , Indranil Biswas , Willem A. de Graaf

Continued fractions have been introduced in the field of $p$--adic numbers $\mathbb{Q}_p$ by several authors. However, a standard definition is still missing since all the proposed algorithms are not able to replicate all the properties of…

Number Theory · Mathematics 2022-02-21 Nadir Murru , Giuliano Romeo , Giordano Santilli

In this article, we propose a $p$-adic analogue of complex Hilbert space and consider generalizations of some well-known theorems from functional analysis and the basic study of operators on Hilbert spaces. We compute the $K$-theory of the…

Operator Algebras · Mathematics 2019-07-17 Anton Claußnitzer , Andreas Thom

An S-adic expansion of an infinite word is a way of writing it as the limit of an infinite product of substitutions (i.e., morphisms of a free monoid). Such a description is related to continued fraction expansions of numbers and vectors. A…

Dynamical Systems · Mathematics 2017-07-19 Valérie Berthé , Vincent Delecroix

Simplicial partitions are a fundamental structure in computational geometry, as they form the basis of optimal data structures for range searching and several related problems. Current algorithms are built on very specific spatial…

Computational Geometry · Computer Science 2025-01-15 Mónika Csikós , Alexandre Louvet , Nabil Mustafa
‹ Prev 1 3 4 5 6 7 10 Next ›