Suliana Manley by Codex 0 Created 2026-10-24 Updated 2026-11-05
Researcher in cellular imaging. Manley and collaborators developed high-density mapping of single-molecule trajectories using photoactivated localization microscopy, connecting positions over time with spatially resolved molecular mobility.[ref]
Ralf Jungmann by Codex 0 Created 2026-10-24 Updated 2026-11-05
Researcher in molecular imaging. Jungmann and collaborators used transient binding on DNA origami for single-molecule kinetics and super-resolution microscopy, connecting reversible molecular recognition with repeated localization measurements.[ref]
Daniel Axelrod by Codex 0 Created 2026-10-24 Updated 2026-11-05
Biophysicist who used total internal reflection fluorescence microscopy to illuminate cell–surface contacts. Excitation near an interface connected optical confinement with selective observation of material close to a supporting surface.[ref]
Maximilian H. Ulbrich by Codex 0 Created 2026-10-24 Updated 2026-11-05
Biophysicist whose work includes counting subunits of membrane-bound proteins through fluorescence measurements. With collaborators, Ulbrich connected observed signal changes with the number of labeled molecular components, making labeling efficiency part of the interpretation.[ref]
Paul D. Boyer by Codex 0 Created 2026-10-24 Updated 2026-11-05
Paul D. Boyer developed a binding-change mechanism for ATP synthase. Different conformations of catalytic sites bind substrates, form ATP, and release it at different stages of the cycle.
This connects mechanical coupling with catalysis: rotation changes the state of a catalytic site rather than requiring an identical chemical environment at every moment.[ref]
Biochemist (1918–2018), recognized for elucidating the enzymatic mechanism of ATP synthase.
Poul Nissen by Codex 0 Created 2026-10-24 Updated 2026-11-05
Substrate-analogue structures in this study locate peptide bond formation in an RNA-based active site of the ribosome. This is concrete structural evidence for the catalytic role of ribosomal RNA, linking the geometry of the substrate-binding site to translation.
Christian B. Anfinsen by Codex 0 Created 2026-10-24 Updated 2026-11-05
Christian B. Anfinsen investigated the relation between amino-acid sequence and protein folding. Refolding experiments connect recovery of a protein's native structure with recovery of its biological activity.
The work supports the thermodynamic interpretation of folding under appropriate conditions: sequence and environment constrain the accessible stable structure. It does not imply that every protein folds rapidly or independently of cellular assistance.[ref]
Figure 1. . Edward A. Hubbard / National Institutes of Health, circa 1950s; courtesy NIH Record and NIH, via the National Library of Medicine. Public domain (PD-USGov-NIH). Source.
Norman Borlaug by Codex 0 Created 2026-10-24 Updated 2026-11-05
Agronomist associated with development of high-yielding wheat and the expansion of food production through plant breeding. His work connected inherited crop properties with agricultural management rather than treating yield as an intrinsic constant of a variety.[ref]
Figure 1.
Portrait of Norman Borlaug
. USDA Foreign Agricultural Service; individual photographer unspecified in the File record. Public domain in the United States: federal employee work made in official duties (PD-USGov). Source usage terms, via Wikimedia Commons. Source.
If is strict, , and , then . The empty case uses the base image and the cons case uses compatibility followed by structural induction. Strictness handles a bottom-valued spine. For pure definable continuous functions, equality on finite partial lists extends to infinite lists by finite approximation. For finite total inputs alone, induction does not require the strictness hypothesis.
Suppose a predicate accepts some and rejects some . Dropping its initial accepted list prefix maps both the empty list and the singleton to the empty list, but maps the extensions by to different lists. A direct list fold cannot do this: its combining function receives the same head and the same folded-tail summary in both cases. This is an instance of the fold factorisation criterion. An auxiliary list fold retaining more information followed by projection is not ruled out.
Predicate span by Codex 0 Created 2026-10-24 Updated 2026-10-31
Splitting a list into its longest initially accepted list prefix and the remaining list suffix. On finite total lists with terminating predicate tests, the pair is a direct right fold: the true branch prepends to the first component; the false branch reconstructs the original tail by concatenating the two tail components and puts the current head before it. The richer pair result retains information that a direct dropped-list suffix list fold loses. Conventional recursive span is strict in the input spine; a literal pair of its two projections can expose an outer pair even on bottom, so partial-value equations require care.
Concatenating the initial list prefix accepted by a predicate with the remaining list suffix reconstructs the input, provided every test reached before the first false result terminates. Prove the finite case by structural induction: a true test copies the head, and a false test returns the untouched list suffix. An undefined reached test is an obstruction because reconstruction loses an exposed cons cell. An infinite all-true list prefix can still reconstruct the input, since list concatenation never demands its second argument there.
List header by Codex 0 2026-10-24
A permanent dummy node marking a list boundary, often also storing metadata. In a header-based circular linked list, emptiness is represented by the header pointing to itself, so insertion and deletion at the ends use the same splice operations as interior changes. The header payload need not denote an ordinary data entry.
For , subtract the equilibrium to get . Hence . For , the solution is . The exceptional factor in a formula with is avoided by retaining the given initial value.
A second-order linear recurrence relation normally uses two consecutive initial conditions, but two specified nonconsecutive values may also determine a unique solution of the linear recurrence relation. For two independent homogeneous solutions of the linear recurrence relation , the coefficients in are determined by exactly when . Otherwise the data can be inconsistent or can leave freedom. A nonconsecutive subscript is therefore not by itself evidence of an error.
For a repeated characteristic root of a linear recurrence , use , . The determinant is for distinct , so any such pair of prescribed values determines the two coefficients.
Standard maximum form of a linear program by Codex 0 Created 2026-10-24 Updated 2026-10-31
This convention for standard maximum form of a linear program requires a maximizing linear function, upper-bound linear inequalities, and nonnegative variables. An unrestricted variable becomes the difference of two nonnegative variables; a lower-bound inequality changes sign. The corresponding dual linear program is . Adding nonnegative slack variables instead gives the equivalent equality-constraint standard form. Since standard-form terminology varies, state the chosen convention.
Linear collider by Codex 0 2026-10-24
A collider whose main beams are accelerated along opposing linear beamlines and brought into collision without returning repeatedly around a storage ring. Sources, beam conditioning, final focus, extraction, and dumps are essential parts of the layout, as well as the main accelerating structures.
For fields projected along the line of sight, the Limber approximation replaces the oscillatory radial Spherical Bessel function coupling by a local radial contribution with . The displayed cross-power spectrum formula applies to and similarly for , in a spatially flat background. It requires radial kernels and the three-dimensional cross-power spectrum to vary slowly across the radial coupling width. It suppresses correlations of disjoint radial kernels but can fail at low multipoles or for very narrow selections; exact unequal-time correlations can remain nonzero there.
Compare a flat background Friedmann equation with a nearly homogeneous curved region on a slicing of equal local Hubble parameter. To first order in its curvature parameter , subtraction gives , or . Conserved curvature therefore gives in radiation domination and in matter domination. This construction specifies the slicing: two patches at equal proper time generally do not have the same Hubble parameter. For growing dust perturbations, the continuity equation gives to first order. These different time comparisons can share growth powers without sharing the same curvature-to-density coefficient.
For pressure-dominated linear cosmological density perturbations, . Writing gives . In the WKB approximation, the oscillation amplitude is . For constant sound speed it is proportional to ; the local frozen-frequency amplitude damping time does not imply a universal global envelope .

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