Searcharxiv⌕ Search

arXiv subjects

Serge Vladuts

Publications and source records attributed to Serge Vladuts.

14 recordsLinked to original sources
arXiv2024

Quadratic residue patterns, algebraic curves and a K3 surface

Quadratic residue patterns modulo a prime are studied since 19th century. In the first part we extend existing results on the number of consecutive $\ell$-tuples of quadratic residues, studying corresponding algebraic curves and their jacobians, which happen to be products of jacobians of hyperelliptic curves. In the second part we state the last unpublished result of Lydia Goncharova on squares such that their differences are also squares, reformulate it in terms of algebraic geometry of a K3 surface, and prove it. The core of this theorem is an unexpected relation between the number of points on the K3 surface and that on a CM elliptic curve.

math.AG↗
arXiv2023

Quadratic residue patterns and point counting on K3 surfaces

Quadratic residue patterns modulo a prime are studied since 19th century. We state the last unpublished result of Lydia Goncharova, reformulate it and prior results in terms of algebraic geometry, and prove it. The core of this theorem is an unexpected relation between the number of points on a K3 surface and that on a CM elliptic curve.

math.AG↗
arXiv2019

Codes with hierarchical locality from covering maps of curves

Locally recoverable (LRC) codes provide ways of recovering erased coordinates of the codeword without having to access each of the remaining coordinates. A subfamily of LRC codes with hierarchical locality (H-LRC codes) provides added flexibility to the construction by introducing several tiers of recoverability for correcting different numbers of erasures. We present a general construction of codes with 2-level hierarchical locality from maps between algebraic curves and specialize it to several code families obtained from quotients of curves by a subgroup of the automorphism group, including rational, elliptic, Kummer, and Artin-Schreier curves. We further address the question of H-LRC codes with availability, and suggest a general construction of such codes from fiber products of curves. Detailed calculations of parameters for H-LRC codes with availability are performed for Reed-Solomon- and Hermitian-like code families. Finally, we construct asymptotically good families of H-LRC codes from curves related to the Garcia-Stichtenoth tower.

cs.IT↗
arXiv2016

Locally recoverable codes on algebraic curves

A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the encoding is a function of a small number (at most $r$) other symbols of the codeword. In this paper we introduce a construction of LRC codes on algebraic curves, extending a recent construction of Reed-Solomon like codes with locality. We treat the following situations: local recovery of a single erasure, local recovery of multiple erasures, and codes with several disjoint recovery sets for every coordinate (the {\em availability problem}). For each of these three problems we describe a general construction of codes on curves and construct several families of LRC codes. We also describe a construction of codes with availability that relies on automorphism groups of curves.

cs.IT↗
arXiv2015

On the Doubly Sparse Compressed Sensing Problem

A new variant of the Compressed Sensing problem is investigated when the number of measurements corrupted by errors is upper bounded by some value l but there are no more restrictions on errors. We prove that in this case it is enough to make 2(t+l) measurements, where t is the sparsity of original data. Moreover for this case a rather simple recovery algorithm is proposed. An analog of the Singleton bound from coding theory is derived what proves optimality of the corresponding measurement matrices.

cs.IT↗
arXiv2014

Singular solutions of conformal Hessian equation

We show that for any $ε\in ]0,1[$ there exists an analytic outside zero solution to a uniformly elliptic conformal Hessian equation in a ball $B\subset\R^5$ which belongs to $C^{1,ε} (B)\setminus C^{1,ε+} (B)$.

math.AP↗
arXiv2010

Singular Solutions of Hessian Fully Nonlinear Elliptic Equations

We study Hessian fully nonlinear uniformly elliptic equations and show that the second derivatives of viscosity solutions of those equations (in 12 or more dimensions) can blow up in an interior point of the domain. We prove that the optimal interior regularity of such solutions is no more than C^{1+ε}, showing the optimality of the known interior regularity result. The same is proven for Isaacs equations. We prove the existence of non-smooth solutions to fully nonlinear Hessian uniformly elliptic equations in 11 dimensions. We study also the possible singularity of solutions of Hessian equations defined in a neighborhood of a point and prove that a homogeneous order 0<α<1 solution of a Hessian uniformly elliptic equation in a punctured ball should be radial.

math.AP↗