John Edensor Littlewood was a mathematician whose work with Godfrey Harold Hardy connected analysis, inequalities, series and the Riemann zeta function. Their collaboration helped develop the Hardy-Littlewood circle method for arithmetic counting problems. He also worked with Mary Cartwright on nonlinear ordinary differential equations motivated by radio engineering, including the Van der Pol equation.^[ref] Their investigations of strongly driven oscillators helped reveal how a deterministic dynamical system can have complicated long-term behavior. This makes his work a bridge between the estimates of classical analysis and the geometric study of dynamical systems.

Godfrey Harold Hardy was a mathematician whose work joined analysis with number theory, including Fourier series, the Riemann zeta function and the distribution of prime numbers. His long collaboration with John Edensor Littlewood and his work with Srinivasa Ramanujan produced influential methods and results in analytic number theory.^[ref] The Hardy-Littlewood circle method exemplifies this connection: it studies arithmetic counting problems through an integral of products of exponential sums, separating regions near rational points from the remaining contribution. His teaching also helped establish rigorous accounts of limits, functions and convergence in English undergraduate analysis.

David E. Joyce is a mathematician whose mathematical writing and online resources cover Euclidean geometry, algebra, complex numbers and dynamical systems. His annotated presentation of Euclid's Elements makes the structure of the ancient text accessible through explanations and geometric diagrams. His other resources explore symmetry, knot theory, hyperbolic geometry and pictures of Julia sets and Mandelbrot sets.^[ref] These topics share a visual route into abstract mathematics: a construction or a computer-generated picture suggests relationships, while definitions and proofs determine which of those relationships hold generally.

Homepage: mathcs.clarku.edu/~djoyce/

Herbert Robbins was a mathematician and statistician whose research ranged from topology to Empirical Bayes method methods and stochastic approximation. With Sutton Monro, he introduced an iterative approach to finding a zero of a function when observations of its values contain random error. Instead of requiring exact function evaluations, successive corrections use noisy measurements with diminishing step sizes. This idea became fundamental to stochastic optimization.^[ref] He also coauthored an influential mathematical exposition with Richard Courant, emphasizing explanations and examples that reveal why a proof works rather than a collection of calculation rules.

Nimrod Megiddo is a mathematician known for research on optimization and the computational complexity theory of algorithms. His fixed-dimensional linear programming algorithm solves a problem with $n$ constraints in $O(n)$ time when the dimension $d$ is fixed. The dependence on $d$ is absorbed into the constant, so this statement does not give a uniformly linear algorithm when the number of variables also grows.^[ref] This result illustrates a useful distinction in computational complexity theory: a geometric optimization problem can become much easier when its ambient dimension is a fixed parameter.

Homepage: theory.stanford.edu/~megiddo/

Refael Hassin is a mathematician working on combinatorial optimization and strategic behavior in queueing theory. His research asks how individual decisions change the operation of a service system: customers may decide whether to join a queue, while its operator chooses prices or what information to reveal.^[ref] One of his studies considers a service rate or quality known to the operator but uncertain to customers. Revealing that information can change customer decisions and the operator's expected profit, so greater information does not automatically have the same consequences for every participant.^[ref]

Homepage: english.tau.ac.il/profile/hassin

Marin Mersenne was a mathematician and scientific correspondent whose network helped Pierre de Fermat, René Descartes and other researchers exchange questions and results. He studied number theory and the acoustics of vibrations of mechanical strings.^[ref] A Mersenne number has the form $2^p-1$; for it to be a Mersenne prime, $p$ must be a prime number, although that condition is not sufficient: $2^{11}-1=23\cdot 89$. For an ideal stretched mechanical string, the fundamental frequency is $f=(2L{)}^{-1}\sqrt{T/\mu }$, relating the audible pitch to the length $L$, tension $T$ and mass per unit length $\mu$.

Euclid was a mathematician associated with Alexandria around 300 BCE. His Euclid's Elements organized geometry and number theory into definitions, assumptions and chains of proofs, drawing together earlier results as well as material attributed to him. Very little reliable biographical information survives, so the familiar portraits are later imagined likenesses.^[ref] The lasting attraction of the Euclid's Elements is its deductive structure: a construction or mathematical theorem becomes reusable in subsequent proofs, rather than remaining an isolated calculation. Its Euclidean algorithm and proof that there are infinitely many prime numbers remain basic tools of number theory.

Peter G. Doyle is a mathematician whose work connects geometry, combinatorics and probability theory. His book with J. Laurie Snell explains how a random walk on a graph can be studied through an electrical network: a probability of reaching one boundary before another satisfies the same averaging equations as an electrical potential.^[ref] His work on isospectral manifolds also investigates how much geometry can be recovered from the spectrum of a differential operator: equal vibration frequencies need not determine the shape.^[ref]

Homepage: faculty-directory.dartmouth.edu/peter-doyle

