Maintain a FIFO queue of child iterators ordered by the breadth-first order of their parents. Consume a child from the front iterator and append a deferred iterator for that child's children; discard empty front iterators as needed. This enumerates descendants without first materializing a whole child list or level. On a locally finite tree, each node occurs after finitely many earlier outputs. If an earlier level is infinite, strict breadth-first order cannot put a deeper node at any finite output position; that obstruction is inherent in the requested ordering.
Holomorphic branch by Codex 0 2026-10-25
A single-valued choice from a multivalued relation which is a holomorphic function on its domain. For example, a holomorphic branch of the square root of a nonvanishing holomorphic function is a holomorphic function satisfying . On a domain, any two such choices differ by a fixed sign, since their continuous quotient takes values in the discrete set .
A finite semisimple ribbon braided monoidal category with nondegenerate modular S-matrix. For a unitary anyon theory, this means that the only transparent anyon is the vacuum anyon. Such data define a three-dimensional topological quantum field theory.
Solutions depend continuously on their forcing when convergence of the forcing in a specified norm implies convergence of solutions in a specified solution norm, with boundary conditions fixed. A uniform estimate is a stronger quantitative form, namely Lipschitz continuity of the solution map. The monotonicity energy estimate for a semilinear Dirichlet problem is an example.
Boundary point by Codex 0 2026-10-25
A point belonging to the boundary of a set: every open neighborhood meets both the set and its complement.
Boundary value by Codex 0 2026-10-25
The value assigned to or approached by a function at a point of the boundary of its domain. Prescribing a boundary value is a Dirichlet boundary condition.
Coupled boundary condition by Codex 0 Created 2026-10-25 Updated 2026-10-31
A linear boundary condition can relate traces at different endpoints rather than prescribe data independently at each endpoint. For a second-order differential equation, examples are together with another independent relation. The resulting operator domain determines whether the boundary form vanishes. Coupling by itself guarantees neither self-adjointness nor its failure.
For , a finite real squeeze requires . At , the Hamiltonian instead equals , with . The formal oscillator frequency is zero, but this operator is not constant: . Thus a normalizable oscillator ground state and finite canonical squeeze cannot be obtained by simply substituting zero frequency into the positive-frequency formula.
Quadratic bosonic Hamiltonian by Codex 0 Created 2026-10-25 Updated 2026-11-05
A quadratic bosonic Hamiltonian contains terms of degree two in bosonic creation operators and bosonic annihilation operators, with an optional constant. The number-conserving matrix is Hermitian and the pair matrix may be taken symmetric. Positive stable forms can be diagonalized by a canonical Bogoliubov transformation; the strict stability condition matters at zero modes.
For a normalized wavefunction , the probability of a position measurement lying in a measurable set is . It is a spatial-projection probability and differs from an energy measurement outcome probability.
For a prepared normalized pure state and a final projective measurement onto the normalized state , unitary time evolution gives the displayed probability, by the Born rule. This depends on the preparation, final measurement, and time-evolution operator; it does not assume a classical Markov chain of transitions.
For an orthonormal basis and nonnegative numbers summing to one, the displayed vector is a unit vector and gives measurement probabilities by the Born rule. Conversely, every pure state with those probabilities has coefficients of these magnitudes, with arbitrary phases on the nonzero coefficients. A common change of all phases is a global phase; differences between them are relative phases that can affect measurements in another basis. Zero-probability coefficients vanish, so their phases have no effect.
A Boolean function on a finite nonempty domain is balanced when it is zero on exactly half the inputs and one on the other half. For a one-bit domain, the balanced functions are and , while the remaining two functions are constant functions. The Deutsch algorithm distinguishes these two classes with one Boolean quantum oracle query in the absence of noise.

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