More Like this

1. Variation of canonical height for\break Fatou points on ℙ 1

   https://doi.org/10.1515/crelle-2022-0078  

   DeMarco, Laura ; Mavraki, Niki Myrto ( December 2022 , Journal für die reine und angewandte Mathematik (Crelles Journal))

   Abstract Let f : ℙ 1 → ℙ 1 {f:\mathbb{P}^{1}\to\mathbb{P}^{1}} be a map of degree > 1 {>1} defined over a function field k = K ⁢ ( X ) {k=K(X)} , where K is a number field and X is a projective curve over K . For each point a ∈ ℙ 1 ⁢ ( k ) {a\in\mathbb{P}^{1}(k)} satisfying a dynamical stability condition, we prove that the Call–Silverman canonical height for specialization f t {f_{t}} at point a t {a_{t}} , for t ∈ X ⁢ ( ℚ ¯ ) {t\in X(\overline{\mathbb{Q}})} outside a finite set, induces a Weil height on the curve X ; i.e., we prove the existence of a ℚ {\mathbb{Q}} -divisor D = D f , a {D=D_{f,a}} on X so that the function t ↦ h ^ f t ⁢ ( a t ) - h D ⁢ ( t ) {t\mapsto\hat{h}_{f_{t}}(a_{t})-h_{D}(t)} is bounded on X ⁢ ( ℚ ¯ ) {X(\overline{\mathbb{Q}})} for any choice of Weil height associated to D . We also prove a local version, that the local canonical heights t ↦ λ ^ f t , v ⁢ ( a t ) {t\mapsto\hat{\lambda}_{f_{t},v}(a_{t})} differ from a Weil function for D by a continuous function on X ⁢ ( ℂ v ) {X(\mathbb{C}_{v})} , at each place v of the number field K . These results were known for polynomial maps f and all points a ∈ ℙ 1 ⁢ ( k ) {a\in\mathbb{P}^{1}(k)} without the stability hypothesis,[21, 14],and for maps f that are quotients of endomorphisms of elliptic curves E over k and all points a ∈ ℙ 1 ⁢ ( k ) {a\in\mathbb{P}^{1}(k)} . [32, 29].Finally, we characterize our stability condition in terms of the geometry of the induced map f ~ : X × ℙ 1 ⇢ X × ℙ 1 {\tilde{f}:X\times\mathbb{P}^{1}\dashrightarrow X\times\mathbb{P}^{1}} over K ; and we prove the existence of relative Néron models for the pair ( f , a ) {(f,a)} , when a is a Fatou point at a place γ of k , where the local canonical height λ ^ f , γ ⁢ ( a ) {\hat{\lambda}_{f,\gamma}(a)} can be computed as an intersection number. 

   more » « less
2. Bivariate Dimension Polynomials of Non-Reflexive Prime Difference-Differential Ideals. The Case of One Translation

   Levin, A. ( July 2018 , Proceedings of the 43rd International Symposium on Symbolic and Algebraic Computation (ISSAC 2018))

   We use the method of characteristic sets with respect to two term orderings to prove the existence and obtain a method of computation of a bivariate dimension polynomial associated with a non-reflexive difference-differential ideal in the algebra of difference-differential polynomials with several basic derivations and one translation. As a consequence, we obtain a new proof and a method of computation of the dimension polynomial of a non-reflexive prime difference ideal in the algebra of difference polynomials over an ordinary difference field. We also discuss applications of our results to systems of algebraic difference-differential equations. 

   more » « less
