Frank C. Park Created 2026-10-13 Updated 2026-11-05
Coauthor with Kevin M. Lynch of a textbook on modern robotics, connecting rigid-body geometry with robot mechanics, motion planning and control.[ref]
Geometry Created 2026-10-18 Updated 2026-11-05
Geometry studies shapes, positions and spatial relationships through the structures and transformations under consideration. Euclidean geometry measures lengths and angles; projective geometry emphasizes incidence; differential geometry studies smooth spaces using tangent spaces and curvature. A circle can be stretched into an ellipse by an affine map, but generally not by a Euclidean isometry. Their curves are also homeomorphic, illustrating how topology preserves a different level of structure.
George Pólya Created 2026-10-14 Updated 2026-11-05
George Pólya was a mathematician whose research spanned probability theory, analysis, combinatorics and geometry. He also became an influential writer about mathematical discovery, emphasizing the search for analogies, simpler cases and useful auxiliary constructions.[ref] His work on random walks gives a striking example of dimension changing a qualitative answer: a simple symmetric random walk on the integer lattice returns to its starting point with probability one in dimensions one and two, while in dimension three that probability is less than one. The distinction connects local random steps with the distinction between recurrent graphs and transient graphs.
Figure 1.
Portrait of George Pólya
. Photograph identified on the named portrait page. Source.
Hal Abelson Created 2026-10-24 Updated 2026-11-05
Hal Abelson is a computer scientist whose work uses computer programming as a way to express and investigate ideas. With Gerald Jay Sussman, he developed the course behind Structure and Interpretation of Computer Programs by Harold Abelson and others. Its use of Scheme connects concrete programs with programming abstraction, recursion and the organization of computations.[ref]
His work on Logo and computational geometry also brought mathematical exploration into programming education. Rather than treating a program only as a sequence of commands, this approach lets a learner examine how a compact procedure generates an entire family of behaviours.[ref]
Figure 1.
Portrait of Hal Abelson
. Joi, Flickr photograph, 23 June 2011; Commons records a successful CC BY 2.0 Flickr review. Creative Commons Attribution 2.0 Generic., via Wikimedia Commons. Source.
Igor Pak Created 2026-10-14 Updated 2026-11-05
Igor Pak works in discrete mathematics, including enumerative combinatorics, algebraic combinatorics, polyhedral geometry, and probability and computation on groups. His research page presents these as interconnected subjects and lists lectures on convex polytopes and combinatorial inequalities.[ref] A common theme is to explain a numerical counting identity through the structure of the objects being counted, such as a bijection, rather than relying only on algebraic manipulation. Polyhedral methods add geometric constraints to those discrete enumeration questions.
Figure 1. . Photograph identified on the portrait record.
Jean Gallier Created 2026-10-14 Updated 2026-11-05
Jean Gallier is a computer scientist whose research connects mathematical foundations with computer programming and geometric applications. His earlier work includes formal verification, automated deduction and unification; his later interests include computer graphics, computer vision, robotics and the geometry of curves and surfaces.[ref]
His Curves and Surfaces in Geometric Modeling: Theory and Algorithms by Jean Gallier develops geometric constructions with explicit mathematical foundations. For example, its account of affine maps separates the geometry of points from the linear maps acting on displacement vectors, a distinction useful when describing transformations in computer graphics.[ref]
Jeffrey C. Lagarias 2026-11-05
Write and let be the sum-of-divisors function. Lagarias proved that the Riemann hypothesis is equivalent to the assertion that, for every positive integer ,
with equality only at .[ref]
For example, and , so the right side is approximately . This verifies one instance. The force of the theorem is the universal quantifier: checking any finite collection of integers does not establish the entire inequality. An elementary-looking statement can therefore encode a deep question about the zeros of a function of the Riemann zeta function.
Figure 1.
Jeffrey C. Lagarias
. Portrait identified on the author's University of Michigan homepage.
John L. Harer 2026-11-05
John L. Harer works at the intersection of topology, geometry and computational data analysis. His Duke research description emphasizes geometric, combinatorial and computational methods for analyzing shape and data.[ref] With Herbert Edelsbrunner, he coauthored Computational Topology: An Introduction by Herbert Edelsbrunner and John L. Harer, connecting topological invariants to computational methods.[ref]
An elementary illustration is a triangular outline: it has one connected component and one unfilled loop. Filling its interior keeps the connected component but removes the hole. Homology distinguishes these cases, showing why a description of shape can capture something different from coordinates or pairwise distances. The example illustrates the subject rather than attributing a particular theorem or discovery to the book's authors.
John Milnor 2026-11-05
John Milnor works across topology, geometry and dynamical systems. His expositions connect local calculations with global structure: Morse Theory by John Milnor develops the topology of a manifold through critical points, while his complex-dynamics lectures study iteration of holomorphic maps.[ref][ref]
Near a nondegenerate critical point, the Morse lemma reduces a smooth function exactly to a signed quadratic form in suitable coordinates. Its index controls the topological change in sublevel sets. With James D. Stasheff, Milnor also wrote Characteristic Classes by John Milnor and James D. Stasheff, developing invariants of vector bundles.
John M. Lee Created 2026-10-14 Updated 2026-11-05
Katharina Gillen-Christandl coauthored an imaging method for neutral alkali atom samples using surface ionization. Converting neutral atoms into detectable charges links atomic sample geometry with a calibrated charge-imaging signal.[ref]
Leonhard Euler Created 2026-10-13 Updated 2026-11-05
Leonhard Euler (1707–1783) developed analysis as a working language for mechanics, geometry and number theory. His 1736–1737 treatment of Newtonian mechanics put motion into the methods of differential equations, while his work on surfaces and polyhedra connected geometric quantities with structural relations such as the Euler characteristic.[ref]
The Euler's formula exemplifies the resulting unity: the complex exponential describes rotation, so oscillations can be manipulated through multiplication and differentiation. The Euler characteristic of a convex polyhedron, , concerns a different invariant altogether. Distinguishing these meanings makes his many eponyms useful connections rather than interchangeable formulas.
Figure 1.
Portrait of Leonhard Euler
. Jakob Emanuel Handmann, 1753; Kunstmuseum Basel, inventory 276; reproduction cropped from Euler-2007 document. Public domain (life-plus-100, pre-1931 U.S. publication) and faithful reproduction / PD-Art. Source and usage information on the linked Wikimedia file page. Source.
Luigi Guido Grandi Created 2026-10-13 Updated 2026-11-05
Luigi Guido Grandi was a mathematician and monk whose work included geometry and hydraulics. His name is associated with Grandi's series, , a simple example that exposes ambiguities in manipulating infinite sums.[ref] Grouping consecutive terms as suggests zero, while separating the first term suggests one; neither is a valid proof of an ordinary sum. The partial sums do not converge. A specified method such as Cesàro summation can assign , but the method and its rules must be stated before using that value in a calculation.
Figure 1.
Portrait of Luigi Guido Grandi
. Creator not supplied on Commons; University of Pisa historical photograph archive (source URL recorded on file page). Commons declares public domain under life-plus-70; author information is missing. Source and usage information on the linked Wikimedia file page. Source.
Magnetometry 2026-11-05
Magnetometry measures magnetic fields or magnetic responses using a specified sensor and calibration. Different instruments respond to a field component, magnitude, gradient or magnetic moment.
A Hall sensor converts a transverse charge-deflection voltage into a field estimate; a fluxgate uses a driven magnetic core; an atomic magnetometer measures field-dependent spin dynamics. Sensitivity must be stated together with bandwidth and measurement geometry. A very small noise density does not alone establish absolute accuracy, because offsets, calibration and environmental fields can remain.
Marc Lackenby Created 2026-10-31 Updated 2026-11-05
Marc Lackenby works in topology, geometry and group theory. His research includes knot theory, bounds on Reidemeister moves between knot diagrams, and hyperbolic geometry of link complements. These topics connect the geometric shape of three-dimensional spaces with the computational difficulty of recognizing and simplifying their descriptions.[ref]
Figure 1.
Portrait of Marc Lackenby in 1997
. Crop of a photograph by George Bergman, hosted by Wikimedia Commons. Original photograph and credits; CC BY-SA 4.0. Crop details are on the linked source file page. Source.
Mark Levi Created 2026-10-20 Updated 2026-11-05
Mark Levi studies dynamical systems through geometry and analysis, with applications to mechanical and physical motion. His research description includes stability, geometric phases, averaging and charged-particle dynamics.
An example of the viewpoint is the inverted pendulum: a rapidly varying drive can stabilize a configuration that is unstable without it. Translating the motion into geometric or averaged descriptions can expose a simpler mechanism than direct inspection of the full trajectory.[ref]
Mathematics achievement 2026-11-05
Mathematics achievement is attained performance on specified mathematical learning objectives. Its meaning depends on the content and scoring of the assessment: proficiency in counting, arithmetic and geometry need not form an identical profile. A total score can summarize performance while concealing which skills changed.
An informative intervention therefore measures more than success on its practiced activity. In Geetha B. Ramani's study with Robert S. Siegler, children played either a linear numbered board game or a corresponding color board game. Assessment included counting, numeral identification, numerical magnitude comparison and number-line estimation, rather than only skill at winning the game.[ref]
Improvement on an assessment is evidence about that outcome in the studied population. Claims about broader mathematical understanding require appropriate generalization tests and a comparison design that separates the intervention from maturation, repeated testing and other experiences.
Michael Atiyah 2026-11-05
Michael Atiyah connected topology, geometry and analysis. With Isadore Singer, he proved the Atiyah-Singer index theorem, relating an analytic index of an elliptic operator to topological data. Oxford's mathematical memorial explains its connection with Riemann-Roch theorem and Gauss-Bonnet theorem formulas.[ref]
His work with Raoul Bott provides another local-to-global bridge: a holomorphic Lefschetz fixed-point formula expresses a global alternating trace in terms of contributions at fixed points. Such results make local geometric calculations determine invariants of global spaces of solutions.[ref]