Thomas Schlumprecht studies the theory of Banach spaces. His joint work with Edward Odell proved arbitrary distortion of infinite-dimensional Hilbert space.^[ref]

For each chosen distortion threshold, one constructs an equivalent norm whose variation cannot be avoided by passing to any infinite-dimensional subspace. The same threshold need not describe a single norm for every possible ratio: the norm is chosen after the desired ratio. This quantifier order is central to the result and to the notion of bounded distortion of a Banach space.^[ref]

Edward Odell worked on the geometry of Banach spaces. With Thomas Schlumprecht, he solved the distortion problem for the classical infinite-dimensional Hilbert space by proving it arbitrarily distortable.^[ref]

An equivalent norm can preserve the underlying vector-space topology yet stretch unit vectors very differently inside every infinite-dimensional subspace. For any prescribed ratio greater than one, their construction forces such variation. This distinguishes topological equivalence of norms from uniform control of their geometry on large subspaces.^[ref]

Charles Loop developed triangular subdivision surfaces. Loop subdivision repeatedly refines a control mesh and updates vertices by weighted averages, producing a smooth limiting shape.^[ref]

His later work modifies edge masks to obtain bounded curvature and a convex hull preservation. The analysis depends on eigenvalues of the subdivision operator, especially near extraordinary vertices whose number of neighbors differs from the regular triangular-grid case. Thus a local averaging algorithm has global smoothness and shape-preservation questions.^[ref]

Erwin H. Bareiss developed integer-preserving methods for Gaussian elimination. The Bareiss algorithm uses determinant identities to arrange divisions that are exact, reducing the growth of intermediate rational expressions.^[ref]

An update combines two products and divides by a previous pivot. The reason this stays in the integers is structural: the quantities represent related minors satisfying Sylvester identity for bordered minors. This makes exact linear algebra practical without replacing the calculation by floating-point approximation.^[ref]

Jaap van Oosten works on category theory, the theory of the topos and realizability, connecting mathematical structures with models of computation. Utrecht's publication record verifies this research program.^[ref]

His Topos Theory by Jaap van Oosten (2018) explains how categorical structure can transport logical constructions. Its adjoint lifting theorem for monad algebra functors builds an adjoint at an algebraic level from an adjunction and suitable presentations underneath. The notes apply this to logical functors using power-object structure, making precise when a familiar construction survives passage to a richer category.^[ref]

Michelangelo Ricci investigated geometric problems of maxima and minima in the seventeenth century. A 1666 letter preserved by the Royal Society discusses his mathematical booklet and its argument concerning limits, providing contemporary evidence of its reception.^[ref]

A modern illustration of the relevant kind of optimization problem is to maximize $x^m(a-x{)}^n$ for $0<x<a$ and positive $m,n$. Differentiating its logarithm gives $m/x-n/(a-x)$, so the maximum occurs at $x=ma/(m+n)$. This calculation illustrates how a geometric extremum can become an algebraic relation; it does not attribute modern derivative notation to Ricci.

Andrés E. Caicedo works on set theory. His author homepage identifies the specialization, while his teaching archive develops cardinal arithmetic and elementary embeddings.^[ref]

His cardinal-arithmetic lectures explain restrictions on elementary embeddings into transitive targets. A fixed point above the critical point can have an image that the target itself does not contain, a phenomenon proved using coding and combinatorial set theory. The example illustrates why an embedding's behavior on ordinals cannot be inferred from ordinary inclusion alone.^[ref]

Yiannis N. Moschovakis works on descriptive set theory and its connections with mathematical logic and definability. His Descriptive Set Theory by Yiannis N. Moschovakis (2009) develops the classification of sets of real numbers through definability and games.^[ref]

The Friedman–Moschovakis coding lemma illustrates how uniform descriptions can be constructed for complicated sets. Coding games and ordinal codes turn existence questions into structured definability arguments. The framework makes it possible to compare not just the sizes of sets but the complexity of specifying their members.^[ref]

Richard Kaye works on mathematical logic and arithmetic model theory. His exposition of Tennenbaum's theorem studies why countable nonstandard arithmetic cannot have an ordinary computable presentation with computable operations.^[ref]

The proof encodes a standard nonrecursive set inside a nonstandard model, using recursively inseparable sets and overspill. If the model's arithmetic were computable in the required way, the coded set could be recovered algorithmically, giving a contradiction. Kaye's account makes the interaction between model theory and computability theory explicit.^[ref]

Jocelyn Quaintance coauthored mathematical expositions on computation with Jean Gallier. Their Introduction to the Theory of Computation: Computability, Complexity, and the Lambda Calculus by Jean Gallier and Jocelyn Quaintance (2020) develops links among formal computation, lambda calculus and arithmetic.^[ref]

The arithmetic chapter distinguishes the finite axioms of Robinson arithmetic from the mathematical induction schema used in Peano arithmetic. This matters computationally: a formal language can express arithmetic operations while different axiom systems prove different claims about them. The exposition connects symbolic rules with limits on what algorithms and formal proofs can establish.

