Výsledky vyhledávání - "COMPUTATIONAL number theory"

Progress towards a conjecture of S.W. Graham.

Autoři: S.V., Nagaraj¹ (AUTHOR) svnagaraj@acm.org

Zdroj: Journal of Number Theory. Jan2025, Vol. 266, p281-294. 14p.

Témata: *COMPUTATIONAL number theory, *PRIME factors (Mathematics), *NUMBER theory, *LOGICAL prediction

Deterministic Prime Generation via a Structured Odd-Only Sieve: A Survivor-Filter Perspective

Autoři: Rezapour, Majid Rezapour, Ramin

Témata: Computational Number Theory, Eratosthenes Sieve, Algorithm Optimization, ParityScript, Odd-Only Sieve, Prime Number Generation, Survivor-Filter, Prime Gaps

Rhythmic Sparks of Duality: Unraveling the Twin Prime Conjecture with ParityScript

Autoři: Rezapour, Majid Rezapour, Ramin

Témata: Evolutionary Biology, Computational Number Theory, Informational Asymmetry, Artificial Intelligence, Prime Distribution, FOS: Biological sciences, Parity Resonance Amplification (PRA), Cognitive Science, ParityScript, Modular Arithmetic, Twin Prime Conjecture, Prime Gaps, Zone of Resonance (ZoR)

Asymmetry's Triumph: Decoding Cohen–Lenstra Heuristics through ParityScript

Autoři: Rezapour, Majid Rezapour, Ramin

Témata: Cohen–Lenstra heuristics, ParityScript framework, Algebraic structures, Computational number theory, Asymmetry in number theory, Probabilistic number theory, Class groups of quadratic fields, Algorithmic determinism, Statistical heuristics in mathematics

COMPUTING GALOIS GROUPS.

Autoři: ELSENHANS, ANDREAS-STEPHAN¹ stephan.elsenhans@mathematik.uni-wuerzburg.de

Zdroj: International Journal of Group Theory. Sep2024, Vol. 13 Issue 3, p241-250. 10p.

Témata: *COMPUTATIONAL number theory, *ALGEBRAIC number theory

HYBRIDIZING HENSEL’S LEMMA, FUNDAMENTAL THEOREM OF ARITHMETIC, AND CHINESE REMAINDER THEOREM FOR SOLVING POLYNOMIAL CONGRUENCES

Autoři: Eka Oktaviansyah Edi Kurniadi Dianne Amor Kusuma

Zdroj: Barekeng, Vol 20, Iss 1 (2025)

Témata: Chinese Remainder Theorem, Computational number theory, Fundamental Theorem of Arithmetic, Hensel’s Lemma, Polynomial congruence, Recursive formula, Probabilities. Mathematical statistics, QA273-280

Popis souboru: electronic resource

Relation: https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/18348; https://doaj.org/toc/1978-7227; https://doaj.org/toc/2615-3017

Přístupová URL adresa: https://doaj.org/article/20580812bf8d4a2c851000f75c15d57b

Perfect Codes over Non-Prime Power Alphabets: An Approach Based on Diophantine Equations.

Autoři: Cazorla García, Pedro-José¹ (AUTHOR) pedro-jose.cazorlagarcia@manchester.ac.uk

Zdroj: Mathematics (2227-7390). Jun2024, Vol. 12 Issue 11, p1642. 11p.

Témata: *DIOPHANTINE equations, *COMPUTATIONAL number theory, *ERROR-correcting codes, *INFORMATION theory

Issue Information.

Zdroj: Bulletin of the London Mathematical Society. Apr2024, Vol. 56 Issue 4, p1-4. 4p.

Témata: *QUANTUM groups, *COMPUTATIONAL number theory, *GEOMETRIC function theory, *ANALYTIC number theory, *HARMONIC analysis (Mathematics), *ALGEBRAIC number theory, *DISCRETE mathematics

Equal-Gap Streaks in Circle Rotations: A Comprehensive Study of Diophantine Structure and Gap Persistence

Autoři: Singh, Abhinaw

Témata: Three-Gap Theorem, Equal-Gap Streaks, Circle Rotations, Gap Distributions, Diophantine Approximation, Sturmian Sequences, Ergodic Theory, Discrepancy Theory, Uniform Distribution, Dynamical Systems, Computational Number Theory, Cryptography Applications

A Rigorous Error Bound for the TG Kernel in Prime Counting

Autoři: Alpay, Faruk Kilictas, Bugra

Témata: FOS: Computer and information sciences, Numerical Analysis, Data Structures and Algorithms, explicit formula, F.2.1, I.1.2, error bounds, Numerical Analysis (math.NA), Alpay Algebra, 11N05, 11Y35, 11M26, 65B10, computational number theory, Faruk Alpay, Number Theory, prime counting function, analytic number theory, FOS: Mathematics, Riemann zeta function, Data Structures and Algorithms (cs.DS), Number Theory (math.NT), truncated Gaussian kernel

Přístupová URL adresa: http://arxiv.org/abs/2506.22634

Computing quadratic subfields of number fields

Autoři: Andreas-Stephan Elsenhans Jürgen Klüners

