English
Related papers

Related papers: Deconstructing the Welch Equation Using $p$-adic M…

200 papers

In this article, we consider the estimation of exponential sums along the points of the reduction mod $p^{m}$ of a $p$-adic analytic submanifold of $ \mathbb{Z}_{p}^{n}$. More precisely, we extend Igusa's stationary phase method to this…

Algebraic Geometry · Mathematics 2011-01-20 Dirk Segers , W. A. Zuniga-Galindo

In this paper, we consider Griesmer codes, namely those linear codes meeting the Griesmer bound. Let $C$ be an $[n,k,d]_q$ Griesmer code with $q=p^f$, where $p$ is a prime and $f\ge1$ is an integer. In 1998, Ward proved that for $q=p$, if…

Combinatorics · Mathematics 2025-06-10 Haihua Deng , Hexiang Huang , Qing Xiang

We make many new observations on primitive roots modulo primes. For an odd prime $p$ and an integer $c$, we establish a theorem concerning $\sum_g(\frac{g+c}p)$, where $g$ runs over all the primitive roots modulo $p$ among $1,\ldots,p-1$,…

Number Theory · Mathematics 2020-03-02 Zhi-Wei Sun

Quadratic functions have applications in cryptography. In this paper, we investigate the modular quadratic equation $$ ax^2+bx+c=0 \quad (mod \,\, 2^n), $$ and provide a complete analysis of it. More precisely, we determine when this…

Number Theory · Mathematics 2017-11-13 S. M. Dehnavi , M. R. Mirzaee Shamsabad , A. Mahmoodi Rishakani

Let $p$ be an odd prime. In this paper we investigate quadratic residues modulo $p$ and related permutations, congruences and identities. If $a_1<\ldots<a_{(p-1)/2}$ are all the quadratic residues modulo $p$ among $1,\ldots,p-1$, then the…

Number Theory · Mathematics 2019-07-10 Zhi-Wei Sun

In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…

Number Theory · Mathematics 2016-08-10 Evan P. Dummit , Márton Hablicsek , Robert Harron , Lalit Jain , Robert Pollack , Daniel Ross

Consider the classical ElGamal digital signature scheme based on the modular relation $\alpha^m\equiv y^r\, r^s\ [p]$. In this work, we prove that if we can compute a natural integer $i$ such that $\alpha^i\ mod\ p$ is smooth and divides…

Cryptography and Security · Computer Science 2015-09-07 Omar Khadir

We give a methodology for solving the chiral equations $(\alpha g_{,z} g^{-1})_{,\overline z} + (\alpha g_{,\overline z} g^{-1})_{,z} \ = \ 0 $ where $g$ belongs to some Lie group $G$. The solutions are writing in terms of Harmonic maps.…

High Energy Physics - Theory · Physics 2022-11-08 Tonatiuh Matos

Let $p$ be an odd prime. For any $p$-adic integer $a$ we let $\overline{a}$ denote the unique integer $x$ with $-p/2<x<p/2$ and $x-a$ divisible by $p$. In this paper we study some permutations involving quadratic residues modulo $p$. For…

Number Theory · Mathematics 2025-03-04 Hai-Liang Wu

An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…

Numerical Analysis · Mathematics 2016-06-28 Daniel Gebremedhin , Charles Weatherford

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

Algebraic Geometry · Mathematics 2016-12-23 Nardo Gimenez , Guillermo Matera

Let $s_d(p,a) = \min \{k | a = \sum_{i=1}^{k}a_i^d, a_i\in \ff_p^*\}$ be the smallest number of d-th powers in the finite field F_p, sufficient to represent the number a in F_p^*. Then $$g_d(p) = max_{a in F_p^*} s_d(p,a)$$ gives an answer…

Number Theory · Mathematics 2007-05-23 Monica del Pilar Canales

A Lehmer number modulo a prime $p$ is an integer $a$ with $1 \leq a \leq p-1$ whose inverse $\bar{a}$ within the same range has opposite parity. Lehmer numbers that are also primitive roots have been discussed by Wang and Wang in an…

Number Theory · Mathematics 2017-12-13 Stephen D. Cohen , Tim Trudgian

In this paper, we study groups of automorphisms of algebraic systems over a set of $p$-adic integers with different sets of arithmetic and coordinate-wise logical operations and congruence relations modulo $p^k,$ $k\ge 1.$ The main result…

Number Theory · Mathematics 2018-06-01 Ekaterina Yurova Axelsson , Andrei Khrennikov

Let $p>3$ be a prime, and let $a$ be a rational $p$-adic integer, using WZ method we establish the congruences modulo $p^3$ for $$\sum_{k=0}^{p-1} \binom ak\binom{-1-a}k\binom{2k}k\frac {w(k)}{4^k},$$ where $$w(k)=1,\frac 1{k+1},\frac…

Number Theory · Mathematics 2022-02-15 Zhi-Hong Sun

We prove a $p$-adic version of the Integral Geometry Formula for averaging the intersection of two $p$-adic projective algebraic sets. We apply this result to give bounds on the number of points in the modulo $p^m$ reduction of a projective…

Algebraic Geometry · Mathematics 2019-08-14 Avinash Kulkarni , Antonio Lerario

In this work we study global boundedness and exponential integrability of weak solutions to degenerate $p$-Poisson equations using an iterative method of De Giorgi type. Given a symmetric, non-negative definite matrix valued function $Q$…

Analysis of PDEs · Mathematics 2023-09-11 Sullivan Francis MacDonald , Scott Rodney

We discuss algorithms for arithmetic properties of hypergeometric functions. Most notably, we are able to compute the p-adic valuation of a hypergeometric function on any disk of radius smaller than the p-adic radius of convergence. This we…

Number Theory · Mathematics 2026-02-06 Xavier Caruso , Florian Fürnsinn

This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms p^m, or 2p^m where p is an odd large prime and m is a positive integer. It is another…

Cryptography and Security · Computer Science 2014-05-06 Hayder Raheem Hashim

We obtain a new coding and decoding method using the generalized Pell $(p,i)$ -numbers. The relations among the code matrix elements, error detection and correction have been established for this coding theory. We give two new blocking…

Number Theory · Mathematics 2017-06-15 Nihal Taş , Sümeyra Uçar , Nihal Yılmaz Özgür