J. Laurie Snell worked on Markov chains and their applications and wrote Introduction to Probability by Charles M. Grinstead and J. Laurie Snell with Charles M. Grinstead. His autobiographical research statement also describes work on finite mathematics and teaching people to assess probability and statistical claims in the news.^[ref] A Markov chain replaces the full history by a specified present-state transition law; first-step analysis then turns hitting probabilities and expected hitting times into linear equations. That link between a stochastic model and solvable equations is central to the subject's practical usefulness.

Homepage: chance.dartmouth.edu/Laurie.x.html

Charles M. Grinstead coauthored Introduction to Probability by Charles M. Grinstead and J. Laurie Snell with J. Laurie Snell. The institutional publication record identifies the1997 second revised edition and its authors.^[ref] The text develops probability from concrete models through tools such as conditional probability, expectation and Markov chains. For example, counting length-$n$ sequences of independent fair coin tosses gives probability$2^{-n}\left(\genfrac{}{}{0ex}{}{n}{k}\right)$ for exactly$k$ heads, connecting discrete counting with a probability model rather than treating either in isolation.

Homepage: works.swarthmore.edu/fac-math-stat/153/

Johann Andreas von Segner trained in medicine and later worked in mathematics, physics and astronomy. His institutional biography emphasizes fluid mechanics and his development of a reaction water wheel, an early hydraulic turbine.^[ref] The apparatus turns a redirected water flow into torque: the exiting fluid carries angular momentum, and its change is balanced by a reaction on the rotor. This makes the device an example of how a conservation law becomes a mechanical design principle.

Homepage: www.catalogus-professorum-halensis.de/segner-johann-andreas.html

Eugène Charles Catalan studied counting problems including triangulations of a polygon, leading to the sequence now called the Catalan numbers.^[ref] The formula $C_n=(n+1{)}^{-1}(\genfrac{}{}{0ex}{}{2n}{n})$ counts several apparently different families: triangulations of a convex $(n+2)$-gon, balanced parenthesizations and plane binary-tree structures. The Catalan recurrence expresses how selecting a root operation divides such an object into two smaller objects. This illustrates why a historical counting problem can become a reusable language for combinatorics.

Homepage: 200.ulg.ac.be/catalan-bio.html

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.

Homepage: www.math.ucla.edu/~pak/

Willem Mantel posed the1907 question now associated with the triangle-free extremal bound: a triangle-free graph with $n$ vertices has at most $\lfloor n^2/4\rfloor$ edges. A balanced complete bipartite graph attains the bound. The historical record distinguishes the proposer from the published solver, Willem Abraham Wythoff. Mantel also taught calculus to prospective engineers in Delft.^[ref] The result is a model of extremal graph theory: forbidding a small configuration imposes a global limit on edge density.

Homepage: www.nieuwarchief.nl/serie5/pdf/naw5-2016-17-4-275.pdf

Pál Turán worked in number theory and combinatorics. His1934 proof of the typical size of the number of prime divisors became an important precursor of probabilistic number theory: averaging a counting function can reveal the behaviour of almost all integers without computing it separately for each integer.^[ref] In extremal graph theory, the theorem carrying his name asks how many edges force a complete subgraph. The triangle case gives the sharp threshold$\lfloor n^2/4\rfloor$, attained by a balanced complete bipartite graph.

Homepage: mathshistory.st-andrews.ac.uk/Biographies/Turan/

Robbert Fokkink studies game theory, dynamical systems, ergodic theory and topology. His research statement highlights search games, symbolic sequences and the topology of inverse limits and tiling spaces.^[ref] A search-game model makes uncertainty strategic: the best search plan depends on where a target can be hidden and what information the searcher receives. His historical research on Willem Abraham Wythoff also connects the provenance of early extremal graph theory with the study of mathematical games.^[ref]

Homepage: diamhomes.ewi.tudelft.nl/~rfokkink/

Jan-Hendrik Evertse works in number theory, particularly Diophantine equations. His books study the unit equation over a number field, equations involving discriminants, and effective methods for Diophantine equations over finitely generated integral domains. The effective viewpoint asks for bounds and procedures that make solution sets accessible to explicit computation, beyond an abstract existence or finiteness statement.^[ref]

Homepage: pub.math.leidenuniv.nl/~evertsejh/

A German mathematician who made major contributions to elliptic functions, number theory and Hamiltonian mechanics. His 1829 work on elliptic functions developed a theory using theta functions, during the same period in which Niels Henrik Abel independently advanced the subject.

He also investigated first-order partial differential equations arising in dynamics and wrote extensively on determinants. The Jacobian determinant bears his name: it measures local volume scaling for a differentiable change of variables. This connects his work to both coordinate transformations in multivariable calculus and the study of dynamical equations. His Königsberg teaching helped establish research seminars as a way to train mathematicians. ^[ref]

Homepage: mathshistory.st-andrews.ac.uk/Biographies/Jacobi/

André Jürgen Massing works on numerical methods for partial differential equations, including finite element methods for fluid mechanics and problems with moving boundaries. His publications study both computational formulations and error estimates, connecting approximation on a mesh with the reliability of the simulated physical model.^[ref]

Homepage: www.ntnu.no/ansatte/andre.massing