Conférences  >  Mathématiques  >  Théorie des nombres, arithmétique

This workshop will follow a model similar to the AMS's Mathematical Research Communities or to Women in Numbers: Team leaders have planned projects for participants to work on during the workshop. The goal is for participants to learn new math, get to know colleagues, and have a joyful, affirming research experience.

Dreaming up a better number theory community

Centre International de Rencontres Mathématiques (CIRM)

In recent years, there has been an explosion of activity surrounding algebraic points on curves, from many different perspectives. These include the study of measures of irrationality, isolated and parametrized points, computational methods to determine algebraic points, and the arithmetic statistics of algebraic points. In this workshop, we aim to bring together researchers from these diverse perspectives, with the particular goal of developing bridges between them. The workshop will include overview talks on the various perspectives, research talks, an open problem session, and structured time for collaboration.

Géométrie et topologie,    Algèbre

Institute for Computational and Experimental Research in Mathematics (ICERM)

TU Graz

Algebraic, number theoretic and topological aspects of rings, algebras and polynomials

Algèbre,    Géométrie et topologie

Institute of Mathematics, National Academy of Sciences of Armenia

The goal of the summer school is to introduce students and junior scientists to the basics of the theory of elliptic curves and their applications in modern number theory and cryptography. The origins of the theory of elliptic curves go back to the 19th century, but it has become a central area of number theory only in the 20th century with the work of Mordell, Hasse, Weil and many others. A particularly prominent developments were the formulation of the conjecture of Birch and Swinnerton-Dyer, and the discovery of connections between elliptic curves and modular forms. The celebrated proof of Fermat’s Last Theorem by Wiles is the first general result on the modularity of elliptic curves – a topic which is still very much at the forefront of research in number theory. Elliptic curves also have come to play an important role in modern cryptography, and they continue to be extensively studied for possible future cryptosystems resistant to quantum computing.

Cryptographie, blockchain et sécurité de l'information,    Cours et évènements pour étudiants en mathématiques

GEMA

Welcome to the World Maths Championship, the premier global platform for showcasing mathematical excellence and fostering a passion for mathematics among students worldwide. Powered by the Global Educational Mathematics Association (GEMA), we are dedicated to promoting mathematical literacy, problem-solving skills, and academic competition on an international scale.

Event Organizer;     Tél.: [+971-527809450];     Email.: contact@worldmathschampionship.com

Exam Dates: 31st July 2025 18h August 2025, Time: Exam will be available for 24hrs on 31st July and 18th August (whichever date student opted), students can start anytime between those 24hrs, but once started exam will end in its pescribed time limit of 1 hr., Duration: 60 Minutes, Mode of registration: Individually and through schools., Last Date of Registration: 27th July 2025 for 31st July Exam date and 17th August 2025 for 18th August Exam date Result: Generally, the results are announced within 3 month’s time of Last Exam Date Eligibility: For Students of Grade 1-8, Exam Fee: US$ 15, Mode of Exam: Online, Monitoring: Online proctored Exam, Number of Questions: Grade 1 – 4: 35 Questions Grade 5 – 8: 50 Questions, Study Material: There is no need to buy expensive books or study materials, all questions will be coming from existing academic curriculum/books of the students. Sample paper is also available on website. Plus we offer a mock test to students as well to get a better understanding of the exam., Date of Mock Test: 20th July 2025 00:01AM to 17th August 2025 11:00PM. A Mock test will be available between these dates for students to attempt, students can start anytime between these dates, but once started exam will end in its pescribed time limit of 1 hr., How the Exam will be Monitored: Remember this is an AI Proctored exam, System will automatically terminate exam if unusual behavior is found.,

Cours et évènements pour étudiants en mathématiques,    Logique mathématique et fondements

We will gather to celebrate and showcase the spectacular advances in algebraic number theory and arithmetic geometry inspired by the vast research program of Henri Darmon.

The René 25 conference will bring together renowned international researchers in mathematics to celebrate the research interests of René Schoof, which include the fields of algebraic number theory, arithmetic algebraic geometry, computational number theory and coding theory.

University of Paderborn

This conference aims to honor the spectacular contributions of Emmanuel Ullmo to arithmetic geometry and centers around his mathematical contributions and interests. It will cover and highlight recent stage of development on topics such as Diophantine geometry, ergodic theory, Hodge theory, and arithmetic dynamics.

The Geometric and Analytic Number Theory conference will bring together world leading researchers to present talks on the latest advancements in the fields of geometric and analytic number theory with a view towards rational points on varieties and counting number fields. Attendees will have the opportunity to engage with pioneering work and connect with peers from around the world, fostering collaboration and knowledge exchange within the number theory community.

The conference is concerned with the theory of computability and complexity over real-valued data. Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded. Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. Despite remarkable progress in recent years many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are waiting to be detected. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.

The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers.

Théorie de l'information, fondations de l'informatique,    Algèbre

The summer school is about formulas of Siegel and Weil and its impact in the theory of sphere packings, number theory, and geometry. The summer school takes place at Bielefed University.

Cours et évènements pour étudiants en mathématiques,    Géométrie et topologie

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

CRM

Statistique, Théorie des jeux,    Cours et évènements pour étudiants en mathématiques

The Algorithmic Number Theory Symposium (ANTS) is the premier international forum for the presentation of new research in computational number theory and its applications, devoted to algorithmic aspects of number theory and related fields, including elementary number theory, algebraic number theory, analytic number theory, the geometry of numbers, arithmetic geometry, finite fields, cryptography, and coding theory.

On the occasion of 40+ years after the seminar paper of Gross--Zagier, we bring together experts to deliver lectures on a broad range of topics connected with the Gross-Zagier formula, its generalizations, related future directions, and other works that it has inspired.

The program will unite researchers from a number of areas: algebraic and complex geometry, arithmetic geometry, Hodge theory, and mathematical physics. It will bring theoretically and computationally oriented researchers together, expecting that computations will illuminate conjectures made by the theorists and that theory will enlarge the range of what can be computed. We intend to develop databases of certain types of K3 surfaces for the L-Functions and Modular Forms Database and promote the development of software for computations on K3 surfaces in Magma, SageMath, or other systems for public release.

Géométrie et topologie,    Cours et évènements pour étudiants en mathématiques