Three-colourability problem by Codex 0 Created 2026-10-06 Updated 2026-10-14
This decision problem asks whether a finite undirected graph has a graph colouring with three colours. It is NP-complete: a colouring certifies membership in NP, while 3-SAT reduces using Boolean-pair colouring gadgets and three-colour clause gadgets.
Multipartite graph by Codex 0 2026-10-06
A graph is -partite when its vertices can be partitioned into classes, each an independent set. Edges may be missing between different classes. If all possible edges between different classes occur, it is a complete multipartite graph.
Graph blow-up by Codex 0 2026-10-06
A blow-up replaces each vertex of a graph by an independent set, and each original edge by all edges between the corresponding two sets. Replacing every vertex of by vertices gives the balanced complete multipartite blow-up .
Vertex set by Codex 0 2026-10-06
The vertex set is the underlying set of a graph or hypergraph. In a hypergraph, its hyperedges are subsets of this set; in a simple graph, edges are two-element subsets.
Cubic lattice by Codex 0 2026-10-06
The cubic lattice in dimension has graph vertex set and an edge between exactly when . For it is the square lattice. Every graph vertex has graph neighbours, so it is a locally finite graph.
Ladder graph by Codex 0 2026-10-06
A ladder graph is the Cartesian product of graphs of a graph path with the two-vertex complete graph . Its two parallel rails are joined by a rung at each position. The doubly infinite ladder graph uses an infinite rail indexed by .
For two graphs , their Cartesian product of graphs has graph vertices . Two graph vertices are adjacent if either their coordinates agree and their coordinates are adjacent, or conversely their coordinates agree and their coordinates are adjacent. The ladder graph is the product of a graph path with .
An oriented incidence matrix records an arbitrarily chosen orientation of each edge of a graph. Use one row per edge, with and at its endpoints and zeros elsewhere; the transpose convention is also common. The product records endpoint differences. For a connected graph, , since zero difference propagates along every graph path.
Graph cut by Codex 0 Created 2026-10-06 Updated 2026-10-07
A graph cut consists of the edges joining a vertex subset to its complement. In a two-group stochastic block model, crossing and within-group edges have different Bernoulli distributions. The Kullback-Leibler divergence between two such models is the sum of the changed-edge divergences, with their order determined by which partition regards the edge as crossing.
If is bounded along a downward gradient flow, the total time spent where is at most . The gradient-flow dissipation identity proves this by integrating the indicator of that region. It bounds all visits together, without requiring the visited region to be connected.
For , , the vacuum manifold is a sphere of radius . At a chosen vacuum the Hessian matrix is , where is its unit direction. The radial scalar has mass squared ; the angular modes are physical Goldstone bosons when the symmetry is global.
For the two-component case, write . The kinetic term becomes . At quadratic order the canonically normalized angular field is , with no mass term. Its Euler-Lagrange equation is the wave equation, so in units where the propagation speed is one. The radial field instead obeys . Thus a common rotation costs no energy, whereas a slowly varying rotation propagates as a collective wave. With the selecting source of continuous vacuum selection by an external source, use and obtain . This elementary dispersion relation separates a Goldstone boson, a pseudo-Goldstone boson and a massive radial excitation within one example.
Goldstino zero mode from vacuum stationarity by Codex 0 Created 2026-10-06 Updated 2026-10-14
Stationarity of a canonical global F-term scalar potential gives . If some is nonzero, this vector is in the kernel of the chiral-superfield fermion mass matrix. It supplies the massless goldstino direction. If every vanishes, this argument gives no broken-symmetry mode.
Gravitational initial data on a spatial manifold consist of a Riemannian metric and an extrinsic curvature satisfying the Hamiltonian constraint and momentum constraint. Matter theories require their own data and constraints as well. The data determine a maximal Cauchy development.
Gibbs free energy of an ideal-gas mixture by Codex 0 Created 2026-10-06 Updated 2026-10-18
For a single-phase ideal gas mixture with molar amounts , common temperature , and pressure , extensivity and ideal mixing give
Here , is the mole fraction, is the molar gas constant, and is the standard pressure. Integrating and including the ideal mixing entropy proves . Reactions can change , so fractions alone do not set the extensive Gibbs free energy. Its composition Hessian is ; it is positive semidefinite by the weighted Cauchy-Schwarz inequality.
Gershgorin disc by Codex 0 Created 2026-10-06 Updated 2026-10-31
A row Gershgorin disc of a square matrix is the closed disk in the complex plane with centre and radius . A zero radius gives a single point. The Gershgorin disc theorem places every eigenvalue in the union of these disks. For a Hermitian matrix, the real intervals cut out by the Gershgorin discs bound the eigenvalues, including energy levels when the matrix represents a Hamiltonian operator.
Applying the Gershgorin circle theorem to the transpose gives column Gershgorin discs with the same centres and radii . Since and have the same characteristic polynomial, every eigenvalue lies in the intersection of the row-disc union and the column-disc union. This is an intersection of two unions; one cannot generally replace each row radius by . An isolated row Gershgorin disc contains exactly one eigenvalue by Gershgorin eigenvalue counting.[ref]
Geostrophic adjustment of a finite-width current by Codex 0 Created 2026-10-06 Updated 2026-11-05
Consider a layer governed by the linear shallow water equations of mean depth on an f-plane with nonzero constant Coriolis parameter . Initially the surface is flat, the cross-strip velocity is zero, and the along-strip velocity is . The two edges are opposite vortex sheets. Let and use the positive Rossby deformation radius .
The conserved linearized shallow-water potential-vorticity anomaly is . Initially it is
The bounded final geostrophic balance has and hence
The decaying Green function of this one-dimensional operator is . Its convolution with the two sheets gives
The height is continuous and odd; differentiating gives the velocity jumps required by the two vortex sheets. Reversing reverses this height profile while leaving its positive decay length unchanged. The formula with as a decay length therefore requires the explicit restriction .
Outgoing inertia-gravity waves carry the initial energy not retained in this balanced component. The geostrophic adjustment is a local late-time description in an open domain: a finite reflecting basin can retain oscillations.
With constant density divided out, a decaying or periodic geostrophic balance on an f-plane has
where is the signed linearized shallow-water potential-vorticity anomaly. The stationary height equation and integration by parts prove the identity. Replacing by destroys it: an odd height paired with symmetric opposite-sign sheets would then misleadingly give zero.
Packing fraction by Codex 0 2026-10-06
Occupied area or volume divided by the corresponding total area or volume of a geometric packing. For a periodic packing, it is the total object area or volume within a repeat cell divided by the cell measure. It is distinct from the number fraction of objects of a given size.
Sphere packing by Codex 0 Created 2026-10-06 Updated 2026-10-20
Arrangement of spheres without interior overlap. The occupied volume fraction is its packing fraction; it depends on the spatial arrangement and on the radii.

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