Algebra
16 recordsGroups, rings, representations, and algebraic structures, including their connections to geometry and topology.
Explore a broad field, or follow a focused topic or problem.
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.
Prime numbers, arithmetic functions, rational approximations, and Diophantine questions.
How close can an efficiently found solution come to the optimum?
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.
Coloring, diameter coverings, and packings combine geometric constraints with discrete choices.
Algorithms for graph problems, string comparison, arithmetic, and exact search.
Groups encode symmetry.
How many equal, non-overlapping spheres can touch a central sphere?
Logic studies formal languages, models, and computability.
This topic follows mathematical statements in physical models, including gravitational inequalities and field equations; it does not turn a theorem into an experimental prediction.
Multiplying two matrices is a basic computational task.
How faithfully can one distance space be represented in another?
Items arrive one at a time and must be placed into fixed-capacity bins.
Operator algebras organize bounded operators and their symmetries.
PDE research follows existence, uniqueness, regularity, and blowup for specified equations and initial data.
Probability studies random structures and their limits.
How large must a graph be before every coloring of its edges contains a prescribed monochromatic pattern?
Analysis studies functions, limits, and transformations.
Topology studies spaces and continuous transformations.
Sidorenko’s conjecture predicts the lower bound for every bipartite pattern.
Characteristic-zero and sofic-group direct-finiteness theorems do not settle arbitrary positive-characteristic group algebras.
Akhil Mathew’s contribution gives a noncommutative finite free group scheme of order four over a nonreduced base that is not killed by four.
Huang, Jackson, Lee, Poonen, Pries and Zhang construct an explicit degree-23 polynomial whose splitting field over the rationals has Galois group M₂₃.
Christopher D.
Computing edit distance compares strings under insertion, deletion, and substitution.
DeepMind reports AI-discovered assembly sorting routines translated to C++ and incorporated in LLVM libc++.
Ellenberg, Libedinsky, Plaza, Simental and Williamson prove that for n=2^m, dyadically well-distributed permutations form a Bruhat interval isomorphic to a hypercube of dimension m·2^(m−1).
Alpöge and Buckmaster report finite-time blowup for the inviscid Boussinesq equations on R² with smooth spatially compact forcing in both equations.
The Alpöge–Claude manuscript claims a compact complex threefold, obtained by completing a modular family of complex two-tori, whose underlying smooth manifold is diffeomorphic to S⁶.
Alpöge and Howell report elliptic curves over the rationals with at least 30 and at least 31 independent rational points of infinite order.
Infinite finitely generated residually finite torsion groups were known.
Absence of eigenvalues alone does not exclude singular continuous spectrum.
Artin’s conjecture predicts infinitely many primitive-root primes for every admissible fixed base, with a stronger positive-density asymptotic.
Borsuk’s covering question asks whether a bounded set in d dimensions can be partitioned or covered by d+1 subsets of strictly smaller diameter.
The target concerns the full conjectured exponent interval for arbitrary simply connected domains.
A hyperbolic group with a boundary homeomorphic to the two-sphere is conjectured to act geometrically on hyperbolic three-space.
Geodesic-ball volume comparison does not imply boundary-area comparison for arbitrary domains.
The pinned Anthropic development reports θ(p_c)=0 for nearest-neighbour Bernoulli bond percolation on Zᵈ in every integer dimension d≥2.
Offline bin packing knows all items before assigning them to bins.
Can fractional flow be rounded to one path per demand without increasing cost, while allowing the stated congestion slack?
At the critical threshold, can independently opened edges form an infinite cluster on an infinite graph with only finitely many vertex orbits?
Is there an algorithm that decides theoremhood in Medvedev’s logic of finite problems?
How many exact function-value queries are necessary to minimize a convex Lipschitz function, at a specified dimension and accuracy?
A polynomial running time in p is not polynomial in the binary input length.
Edit distance counts insertions, deletions, and substitutions between strings.
How large can a+b−n be when a!b!
Positive density guarantees from Szemerédi’s theorem do not automatically cover every set with divergent reciprocal sum.
Restricted randomized log-space models and simulations using more than logarithmic space do not establish exact log-space derandomization.
No positive integers a, b, c satisfy aⁿ+bⁿ=cⁿ when the integer exponent n exceeds 2.
3SUM looks for three input numbers summing to zero; all-pairs shortest paths computes distances between every pair of graph vertices.
The sharp n+1 threshold was known in several low dimensions, while general-dimensional results required larger twists.
Math, Inc.
Math, Inc.
The relativistic Vlasov–Maxwell system models particles interacting with their electromagnetic field.
Selmer-rank distributions alone do not determine analytic-rank densities.
Undecidability over the integers does not automatically imply undecidability over the rationals.
The conjecture bounds finite projective dimensions over each fixed finite-dimensional algebra.
Multiplying two n-bit integers is a basic exact computation.
Catalan’s constant is the alternating sum 1 − 1/9 + 1/25 − 1/49 + … .
Jacobsthal’s function measures how long an interval can fail to contain an integer coprime to a number with a given count of distinct prime factors.
Known results for nuclear algebras and other restricted classes do not establish the unrestricted bounded-representation target.
Torsion gives elementary zero divisors.
Can every connected planar domain be conformally represented by a domain whose complementary components are round disks or individual points?
A limiting thermodynamic free-energy density does not describe sample-to-sample fluctuations of total free energy.
A matching chooses edges without shared endpoints.
Compatible cohomological realizations alone do not establish rational intersection numbers with new divisor classes arising after reduction.
Modularity over the rationals and known special classes over other fields do not supply the unrestricted imaginary-quadratic result.
Three bases can be constructed in dimension six.
Square values of the point count were covered by Nagata’s original cases.
The problem asks whether F admits an invariant mean, equivalently the relevant Følner behavior.
Off-diagonal Ramsey numbers R(s,t) force a clique of size s in one edge color or size t in the other.
For every convex body K in R^n, n≥1, the manuscript reports volume product at its Santaló point at least (n+1)^(n+1)/(n!)², with equality exactly for simplices.
For every positive viscosity, the manuscript reports a three-dimensional incompressible Navier–Stokes flow starting from rest with smooth compactly supported forcing, bounded kinetic energy, and unbounded velocity in finite time.
The manuscript reports arbitrarily large finite simple graphs with independence number at most two and chromatic number greater than their largest clique-minor order.
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.
The manuscript reports smooth compactly supported divergence-free initial data on R³ whose unforced three-dimensional incompressible Euler solution has finite maximal lifespan, with unbounded velocity gradient and divergent time integral of maximum vorticity.
The online problem compares movement cost with an offline optimum that sees the full sequence.
Logarithmically weighted averages and ordinary averages have different targets.
A decomposition into two nontrivial summand sets would describe the eventual prime set additively.
If a proposed solution can be checked efficiently, can a solution always be found efficiently?
Place non-overlapping unit regular hexagons inside a larger regular hexagon.
For a fixed number of unit squares that may rotate freely, what is the smallest enclosing circle, and which configurations attain it?
Parisi and Zamponi give an analytic proof of a+b=1 from the scaling full replica-symmetry-breaking equations for infinite-dimensional hard-sphere jamming.
A metric embedding represents distances in another space.
How long must a refutation be in a system whose clauses contain affine equations over the two-element field?
Fixing a cone of degrees or preserving definable operations does not by itself imply that every degree is fixed.
Intersection multiplicity is an alternating sum of lengths of Tor groups over a regular local ring.
The conjecture was known for important special graph classes.
Categoricity means all models of a given size are isomorphic.
An Egyptian fraction expresses a rational number as a sum of distinct reciprocals of positive integers.
A common superstring contains every input string as a substring.
Covering density measures overlap when translates of a shape cover space.
Can every compact smooth Riemannian surface be immersed in Euclidean four-space while preserving tangent lengths and angles?
In a mean-payoff game, players choose moves in a graph to optimize a long-run average reward.
The strict version concerns every eigenfunction, rather than existence of one favorable eigenfunction or results confined to convex or symmetric domains.
Equality of analytic and algebraic ranks and finiteness of the Tate–Shafarevich group do not determine the exact leading coefficient.
Constructing individual odd-weight elements does not establish that they freely generate the entire Lie algebra.
How many pairs among n planar points can be exactly one unit apart?
A distance set with full one-dimensional Hausdorff dimension need not have positive length.
Gaussian primes are primes in the integer lattice of complex numbers.
Must a locally compact group acting faithfully and continuously on a finite-dimensional topological manifold be a Lie group?
Does a polynomial self-map with constant nonzero Jacobian necessarily have a polynomial inverse?
Choice implies the Partition Principle, but an injection reversing a surjection need not select a member of each fiber.
Find the smallest number of vertices such that every red/blue coloring of a complete graph’s edges contains a monochromatic five-vertex clique.
The Riemann hypothesis predicts that every nontrivial zero of the Riemann zeta function lies on the line with real part one half.
The conjecture requires simultaneously near-perfect completeness and arbitrarily small soundness with an alphabet fixed for those errors.
Three-cell and three-dimensional cases were known.
Color every point of the Euclidean plane so that points exactly one unit apart have different colors.
The numerical range controls polynomial evaluation at a matrix.
Can a selected committee resist deviations by every sufficiently large group of voters under the approval-based core definition?
Move k servers through a metric space to serve online requests while competing with an offline optimum.
The inequality compares invariant ADM mass with the minimum area enclosing a trapped boundary in asymptotically flat initial data.
Evidence for a gap in finite samples or a different spin-chain Hamiltonian does not establish a length-uniform gap for the pure bilinear spin-one model.
Poincaré duality reduces the four-dimensional Singer target to a vanishing assertion but does not establish that vanishing.
Does the tracial von Neumann algebra associated with a free group remember its number of generators?
The irrationality exponent measures how closely infinitely many rational numbers can approximate a real number.
How many unit spheres in eleven-dimensional Euclidean space can touch one central unit sphere without overlapping each other?
The exponent describes arithmetic-operation growth for large square matrices.
Can every feasible periodic scheduling instance be reduced to one with a universal cap on its longest period?
Does every abelian envelope of a rigid monoidal category possess the quotient property?
Hodge classes are cohomological objects; the problem asks whether rational ones come from algebraic cycles on abelian varieties with complex multiplication.
Special dimensions and classes of convex bodies do not establish the all-dimensional symmetric volume-product minimum.
Full dimension of Kakeya sets and the quantitative maximal-operator estimate are different assertions.
A limit cycle is an isolated periodic orbit.
The shifted approximation problem fixes a real shift and asks for an almost-everywhere divergence criterion.
Subset Sum asks whether some subset of given integers has a specified sum.
Compact positive-curvature classification and noncompact cases with added growth or curvature assumptions do not establish the unrestricted stated pointwise-positive target.
A zero-free region excludes zeros from a specified part of the complex plane.
No matching interests. Request a missing problem or topic.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.