The Relational Complexity of a Finite Permutation Group
Explores relational complexity in finite permutation groups, discussing its measurement, estimation methods, and recent progress towards proving a key conjecture using theoretical and computational approaches.
Derek Holt- Algorithms for Finitely Presented Groups I
Explore fundamental algorithms for computing in finitely presented groups, including Todd-Coxeter coset enumeration and Reidemeister-Schreier algorithm, with practical examples and applications.
Computing with Gödel's Completeness Theorem
Explore computational approaches to Gödel's completeness theorem, including Krivine's "exploding models," A-translation, and Kripke forcing, with insights on reifying validity proofs into derivability proofs.
Natural Homology Computability and Eilenberg Steenrod Axioms
Explore natural homology computability and Eilenberg Steenrod axioms in this advanced mathematics lecture, delving into applied and computational algebraic topology concepts.
The Lonely Runner Conjecture - Simulation and Explanation
Explore the intriguing Lonely Runner Conjecture through simulation, understanding its simplicity and the challenge of proving it conclusively.
Foundations of Deep Learning and AI: Instabilities, Limitations, and Potential
Exploring deep learning's instability, AI limitations, and potential impacts on scientific computing and medical imaging. Compares AI's current state to early 20th-century mathematics, predicting similar foundational challenges.
Optimal Shape of Tree Roots and Branches - Seminar in Analysis and Methods of PDE
Explore mathematical models for optimal shapes in nature, focusing on tree roots and branches. Examine functionals for sunlight capture and nutrient collection, combined with transportation costs.
Matrix Methods in Computer Science - Session 6B
Explore advanced matrix methods and their applications in computer science, focusing on cutting-edge research and algorithmic developments.
Matrix Methods in Computer Science - Session 4B
Explore advanced matrix methods and their applications in computer science, focusing on cutting-edge research and algorithmic developments.
Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation
Explore efficient algorithms for positive semidefinite low-rank approximation, focusing on robustness and sample optimality in matrix computations.
What's the Point of Mathematics? - Mathematical Modeling Applications
Explore the real-world applications and significance of mathematics with Dr. Nira Chamberlain, a renowned expert in mathematical modeling across various industries.
Formal Power Series and the Miraculous Relation Between E (exp) and L (log)
Explore formal power series as a powerful alternative to traditional analysis, focusing on the miraculous inverse relationship between exp and log polyseries variants E and L.
Hypergroup Definition and Five Key Examples - Diffusion Symmetry 4
Explore finite commutative hypergroups through five key examples, including class and character hypergroups, distance-transitive graphs, double cosets, and automorphism orbits. Gain insights for applications in physics and chemistry.
Infinity: Does It Exist? - A Debate on Mathematical Philosophy
A thought-provoking debate on the existence and nature of infinity in mathematics, exploring philosophical perspectives and practical implications for modern computing and mathematical foundations.
Dedekind Cuts and Computational Difficulties with Real Numbers - Famous Math Problems 19
Explores the challenges and misconceptions surrounding 'real numbers', examining various approaches like infinite decimals, Dedekind cuts, and Cauchy sequences, while emphasizing the importance of concrete computations in mathematics.
Fundamental Theorem of Algebra Reexamined - Math Foundations 217
Reexamines the Fundamental Theorem of Algebra, proposing new formulations based on rational complex arithmetic and quadrance, avoiding assumptions about continuity and real/complex numbers.
Mission Impossible: Factorizing Large Numbers - Math Foundations 200
Explores the challenge of factoring a large number, questioning the Fundamental Theorem of Arithmetic and discussing complexity issues in mathematics. Examines the tension between idealism and constructivism in pure math.
The Successor-Limit Hierarchy in Higher Arithmetic Operations
Explore the fascinating successor-limit hierarchy in arithmetic operations, moving beyond traditional computations to contemplate large-scale mathematical concepts and their implications.
The Law of Logical Honesty - Ending Infinity in Mathematics
Challenging traditional mathematical concepts, this talk advocates for a new approach to mathematics without infinity, emphasizing concrete computations and logical clarity for the digital age.
Singular Moduli for Real Quadratic Fields - An Update by Jan Vonk
Explore singular moduli for real quadratic fields with Jan Vonk. Learn about recent developments, theoretical insights, and computational aspects in this advanced arithmetic geometry lecture.
Explicit Constructions of Short Virtual Resolutions
Explore explicit constructions of short virtual resolutions in algebraic geometry, focusing on innovative techniques and their applications in mathematical research.