Suchergebnisse - "[MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]"

Explicit lower bounds for the height in Galois extensions of number fields

Autoren: Jenvrin, Jonathan Institut Fourier (IF) Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)

Weitere Verfasser: Jenvrin, Jonathan Institut Fourier (IF) Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)

Quelle: Journal de théorie des nombres de Bordeaux. 37:469-477

Schlagwörter: 11G50, Mathematics - Number Theory, Height bounds, Galois extensions, FOS: Mathematics, Lehmer's problem, Number Theory (math.NT), [MATH]Mathematics [math], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

Zugangs-URL: http://arxiv.org/abs/2402.04908

Squares with a positive proportion of preassigned digits

Autoren: Swaenepoel, Cathy

Weitere Verfasser: Swaenepoel, Cathy

Quelle: Mathematische Annalen. 393:1385-1427

Schlagwörter: 2025. 2020 Mathematics Subject Classification. Primary 11A63. Secondary 11B83, August 20 2025. 2020 Mathematics Subject Classification. Primary 11A63. Secondary 11B83 11K36 11L07 Squares digits circle method Fourier transform, Fourier transform, digits, 11K36, August 20, 11L07 Squares, circle method, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-05236556v1
https://doi.org/10.1007/s00208-025-03253-z
https://hal.science/hal-05236556v1/document

An Algebraic Point of View on the Generation of Pairing-Friendly Curves

Autoren: Gasnier, Jean Guillevic, Aurore

Weitere Verfasser: Gasnier, Jean Guillevic, Aurore

Quelle: SIAM Journal on Applied Algebra and Geometry. 9:456-480

Schlagwörter: Pairing-based Cryptography, Elliptic Curves, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-04205681v3/document
https://doi.org/10.1137/23m1601961
https://hal.science/hal-04205681v3

A note on Buell’s Theorem on length four Büchi sequences

Autoren: Jaillet, Fabrice Vidaux, Xavier

Weitere Verfasser: Jaillet, Fabrice Vidaux, Xavier

Quelle: Cubo (Temuco). 27:1-5

Schlagwörter: Büchi's n-squares' problem, Representation of systems of quadratic forms, second difference of squares, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-05091876v1
https://hal.science/hal-05091876v1/document
https://doi.org/10.56754/0719-0646.2701.001

On the height of some generators of Galois extensions with big Galois group

Autoren: Jonathan Jenvrin Institut Fourier (IF) Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)

Weitere Verfasser: Jonathan Jenvrin Institut Fourier (IF) Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)

Quelle: Journal of Number Theory. 269:78-105

