Algebra
16 recordsGroups, rings, representations, and algebraic structures, including their connections to geometry and topology.
Get email updates on AI contributions to mathematics and computing. Choose a general weekly update or subscribe to specific topics and problems.
Choose your updates. Confirm your email. Unsubscribe anytime.
Updates across a research field.
Groups, rings, representations, and algebraic structures, including their connections to geometry and topology.
Algorithms for graphs, strings, arithmetic, and matrix multiplication, together with computational complexity.
Functions, operators, differential equations, dynamics, and random systems, including analytic number theory and mathematical physics.
Patterns, colorings, and discrete constructions, including Ramsey theory, cap sets, and geometric combinatorics.
Shapes, distances, spaces, and their structure, including packings, metric embeddings, manifolds, and algebraic geometry.
Mathematical foundations, decidability, proof systems, and AI-assisted formalization.
Updates on a specific topic or question.
Formal proof systems check deductions expressed in a precise language.
Algebra studies rings, modules, and categories.
Polynomial equations define geometric spaces.
A cap set is a subset of vectors over the three-element field containing no three distinct vectors in an arithmetic progression.
Covering space with translates of convex shapes.
Differential geometry studies smooth spaces and metrics.
Dynamical systems describe how states evolve.
Functional analysis studies spaces of functions and operators.
Latest reported contributions, newest first.
Trevor Morris reports that Maker, moving first on an empty 15×15 square board, can force a rotated or reflected Snaky hexomino against any blocking play in the weak maker-breaker game.
Read original source Morris–Claude: pinned statement, baseline and AI rolesgithub.com
OpenAI claims disappearance of infinite bond-percolation clusters at criticality on every infinite connected locally finite quasi-transitive graph whose critical threshold is below one.
Read original source Pinned primary manuscript · family 213github.com
The manuscript reports one deterministic algorithm computing the exact complex discrete Fourier transform at every length n in O(n(log n)^(1−10^−13)) operations, including scalar preparation, scheduling and indexing, in its specified arithmetic model.
Read original source Pinned manuscript, Theorem 1.1 and Corollary 1.2github.com
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.