Template SpringerEOM with broken ref

In combinatorics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid axiomatically, the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or flats. In the language of partially ordered sets, a finite simple matroid is equivalent to a geometric lattice.

theorem that a pointwise bounded set of linear operators on a Banach space is uniformly bounded in operator norm

a combinatorial object useful in representation theory

partial differential equation (PDE) of order n that has a well-posed initial value problem for the first n−1 derivatives

theorem

mathmatical function

not-necessarily-associative commutative algebra over a field satisfiying the identity (𝑥𝑦)𝑥²=𝑥(𝑦𝑥²)

type of integration

physics function introduced by Eugen von Lommel

parametrizes complex structures on a surface

conjecture

nonnegative extended real number that is a measure of the complexity of a topological dynamical system

mathematic term

module over a ring such that zero is the only element annihilated by a regular element of the ring

type of group

ring in algebra

Hilbert space equipped with a dense subspace that carries (in addition to the subspace topology) a finer topology such that the inclusion map is continuous

irreducible nodal surface

inequality on approximations of a function by algebraic or trigonometric polynomials

solutions of Legendre's differential equation