Schlagwörter: 11R32, Mathematics - Number Theory, Height bounds, 11G50, 11R32, Galois extensions, MSC: 11G50, FOS: Mathematics, Alternating group, Lehmer Conjecture, Number Theory (math.NT), [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

Zugangs-URL: http://arxiv.org/abs/2403.00500

Points de vue sur les valeurs aux entiers des formes quadratiques binaires

Autoren: Dal'Bo-Milonet, Françoise Jonchère, Laurent Hervé, Dominique et al.

Weitere Verfasser: Dal'Bo-Milonet, Françoise Jonchère, Laurent Hervé, Dominique et al.

Quelle: Journées mathématiques X-UPS. :1-47

Schlagwörter: [MATH] Mathematics [math], 11E10, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-04699736v1
https://doi.org/10.5802/xups.2007-01
https://hal.science/hal-04699736v1/document
https://hal.science/hal-00368090v1

Are the Collatz and abc Conjectures Related?

Autoren: Rozier, Olivier

Weitere Verfasser: Rozier, Olivier

Quelle: Experimental Mathematics. :1-10

Schlagwörter: Mathematics - Number Theory, abc-hits, Collatz conjecture, Wieferich primes, FOS: Mathematics, abc conjecture, Number Theory (math.NT), lower bound hypothesis, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2306.15284
https://hal.science/hal-04142385v3/document
https://doi.org/10.1080/10586458.2025.2470938
https://hal.science/hal-04142385v3

Computing isogenies from modular equations in genus two

Autoren: Jean Kieffer Aurel Page Damien Robert et al.

Weitere Verfasser: Jean Kieffer Aurel Page Damien Robert et al.

Quelle: Journal of Algebra. 666:331-386

Schlagwörter: Algorithm, Mathematics - Algebraic Geometry, Mathematics - Number Theory, Modular equations, Isogenies, [MATH.MATH-AG] Mathematics [math]/Algebraic Geometry [math.AG], FOS: Mathematics, Number Theory (math.NT), Abelian surfaces, 0101 mathematics, 01 natural sciences, Algebraic Geometry (math.AG), [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2001.04137
https://hal.science/hal-02436133v3/document
https://hal.science/hal-02436133v3
https://doi.org/10.1016/j.jalgebra.2024.11.029

Algorithms for computing norms and characteristic polynomials on general Drinfeld modules

Autoren: Caruso, Xavier Leudière, Antoine

Weitere Verfasser: Caruso, Xavier Leudière, Antoine

Quelle: Mathematics of Computation. 95:415-455

Schlagwörter: Computer Science - Symbolic Computation, FOS: Computer and information sciences, Mathematics - Number Theory, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], FOS: Mathematics, Anderson motives, Number Theory (math.NT), Symbolic Computation (cs.SC), algorithms, Drinfeld modules, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2307.02879
https://hal.science/hal-04151171v4
https://doi.org/10.48550/arxiv.2307.02879
https://hal.science/hal-04151171v4/document

AN ANALOGUE OF AN IDENTITY OF JACOBI

Autoren: HENG HUAT CHAN SONG HENG CHAN PATRICK SOLÉ et al.

Weitere Verfasser: HENG HUAT CHAN SONG HENG CHAN PATRICK SOLÉ et al.

Quelle: Bulletin of the Australian Mathematical Society. :1-8

Schlagwörter: Jacobi identity, Ramanujan elliptic functions, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-04868979v1

Super-Hölder vectors and the field of norms

Autoren: Berger, Laurent Rozensztajn, Sandra

Weitere Verfasser: Berger, Laurent Rozensztajn, Sandra

Quelle: Algebra & Number Theory. 19:195-211

Schlagwörter: \(p\)-adic wavelet, Class field theory, \(p\)-adic formal groups, locally analytic function, Mathematics - Number Theory, field of norms, Mahler basis, 11S, 12J, 13J, 22E, Galois theory, super-Hölder function, decompletion, perfectoid ring, Lubin-Tate group, Ramification and extension theory, Analysis on \(p\)-adic Lie groups, Non-Archimedean valued fields, pro-\(p\)-group, FOS: Mathematics, Number Theory (math.NT), Other analytic theory (analogues of beta and gamma functions, \(p\)-adic integration, etc.), Power series rings, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2209.02572
https://hal.science/hal-03771463v1

Differential transcendence of Bell numbers and relatives: A Galois theoretic approach

Autoren: Bostan, Alin Di Vizio, Lucia Raschel, Kilian et al.

Weitere Verfasser: Bostan, Alin Di Vizio, Lucia Raschel, Kilian et al.

Quelle: Pre

Schlagwörter: 05A40, 39A10, Galois theory, 33B15, Bell numbers, 0102 computer and information sciences, 11B68, 01 natural sciences, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Classical Analysis and ODEs (math.CA), FOS: Mathematics, Mathematics - Combinatorics, Number Theory (math.NT), 12H05, Combinatorial power series, 0101 mathematics, Euler numbers, Mathematics - Number Theory, Sheffer sequences, 30D30, umbral calculus, 33C45, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], differential transcendence, Mathematics - Classical Analysis and ODEs, Genocchi numbers, Combinatorics (math.CO), Bernoulli numbers, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2012.15292
https://hal.science/hal-03091272v3

Aomoto and Grassmannian polylogarithms via iterated integrals

Autoren: Charlton, Steven Gangl, Herbert Radchenko, Danylo

Weitere Verfasser: Charlton, Steven Gangl, Herbert Radchenko, Danylo

Quelle: Journal of the European Mathematical Society.

Schlagwörter: Aomoto polylogarithm, iterated integrals, Multiple polylogarithms, Grassmannian polylogarithm, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Zugangs-URL: https://cnrs.hal.science/hal-05314886v1
https://doi.org/10.4171/jems/1701

Explicit formulas for Grassmannian polylogarithms in weights 4 and 5

Autoren: Charlton, Steven Gangl, Herbert Radchenko, Danylo

Weitere Verfasser: Charlton, Steven Gangl, Herbert Radchenko, Danylo

Quelle: Journal of Number Theory.

Schlagwörter: Multiple polylogarithms, algebraic K-theory, Zagier's polylogarithm conjecture, Grassmannian polylogarithms, iterated integrals, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

A complete formalization of Fermat's Last Theorem for regular primes in Lean

Autoren: Best, Alex Birkbeck, Christopher Brasca, Riccardo et al.

Weitere Verfasser: Best, Alex Birkbeck, Christopher Brasca, Riccardo et al.

Quelle: Annals of Formalized Mathematics. 1

Schlagwörter: FOS: Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), Kummer's lemma, Logic in Computer Science (cs.LO), Number Theory, FOS: Mathematics, Lean, Number Theory (math.NT), Formal Languages and Automata Theory, Mathlib, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT], [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2410.01466
https://ueaeprints.uea.ac.uk/id/eprint/99887/

Simpler and Faster Pairings from the Montgomery Ladder

Autoren: Giacomo Pope Krijn Reijnders Damien Robert et al.

Weitere Verfasser: Giacomo Pope Krijn Reijnders Damien Robert et al.

Quelle: IACR Communications in Cryptology. 2

Schlagwörter: pairings, isogenies, cubical arithmetic, Elliptic curves arithmetic, Montgomery ladder, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: https://inria.hal.science/hal-05142445v1/document
https://doi.org/10.62056/ah2i893y6
https://inria.hal.science/hal-05142445v1

Counterexamples to the Hasse Principle among the twists of the Klein quartic

Autoren: Elisa Lorenzo García Michaël Vullers Lorenzo García, Elisa et al.

Weitere Verfasser: Elisa Lorenzo García Michaël Vullers Lorenzo García, Elisa et al.

Quelle: Indagationes Mathematicae. 35:638-645

Schlagwörter: Mathematics - Number Theory, FOS: Mathematics, 06 humanities and the arts, Number Theory (math.NT), 0101 mathematics, 01 natural sciences, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], 0604 arts, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT]

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2212.10900
https://hal.science/hal-03915159v1/document
https://doi.org/10.1016/j.indag.2023.08.007
https://hal.science/hal-03915159v1

Les E-fonctions et G-fonctions de Siegel

Autoren: Rivoal, Tanguy Institut Fourier (IF) Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA) et al.

Weitere Verfasser: Rivoal, Tanguy Institut Fourier (IF) Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA) et al.

Quelle: Journées mathématiques X-UPS. :197-298

Schlagwörter: $G$-fonctions, $E$-fonctions, Approximants de Padé, Mesures d'irrationalité, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

The Beurling-Malliavin Density, The Pólya Density and Their Connection

Autoren: Giuliano, Rita Grekos, Georges Misik, Ladislav et al.

Weitere Verfasser: Giuliano, Rita Grekos, Georges Misik, Ladislav et al.

Quelle: Uniform distribution theory. 19:43-66

Schlagwörter: increasing sequence, Beurling-Malliavin density, counting function, upper Pólya density, Mathematics - Number Theory, η-covering, subadditivity, FOS: Mathematics, substantial interval, Number Theory (math.NT), 11B25, 11B05, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

Zugangs-URL: http://arxiv.org/abs/2404.18711

On the Connection Between the Beurling-Malliavin Density and the Asymptotic Density

Autoren: Giuliano, Rita Grekos, Georges University of Pisa Italy = Università di Pisa Italia = Université de Pise Italie (UniPi) et al.

Weitere Verfasser: Giuliano, Rita Grekos, Georges University of Pisa Italy = Università di Pisa Italia = Université de Pise Italie (UniPi) et al.

Quelle: Uniform distribution theory. 19:67-86

Schlagwörter: increasing sequence, Mathematics - Number Theory, complete system, substantial interval, regularly varying function, 11B25 (Primary) 14F05, 11B05 (Secondary), [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], Beurling-Malliavin density, first digit set, FOS: Mathematics, Number Theory (math.NT), asymptotic density

Zugangs-URL: http://arxiv.org/abs/2311.04762