Tse Leung So studies homotopy-theoretic questions about Lie groups. His paper on commutator orders examines the Samelson product in low-rank groups and its odd-primary behavior.^[ref]

The group commutator is trivial when either input is the identity. It therefore descends from a Cartesian product to a smash product, turning noncommutativity into a based topological map. Its homotopy order measures information that the ordinary multiplication table alone does not express.^[ref]

Vitaly Bergelson studies the interaction of ergodic theory with Ramsey theory and arithmetic patterns. His Ohio State publication list documents work on recurrence, polynomial configurations and semigroup actions.^[ref]

His Ergodic Ramsey Theory - an update by Vitaly Bergelson develops the exchange between recurrence in dynamical systems and structured configurations in subsets of integers. With Neil Hindman and Kendall Williams, he also extended Milliken–Taylor theorem patterns to polynomial settings, using algebraic properties of ultrafilters to obtain monochromatic configurations.^[ref][ref]

Mark B. Villarino wrote an elementary classification argument for Archimedean solids using Euler formula for a sphere. His paper proves the thirteen exceptional convex cases, treating prisms and antiprisms as separate infinite families.^[ref]

The counting argument relates the faces meeting at a vertex to a global constraint on vertices, edges and faces. This makes a short topological identity constrain possible three-dimensional shapes. The classification must specify its convexity and vertex-uniformity assumptions to avoid including different notions of semiregularity.

F. J. M. Barning gave a matrix-based generation process for primitive Pythagorean triples. His 1963 Mathematisch Centrum report verifies the initials and presents three unimodular matrices generating all such triples without repetition, with a fixed leg-order convention.^[ref]

The transformations preserve the equation $x^2+y^2=z^2$. Starting from $(4,3,5)$, with the even leg first, repeated transformations build a branching tree of solutions. The method turns a Diophantine equation into a recursive enumeration algorithm with a uniqueness theorem.^[ref]

Ivan Niven wrote a celebrated elementary proof of the Irrationality of pi. His one-page 1947 article turns a hypothetical rational expression for $\pi$ into an impossible integer integral.^[ref]

A factorial-normalized polynomial has integer-valued endpoint derivatives under the assumption $\pi =a/b$. Repeated integration by parts makes its integral against $\sin x$ an integer. Yet positivity and the factorial denominator make that same integral lie strictly between zero and one for sufficiently large degree. The contradiction demonstrates how carefully designed analytic estimates can establish an arithmetic fact.^[ref]

Borys Kadets works on algebraic geometry and arithmetic questions involving Galois groups. His paper on monodromy of hyperplane sections of a smooth curve studies permutations of the intersection points between a projective curve and a moving hyperplane.^[ref]

For an appropriate irreducible projective curve in characteristic zero, the monodromy is the full symmetric group. In positive characteristic it can be smaller, and the paper analyzes these alternatives. This makes the characteristic of the coefficient field visible in how geometric intersection points can be permuted.^[ref]

Pavel Etingof studies representation theory, quantum groups and noncommutative algebra. His MIT research profile places this work at the intersection of algebra and mathematical physics.^[ref]

His Lie Groups and Lie Algebras by Pavel Etingof (2024) develops the bridge from continuous groups to their infinitesimal algebraic structures. A Lie algebra representation replaces a nonlinear group action with linear operators satisfying bracket identities; the theory then recovers structural information about Lie groups. His work on tensor categories broadens the study of representations by treating their tensor products and compatibility maps as part of the mathematical object.^[ref][ref]

Emmanuel Breuillard works on group theory and its connections with geometry and additive structure. With Ben Green and Terence Tao, he proved the structure theorem for approximate groups.^[ref]

An approximate group is a finite symmetric set whose products can be covered by a bounded number of translates of itself. The theorem finds controlled nilpotent structure behind that bounded growth. It lets a local combinatorial restriction on products constrain the larger algebraic organization of the set.^[ref]

Robert A. Wilson works on finite groups, their group representations and computational constructions, especially sporadic simple groups. His research homepage documents this specialization and work on the Monster group.^[ref]

His work on Suzuki group of Lie type and Ree group of type G2 constructs these exceptional families through automorphisms and analyzes their actions and simplicity. His lectures on sporadic groups also connect Mathieu groups with the symmetries of the extended binary Golay code, illustrating how error-correcting structures reveal exceptional finite symmetry.^[ref][ref]

Patrice Philippon works on transcendental number theory. His joint chapter with Michel Waldschmidt gives lower bounds for linear forms in logarithms of algebraic numbers, explicitly distinguishing general algebraic coefficients from rational-integer coefficients.^[ref]

The central arithmetic question is quantitative: once a logarithmic combination is known to be nonzero, how closely can it approach zero? An explicit bound links Diophantine approximation to finite calculations and can help restrict candidate solutions of Diophantine equations.