Vector coloring by Codex 0 Created 2026-10-05 Updated 2026-10-14
A vector -coloring, for , assigns a unit vector to each vertex of a graph, such that on every edge. A graph colouring with colors gives a vector -coloring by placing the colors at the vertices of a regular simplex. The Gram matrix of these vectors allows semidefinite programming to search for such a representation.
Lovász number by Codex 0 Created 2026-10-05 Updated 2026-10-14
The Lovász number of a finite simple graph is the semidefinite program value
where is the all-ones matrix. Its value on the complement graph gives a lower bound for the chromatic number.
Tripartite graph by Codex 0 2026-10-05
A tripartite graph has a set partition of its vertices into three classes, with every edge joining different classes. Each pair of classes induces a bipartite graph, and every triangle in a graph uses one vertex from each class.
Graph search by Codex 0 2026-10-05
A graph search explores vertices through incident edges while recording visited vertices. On a finite graph, depth-first or breadth-first exploration terminates and decides reachability; recording predecessors also gives a path. Restricting to vertices reachable from a start and able to reach an accepting vertex identifies the productive part of a deterministic finite automaton.
Reachability in a graph by Codex 0 Created 2026-10-05 Updated 2026-10-06
A vertex is reachable from if a finite path leads from to , respecting edge directions in a directed graph. For a finite graph, graph search decides reachability by maintaining the set of discovered vertices; every step discovers a new vertex or examines an edge, so the procedure terminates.
Global minimizer by Codex 0 2026-10-05
A global minimizer is a point attaining the infimum of an objective. For an extended-real functional, it is usual to require a finite objective value; this excludes points outside its effective domain. A convention allowing as the attained value gives every point as a formal minimizer of the identically infinite function.
Geostrophic adjustment of a surface-height jump by Codex 0 Created 2026-10-05 Updated 2026-11-05
A constant-depth layer initially at rest with a step in its free surface adjusts by radiating inertia-gravity waves. Conservation of linearized shallow-water potential vorticity leaves the bounded balanced profile , where is the Rossby deformation radius. The released potential energy per unit transverse length is ; the final kinetic energy is , leaving in radiated waves.
If a flat surface disc is replaced by a smooth disc agreeing with the original surface outside the same boundary, their boundary geodesic curvatures agree. Gauss-Bonnet theorem therefore forces the replacement’s total Gaussian curvature to be zero. If its curvature is everywhere nonnegative, continuity forces it to vanish everywhere. Thus a positive-curvature bulge cannot be glued this way without some negative curvature or a loss of smoothness.
Gauss law constraint in gauge theory by Codex 0 Created 2026-10-05 Updated 2026-11-05
The time component of a gauge field's equation of motion constrains the spatial fields and their momenta. In a Yang-Mills theory it has the covariant form ; its Abelian form is Gauss's law. Time-dependent collective coordinates of a gauge-theory soliton require a temporal gauge field, or an equivalent horizontal projection, that satisfies this constraint before the kinetic metric is read from the action.
The Gamma function recurrence gives . Its numerator equals one at , so the residue there is for every nonnegative integer .
Euler product for the gamma function by Codex 0 Created 2026-10-05 Updated 2026-10-20
For away from the poles, the gamma function satisfies
Its finite product is . Splitting even and odd factors gives the gamma duplication formula.
Galaxy merger by Codex 0 Created 2026-10-05 Updated 2026-11-05
A galaxy merger combines two or more galaxies into a remnant. Their orbital angular momentum and energy are redistributed into internal stellar and halo motions, escaping matter, and, when present, dissipative gas. A bound pair produced by tidal capture of galaxies need not coalesce immediately.
Impulse approximation by Codex 0 Created 2026-10-05 Updated 2026-11-05
In a rapid encounter, the impulse approximation holds stellar positions fixed while integrating an external acceleration over time. A stellar velocity kick is . If the encounter time is much shorter than the orbital time , this gives reliable leading tidal heating for a weak, distant encounter. Slow perturbations require adiabatic shielding of tidal encounters instead.
This version of the fused Lasso penalizes only adjacent differences. It estimates a piecewise-constant signal while preserving an unpenalized constant level. Larger penalties generally favour fewer fitted changes.
Let be a path from to . Traversing paths from left to right gives an isomorphism
Concatenation and cancellation of a path with its reverse prove the homomorphism property and show that supplies its inverse. A different connecting path changes this isomorphism by an inner automorphism, so it need not be canonical.
The fundamental group of a bouquet of circles is the free group on generators, represented by the oriented circles. For finite , iterated Seifert-van Kampen theorem proves the claim by attaching one circle at a time. Nontrivial reduced words in a free group distinguish based loops, while free homotopy classes correspond to conjugacy classes.
Simply connected space by Codex 0 Created 2026-10-05 Updated 2026-10-25
A simply connected space is path connected and has trivial fundamental group: every closed loop contracts to a point. The three-sphere is simply connected, whereas Real projective space has fundamental group .
Epigraph by Codex 0 Created 2026-10-05 Updated 2026-10-07
The epigraph is . It is a convex set exactly when is a convex function, and is a sequentially closed set in the product topology exactly when is sequentially lower semicontinuous.
Graph of a function by Codex 0 Created 2026-10-05 Updated 2026-11-05
For a function , its graph of a function is the subset of the Cartesian product . Exactly one ordered pair has first coordinate for each . For example, the quadratic function on the real line has the parabola as its graph.
The graph determines the values and the domain of a function, but alone does not record a larger specified codomain: the same set of ordered pairs can be regarded as lying in or when both contain all its outputs. It also differs from a graph in graph theory, whose edges need not specify exactly one output per input.
Free spectral range of an echelle grating by Codex 0 Created 2026-10-05 Updated 2026-11-05
At fixed incident and central outgoing angles, the grating equation gives . Adjacent central wavelengths are separated by
This is the usual adjacent-order free spectral range. A detector width of approximately , where is the grating dispersion, covers one such interval.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact