English
Related papers

Related papers: The Discrete Lambert Map

200 papers

A generalized matrix-pencil approach is proposed for the estimation of complex exponential components with segmented signal samples, which is very efficient and provides super-resolution estimations. It is applicable to the signals sampled…

Signal Processing · Electrical Eng. & Systems 2022-10-28 Jianping Wang , Alexander Yarovoy

For a prime $p$ and a positive integer $s$ consider a homogeneous linear system over the ring $\mathbb{Z}_{p^s}$ (the ring of integers modulo $p^s$) described by an $n \times m$-matrix. The possible number of solutions to such a system is…

Number Theory · Mathematics 2025-07-08 Marcus Nilsson

Let K be the totally real cubic field of discriminant 49, let O be its ring of integers, and let p be the prime over 7. Let Gamma (p)\subset Gamma = SL_2(O) be the principal congruence subgroup of level p. This paper investigates the…

Number Theory · Mathematics 2011-08-10 Lev A. Borisov , Paul E. Gunnells

In this paper, we investigate inexact variants of dual-primal isogeometric tearing and interconnecting methods for solving large-scale systems of linear equations arising from Galerkin isogeometric discretizations of elliptic boundary value…

Numerical Analysis · Mathematics 2021-12-30 Christoph Hofer , Ulrich Langer , Stefan Takacs

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

Let $p$ be an odd prime. The factorization of the polynomial $x^{p+1}-1$ over the integer residue ring $\mathbb{Z}_{p^e}$ is pivotal for constructing cyclic codes with Hermitian symmetry, a critical resource for Linear Complementary Dual…

Information Theory · Computer Science 2026-04-22 Yongchao Wang , Yang Ding , Jiansheng Yang , Zhiqiu Huang

Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? The author and Pieter Moree, building on work of Zhang, Cobeli, and Zaharescu, gave heuristics for…

Number Theory · Mathematics 2007-05-23 Joshua Holden

Various applications involve assigning discrete label values to a collection of objects based on some pairwise noisy data. Due to the discrete---and hence nonconvex---structure of the problem, computing the optimal assignment (e.g.~maximum…

Information Theory · Computer Science 2017-12-11 Yuxin Chen , Emmanuel Candes

Given an odd prime $p$, we provide formulas for the Hensel lifts of polynomial roots modulo $p$, and give an explicit factorization over the ring of formal power series with integer coefficients for certain reducible polynomials whose…

Number Theory · Mathematics 2014-12-17 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…

Dynamical Systems · Mathematics 2013-06-18 Piergiulio Tempesta

It has recently been shown that cryptographic trilinear maps are sufficient for achieving indistinguishability obfuscation. In this paper we develop a method for constructing such maps on the Weil descent (restriction) of abelian varieties…

Cryptography and Security · Computer Science 2019-09-16 Ming-Deh A. Huang

Cheng and Wan have related the decoding of Reed-Solomon codes to the computation of discrete logarithms over finite fields, with the aim of proving the hardness of their decoding. In this work, we experiment with solving the discrete…

Number Theory · Mathematics 2012-02-22 Daniel Augot , François Morain

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

General Mathematics · Mathematics 2017-08-11 Yochay Jerby

We prove the convergence of a wide stencil finite difference scheme to the Aleksandrov solution of the elliptic Monge-Ampere equation when the right hand side is a sum of Dirac masses. The discrete scheme we analyze for the Dirichlet…

Numerical Analysis · Mathematics 2019-11-01 Gerard Awanou

We report recent progress in the problem of distinguishing convex subsets of cyclotomic model sets $\varLambda$ by (discrete parallel) X-rays in prescribed $\varLambda$-directions. It turns out that for any of these model sets $\varLambda$…

Mathematical Physics · Physics 2013-05-08 Christian Huck

We study congruences modulo powers of a prime $p$ between pairs of $p$-new modular Hecke eigenforms of level $\Gamma_0(p)$ and same weight $k$. Based on explicit computations, we conjecture that every such eigenform $f$ admits a twin to…

Number Theory · Mathematics 2026-02-18 Andrea Conti , Peter Mathias Gräf

It is conjectured that the Markoff equation $X^2+Y^2+Z^2=3XYZ$ satisfies the special Diophantine property that every mod $p$ solution lifts to an integer solution. Progress toward this conjecture has been made by studying the connectedness…

Number Theory · Mathematics 2025-12-01 Elisa Bellah , Claire Dunn , Vernon Naidu , Alette Wells

Consider the discrete maximal function acting on finitely supported functions on the integers, \[ \mathcal{C}_\Lambda f(n) := \sup_{\lambda \in \Lambda} | \sum_{p \in \pm \mathbb{P}} f(n-p) \log |p| \frac{e^{2\pi i \lambda p}}{p} |,\] where…

Classical Analysis and ODEs · Mathematics 2016-05-02 Laura Cladek , Kevin Henriot , Ben Krause , Izabella Laba , Malabika Pramanik

It has been shown recently that cryptographic trilinear maps are sufficient for achieving indistinguishability obfuscation. In this paper we develop algebraic blinding techniques for constructing such maps. An earlier approach involving…

Cryptography and Security · Computer Science 2020-04-22 Ming-Deh A. Huang

We consider the problem of estimating sparse discrete distributions under local differential privacy (LDP) and communication constraints. We characterize the sample complexity for sparse estimation under LDP constraints up to a constant…

Information Theory · Computer Science 2021-02-22 Jayadev Acharya , Peter Kairouz , Yuhan Liu , Ziteng Sun
‹ Prev 1 4 5 6 7 8 10 Next ›