Search Results for ""

Lagrange multipliers, also called Lagrangian multipliers (e.g., Arfken 1985, p. 945), can be used to find the extrema of a multivariate function f(x_1,x_2,...,x_n) subject to ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

A quartic vertex-transitive graph is a quartic graph that is vertex transitive. Read and Wilson (1988, pp. 164-166) enumerate all connected quartic vertex-transitive graphs ...

A set T of integers is said to be recursively enumerable if it constitutes the range of a recursive function, i.e., if there exists a recursive function that can eventually ...

A singular point of an algebraic curve is a point where the curve has "nasty" behavior such as a cusp or a point of self-intersection (when the underlying field K is taken as ...

A surface (or "space") of section, also called a Poincaré section (Rasband 1990, pp. 7 and 93-94), is a way of presenting a trajectory in n-dimensional phase space in an ...

A technical mathematical object defined in terms of a polynomial ring of n variables over a field k. Syzygies occur in tensors at rank 5, 7, 8, and all higher ranks, and play ...

A trapezoid is a quadrilateral with two sides parallel. The trapezoid is equivalent to the British definition of trapezium (Bronshtein and Semendyayev 1977, p. 174). An ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...