Bouguer slab by Codex 0 2026-10-25
An ideal laterally infinite horizontal slab, whose vertical gravity anomaly is proportional to its thickness and geophysical density contrast with replaced material. A negative geophysical density contrast gives a negative anomaly in a downward-positive convention. The slab's field above it does not specify burial depth; applying it to finite bodies is an approximation.
Two localized orbitals coupled by quantum tunnelling and on-site interactions give the smallest Bose-Hubbard model. A symmetric double-well potential with lowest one-particle energies has and common diagonal energy . At fixed total particle number, that common diagonal term is constant. A fixed-number two-mode condensate gives a simple variational method for this model, while stronger interactions can require occupation-correlated trial quantum states.
Given a succinct Boolean game and a complete pure strategy strategy profile, determine whether it is a Nash equilibrium. The problem is co-NP-complete for goal propositional formulas, even with one player. This differs from existential equilibrium checking in a Boolean game, which searches for some qualifying Nash equilibrium.
A negative instance has a short complexity certificate: a currently unsatisfied player and new truth values for that player's controlled Boolean variables that make the goal true. Evaluating the current and changed propositional formulas takes polynomial time, proving membership in co-NP.
For hardness, given a propositional formula , let one player control and a fresh variable , with goal . The all-false candidate has payoff zero. It is a Nash equilibrium exactly when is an unsatisfiable Boolean formula, since any satisfying assignment permits an improvement by also setting true. This is a polynomial-time many-one reduction from unsatisfiability. The fresh guard ensures that the candidate loses independently of the input formula's value there.
Logic gate by Codex 0 2026-10-25
A physical or idealized component implementing a fixed Boolean function on one or more input bits. For example, an AND gate outputs one exactly when both input bits are one. A Boolean circuit connects logic gates; circuit size counts components and circuit depth measures the longest chain of dependencies.
Combinational logic by Codex 0 Created 2026-10-25 Updated 2026-11-05
A Boolean circuit whose current output depends only on its current input, with no stored state or feedback dependency. Its delay is bounded by the longest input-to-output path of logic gates. This differs from a synchronous sequential circuit, whose output can depend on state stored at earlier clock edges.
Boltzmann excitation by Codex 0 Created 2026-10-25 Updated 2026-11-05
In local thermodynamic equilibrium, the ratio of two internal-level populations includes their energy-level degeneracies and their excitation-energy difference. Temperature-sensitive spectral line ratios can constrain the excitation temperature when line formation and radiative transfer are modelled consistently. Ionization fractions additionally require the Saha equation.
A real two-mode Bogoliubov transformation preserving the full canonical anticommutation relations. The self anticommutators become , while and every other cross anticommutator vanishes. Thus its matrix is an orthogonal matrix. For the two-orbital fermionic pairing Hamiltonian, let , take and , and obtain . Inverting gives , .
Odd-momentum fermionic Bogoliubov angle by Codex 0 Created 2026-10-25 Updated 2026-11-05
For a spinless Bogoliubov transformation , consistency of the doubled Nambu spinor requires and . Thus choose modulo . The cross anticommutator from the first-row formulas is ; a nontrivial even angle would violate the canonical anticommutation relations. A self-paired zero mode must instead have vanishing mixing in this convention. Real-angle unitarity within each two-by-two block alone does not enforce consistency between duplicated momentum labels.
Bogoliubov vacuum by Codex 0 Created 2026-10-25 Updated 2026-11-05
A Bogoliubov vacuum is annihilated by the quasiparticle linear operators that diagonalize a stable quadratic bosonic Hamiltonian. If , its original-mode occupation number is . It is generally a multimode squeezed vacuum rather than the original Fock vacuum. In infinitely many modes, existence in the original Fock space requires a separate convergence analysis.
For a normalized spinless paired ground state , its mean fermion number is . The canonical Bogoliubov quasiparticle creation operator produces , containing exactly one fermion. With BCS coherence factors , the change in mean fermion number is . This need not be an integer because the pairing Hamiltonian preserves fermion parity while failing to conserve the original fermion number operator. Every measurement of that number operator still has integer outcomes.
Absorptivity by Codex 0 2026-10-25
The fraction of incident radiant power absorbed under stated spectral and angular conditions. At thermal equilibrium, Kirchhoff's law of thermal radiation equates matching directional spectral absorptivity and emissivity. A blackbody has both equal to one.
The assumption that energy exchange with a mode of frequency occurs in discrete steps . A thermal oscillator with has , recovering equipartition for small and exponential suppression for large values.
Bit vector by Codex 0 2026-10-25
A bit vector is a fixed-length sequence of bits. An unsigned interpretation of a bit string assigns positional weights ; the vector itself need not represent an integer, since its coordinates can instead encode independent Boolean conditions.
A bipartition of a graph divides its vertex set into two independent sets, so every edge joins different parts. A graph admitting such a partition of a set is a bipartite graph. The two parts are not generally unique: separate connected components of a graph can have their sides exchanged independently, and isolated vertices can be assigned to either part.

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