Zdroj: Journal of Computational Algebra, Vol 15, Iss , Pp 100039- (2025)

Témata: Subfields, Number field, Computational number theory, Mathematics, QA1-939

Popis souboru: electronic resource

Relation: http://www.sciencedirect.com/science/article/pii/S2772827725000105; https://doaj.org/toc/2772-8277

Přístupová URL adresa: https://doaj.org/article/0d96b4b7f06e4e66ba63ee215e51fcf9

Algebraic, Analytic, and Computational Number Theory and Its Applications.

Autoři: Savin, Diana Minculete, Nicusor Acciaro, Vincenzo

Zdroj: Mathematics (2227-7390). Jan2024, Vol. 12 Issue 1, p10. 7p.

Témata: *COMPUTATIONAL number theory, *ALGEBRAIC number theory, *ALGEBRAIC field theory, *ANALYTIC number theory, *ALGEBRAIC numbers, *ARITHMETIC series, *RESIDUATED lattices, *FIBONACCI sequence, *PUBLIC key cryptography

Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation).

Autoři: Roughgarden, Tim Vassilvitskii, Sergei Wang, Joshua R.

Zdroj: Journal of the ACM. Nov2018, Vol. 65 Issue 6, p1-24. 24p.

Témata: *MATHEMATICAL analysis, *INTEGRATED circuits, COMPUTATIONAL number theory, FOUNDATIONS of arithmetic, POLYNOMIAL approximation

A Deterministic Matrix Operator Incorporating Prime Number Data: Construction and Spectral Statistics

Autoři: Karazoupis, Miltiadis

Témata: Matrix Models, Computational Number Theory, Random Matrix Theory, Prime numbers, GUE, Riemann Hypothesis, Hilbert-Pólya Conjecture, Spectral Statistics

CHRONOLOGICAL VERIFICATION OF THE COLLATZ CONJECTURE USING THEORETICALLY PROVEN SIEVES.

Autoři: DUTTA, S.

Zdroj: Electronic Journal of Mathematical Analysis & Applications; Jan2025, Vol. 13 Issue 1, p1-10, 10p

Témata: COMPUTATIONAL number theory, NUMBER theory, SIEVES, LOGICAL prediction, INTEGERS

Cryptography.

Autoři: Buchmann, Johannes Goldwasser, Shafi Kalai, Yael a další

Zdroj: Oberwolfach Reports; 2025, Vol. 22 Issue 1, p141-169, 28p

Témata: COMPUTATIONAL number theory, MATHEMATICAL proofs, QUANTUM cryptography, TELECOMMUNICATION systems, QUANTUM computing, CRYPTOGRAPHY

Fast Generation of RSA Keys Using Smooth Integers.

Autoři: Dimitrov, Vassil Vigneri, Luigi Attias, Vidal

Zdroj: IEEE Transactions on Computers. Jul2022, Vol. 71 Issue 7, p1575-1585. 11p.

Témata: COMPUTATIONAL number theory, PRIME factors (Mathematics), RANDOM number generators, PRIME numbers, COMPLEXITY (Philosophy), RSA algorithm

Unramified extensions of quadratic number fields with certain perfect Galois groups.

Autoři: König, Joachim¹ (AUTHOR) jkoenig@knue.ac.kr

Zdroj: International Journal of Number Theory. Apr2023, Vol. 19 Issue 3, p639-653. 15p.

Témata: *GALOIS theory, *COMPUTATIONAL number theory, *INVERSE problems, *GROUP extensions (Mathematics)

A Modular–CM Proof of the Gourevitch Identity for 1/π2

Autoři: Perera Jayasuriya Arachchige Shanaka Anslem

Témata: Mathematics, Mathematics/trends, modular forms, Ramanujan–Sato series, complex multiplication, hypergeometric functions, Chowla–Selberg formula, experimental mathematics, high-precision computation, eta and theta functions, computational number theory, modular parametrization

Relation: https://zenodo.org/records/17272159; oai:zenodo.org:17272159; https://doi.org/10.5281/zenodo.17272159

Dostupnost: https://doi.org/10.5281/zenodo.17272159
https://zenodo.org/records/17272159

ABC Conjecture - Validator-Grade Resolution via Spectral Collapse, Computational Density Modeling, and Finite Enumeration

Autoři: Forrest M. Anderson, Forrest

Témata: abc conjecture, radical inequality, Diophantine equations, Szpiro conjecture, Vojta conjecture, Mason–Stothers theorem, elliptic curves, finite verification, computational number theory, spectral collapse, prime density modeling, exhaustive enumeration, validator-sealed proof, mathematical resolution, analytic bounding, additive number theory, MSC 11A41, MSC 11D45, MSC 11G05, MSC 11Y16, MSC 11B13, MSC 11N05, MSC 68W30, MSC 11F70, prime factorization, radical function, PPDI, PEPM, replication audit, validator protocol

Relation: https://zenodo.org/records/17256045; oai:zenodo.org:17256045; https://doi.org/10.5281/zenodo.17256045

Dostupnost: https://doi.org/10.5281/zenodo.17256045
https://zenodo.org/records/17256045