Related papers: A New Characteristic-Uniform Model for Elliptic Curves -- Theory, Arithmetic, and Applications

A New Characteristic-Uniform Model for Elliptic Curves -- Theory, Arithmetic, and Applications

URL: http://arxiv.org/abs/2608.01675v4
Date: Mon, 10 Aug 2026 15:56:35 GMT
Title: A New Characteristic-Uniform Model for Elliptic Curves -- Theory, Arithmetic, and Applications
Abstract summary: We develop a characteristic-uniform arithmetic theory for [ mathcal C_d:quad (u2+u)(v2+v)=d.<n>For (d(1-16d)ne0), its smooth ( (2,2))-completion has four rational boundary points forming (mathbb Z/4mathbb Z), an (D_8)-action, the inverse (-(u,v)=(u,-v-1)), and the native Kummer map (_
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We develop a characteristic-uniform arithmetic theory for \[ \mathcal C_d:\quad (u^2+u)(v^2+v)=d. \] For $d(1-16d)\ne0$, its smooth $(2,2)$-completion has four rational boundary points forming $\mathbb Z/4\mathbb Z$, an intrinsic $D_8$-action, the inverse $-(u,v)=(u,-v-1)$, and the native Kummer map $κ_d(u,v)=(u+1)$. Working natively, we derive complete full-point and differential laws, Kummer ladders and recovery, halving, tripling, $2P+Q$, division polynomials, isogenies, CM endomorphisms, and pairings, with dedicated formulas in characteristics two and three. Classical models provide proof and optimization dictionaries while all endpoints remain native. For Cd25519, the Kummer line is exactly the X25519 line, and a native Segre recoding realizes the optimized complete $a=-1$ Edwards full-point dependency graph. We further study \[ \begin{gathered} \mathcal C_{a,b,d}:(u^2+u+a)(v^2+v+b)=d,\quad \mathcal T_{a,d}:(u^2+u+a)(v^2+v)=d,\\ \mathcal R_{τ,σ,κ}:(x^2-τ)(y^2-σ)=κxy,\quad \mathcal Q_{α,β,γ}:x^2y^2+α(x^2+y^2)+βxy+γ=0. \end{gathered} \] For these product, one-sided twisted, reciprocal, and QRT families, we determine their genus-one geometry, finite-field forms, arithmetic, and isogenies. On each smooth QRT fibre, the Vieta--McMillan map is a fixed elliptic translation. Marking $D$ gives the state $P\mapsto(κ(P),κ(P+D))$, with maps realizing $n\mapsto mn+r$. This yields logarithmic ladders and an elliptic Lucas calculus with nonlinear addition, fast-index doubling, state-division polynomials, and bridges to elliptic divisibility sequences, sigma functions, and elliptic nets. In characteristic two, every ordinary pointed elliptic curve over a perfect field admits the binary state model.

Related papers

Optimal Neural Network Approximation via Empirical Least Squares with Deterministic Samples [7.864201093845001]
We develop a theory of discrete residual least-squares approximation for elliptic spectral equations $mathfrak L_u=f$ using linearized ReLU$k$ neural networks.<n>We establish a high-probability residual estimate, up to a logarithmic factor and an arbitrarily small smoothness loss.<n>The key analytical ingredient is a Bernstein inequality for linearized ReLU$k$ network spaces.
arXiv Detail & Related papers (2026-08-07T01:22:27Z)
A Bundle Isomorphism Relating Complex Velocity to Quantum Fisher Operators [0.0]
We show that averaging matter dynamics over gravitational fluctuations gives rise to a complex velocity field (_ = _ - i u_) living as a section of the pullback bundle (E = _2*(T*M)to mathcalCtimes M.<n>We prove that (_) is isomorphic, via the Schrdinger representation, to the symmetric logarithmic derivative (SLD) operator (L_) on the Hilbert space (mathcalH
arXiv Detail & Related papers (2026-04-14T01:35:43Z)
Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition [50.36362492608702]
We study entrywise scalar quantization of two matrices prior to multiplication.<n>We obtain a closed-form optimal point density [ star(u) propto exp!left(-fracu26right)bigl( (1-2)+2u22bigr), qquad u=fracx_X,, and prove a correlation-driven phase transition.
arXiv Detail & Related papers (2026-03-20T01:53:44Z)
Complexity Bounds for Hamiltonian Simulation in Unitary Representations [0.0]
We consider the Hamiltonian evolution [ U_X(t) coloneqq (exp(tX)) = et,d(X), qquad tinmathbbR.<n>We first describe how the Hamiltonian (d(X)) is distributed along the directions of root spaces $mathfrakg_$.<n>Our main result shows that for each fixed (Xinmathfrakg) there exists a constant such that
arXiv Detail & Related papers (2026-03-07T14:28:46Z)
Group theoretic quantization of punctured plane [0.0]
We establish an algebra homomorphism between the Lie algebra corresponding to the canonical group, $mathscrG = R2 rtimes (SO(2)times R+)$.<n>We deduce a quantization map that maps a subspace of classical observables, $fin Cinfty(M)$, to self-adjoint operators on the Hilbert space, $mathscrH$.
arXiv Detail & Related papers (2025-10-28T21:54:37Z)
Provably learning a multi-head attention layer [55.2904547651831]
Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
arXiv Detail & Related papers (2024-02-06T15:39:09Z)
A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
arXiv Detail & Related papers (2023-09-25T17:54:19Z)
Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
arXiv Detail & Related papers (2022-06-17T17:55:43Z)
Metric Hypertransformers are Universal Adapted Maps [4.83420384410068]
metric hypertransformers (MHTs) are capable of approxing any adapted map $F:mathscrXmathbbZrightarrow mathscrYmathbbZ$ with approximable complexity. Our results provide the first (quantimat) universal approximation theorem compatible with any such $mathscrX$ and $mathscrY$.
arXiv Detail & Related papers (2022-01-31T10:03:46Z)
On the Self-Penalization Phenomenon in Feature Selection [69.16452769334367]
We describe an implicit sparsity-inducing mechanism based on over a family of kernels. As an application, we use this sparsity-inducing mechanism to build algorithms consistent for feature selection.
arXiv Detail & Related papers (2021-10-12T09:36:41Z)
Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization [49.090785356633695]
We study the asymmetric low-rank factorization problem: [mathbfU in mathbbRm min d, mathbfU$ and mathV$.
arXiv Detail & Related papers (2021-06-27T17:25:24Z)
Stochastic behavior of outcome of Schur-Weyl duality measurement [45.41082277680607]
We focus on the measurement defined by the decomposition based on Schur-Weyl duality on $n$ qubits. We derive various types of distribution including a kind of central limit when $n$ goes to infinity.
arXiv Detail & Related papers (2021-04-26T15:03:08Z)
Accelerated Gradient Tracking over Time-varying Graphs for Decentralized Optimization [59.65871549878937]
We prove that the practical single loop accelerated gradient tracking needs $O(fracgamma1-sigma_gamma)2sqrtfracLepsilon)$.<n>Our convergence rates improve significantly over the ones of $O(frac1epsilon5/7)$ and $O(fracLmu)5/7frac1 (1-sigma)1.5logfrac1epsilon)$.
arXiv Detail & Related papers (2021-04-06T15:34:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.