3. Proximity Gaps for Reed–Solomon Codes

   https://doi.org/10.1145/3614423  

   Ben-Sasson, Eli ; Carmon, Dan ; Ishai, Yuval ; Kopparty, Swastik ; Saraf, Shubhangi ( August 2023 , Journal of the ACM)

   A collection of sets displays aproximity gapwith respect to some property if for every set in the collection, either (i) all members areδ-close to the property in relative Hamming distance or (ii) only a tiny fraction of members areδ-close to the property. In particular, no set in the collection has roughly half of its membersδ-close to the property and the othersδ-far from it.

   We show that the collection of affine spaces displays a proximity gap with respect to Reed–Solomon (RS) codes, even over small fields, of size polynomial in the dimension of the code, and the gap applies to anyδsmaller than the Johnson/Guruswami–Sudan list-decoding bound of the RS code. We also show near-optimal gap results, over fields of (at least)linearsize in the RS code dimension, forδsmaller than the unique decoding radius. Concretely, ifδis smaller than half the minimal distance of an RS code\(V\subset {\mathbb {F}}_q^n \), every affine space is either entirelyδ-close to the code, or alternatively at most an (n/q)-fraction of it isδ-close to the code. Finally, we discuss several applications of our proximity gap results to distributed storage, multi-party cryptographic protocols, and concretely efficient proof systems.

   We prove the proximity gap results by analyzing the execution of classical algebraic decoding algorithms for Reed–Solomon codes (due to Berlekamp–Welch and Guruswami–Sudan) on aformal elementof an affine space. This involves working with Reed–Solomon codes whose base field is an (infinite) rational function field. Our proofs are obtained by developing an extension (to function fields) of a strategy of Arora and Sudan for analyzing low-degree tests.

    

   more » « less
4. Reduction with Respect to the Effective Order and a New Type of Dimension Polynomials of Difference Modules

   https://doi.org/10.1145/3476446.3535497  

   Levin, Alexander ( July 2022 , 2022 International Symposium on Symbolic and Algebraic Computation)

   General Chair: Marc Moreno Chair: Lihong Zhi (Ed.)

   We introduce a new type of reduction in a free difference module over a difference field that uses a generalization of the concept of effective order of a difference polynomial. Then we define the concept of a generalized characteristic set of such a module, establish some properties of these characteristic sets and use them to prove the existence, outline a method of computation and find invariants of a dimension polynomial in two variables associated with a finitely generated difference module. As a consequence of these results, we obtain a new type of bivariate dimension polynomials of finitely generated difference field extensions. We also explain the relationship between these dimension polynomials and the concept of Einstein’s strength of a system of difference equations. 

   more » « less
5. Uniform stability for local discontinuous Galerkin methods with implicit-explicit Runge-Kutta time discretizations for linear convection-diffusion equation

   https://doi.org/10.1090/mcom/3842  

   Wang, Haijin ; Li, Fengyan ; Shu, Chi-Wang ; Zhang, Qiang ( November 2023 , Mathematics of Computation)

   In this paper, we consider the linear convection-diffusion equation in one dimension with periodic boundary conditions, and analyze the stability of fully discrete methods that are defined with local discontinuous Galerkin (LDG) methods in space and several implicit-explicit (IMEX) Runge-Kutta methods in time. By using the forward temporal differences and backward temporal differences, respectively, we establish two general frameworks of the energy-method based stability analysis. From here, the fully discrete schemes being considered are shown to have monotonicity stability, i.e. the$L^2$norm of the numerical solution does not increase in time, under the time step condition$\tau \le \mathcal {F}(h/c, d/c^2)$, with the convection coefficient$c$, the diffusion coefficient$d$, and the mesh size$h$. The function$\mathcal {F}$depends on the specific IMEX temporal method, the polynomial degree$k$of the discrete space, and the mesh regularity parameter. Moreover, the time step condition becomes$\tau \lesssim h/c$in the convection-dominated regime and it becomes$\tau \lesssim d/c^2$in the diffusion-dominated regime. The result is improved for a first order IMEX-LDG method. To complement the theoretical analysis, numerical experiments are further carried out, leading to slightly stricter time step conditions that can be used by practitioners. Uniform stability with respect to the strength of the convection and diffusion effects can especially be relevant to guide the choice of time step sizes in practice, e.g. when the convection-diffusion equations are convection-dominated in some sub-regions.

    

   more » « less