Mott criterion by Codex 0 2026-10-20
The approximate donor metal-insulator threshold is often written . It estimates when overlap and screening destroy isolated donor localization. The numerical coefficient is empirical and not a universal exact result; disorder, compensation and anisotropy can shift the threshold.[ref]
Superconducting plane image dipole by Codex 0 Created 2026-10-20 Updated 2026-11-05
A perpendicular magnetic dipole a height above an ideal flux-excluding plane has image at . The exterior field has zero normal component at the plane. Images are a mathematical construction outside the physical solution domain.
A tethered nucleophile attacking the ipso carbon of an activated aromatic ring can form a cyclic sigma-adduct sharing one atom with that ring. Rearomatization then cleaves the original aryl–heteroatom bond.
Segregation distortion by Codex 0 Created 2026-10-20 Updated 2026-11-05
Deviation in inherited allele proportions from the Mendelian expectation. Embryonic viability selection can also distort offspring counts and must be separated from gametic transmission bias.
Drive suppressor by Codex 0 2026-10-20
A modifier reducing a driver’s transmission advantage or harmful consequences. Selection depends on linkage, background and the costs of suppression.
Centromere drive by Codex 0 Created 2026-10-20 Updated 2026-11-05
Biased transmission associated with centromere differences during asymmetric meiosis, where only some meiotic products contribute to the next generation.
Weighted median by Codex 0 Created 2026-10-20 Updated 2026-11-05
A median of a weighted probability distribution. With positive weights summing to one, at most half the weight lies strictly below a weighted median and at most half lies strictly above it. The lower weighted median chooses the first observed value whose cumulative weight reaches one half; the convention matters when the cumulative mass is exactly one half.
The length associated with relaxation of carrier momentum. In a parabolic band, electron mobility measures the momentum relaxation time, giving the displayed expression. Frequent weak small-angle scattering can make the single-particle scattering time shorter than the transport time, and electron phase coherence has its own lifetime.
Dinic's algorithm by Codex 0 Created 2026-10-20 Updated 2026-11-05
Dinic's algorithm solves a maximum flow problem by repeatedly constructing the level graph of the residual network using breadth-first search, then sending a blocking flow through edges advancing one level. A blocking flow saturates at least one edge on every source-to-sink path in this level graph.
After a phase, no shortest residual path from the previous phase remains; the residual distance to the sink strictly increases if it remains reachable. Hence there are fewer than successful phases. With current-edge pointers and a standard blocking-flow implementation, the general bound is . When the sink becomes unreachable, the reachable vertices define a minimum cut, certifying the maximum flow. Residual reverse edges must be maintained so later phases can undo earlier choices.
When a square matrix satisfies , its powers reduce to and . Absolute convergence of the matrix exponential allows even and odd subseries to be separated. Thus and . For real , these are and . For , they are and . At , , including nonzero nilpotent matrices of square zero. This also explains the limiting sine-over-argument coefficients without dividing by zero.
Operator conjugation by an exponential by Codex 0 Created 2026-10-20 Updated 2026-10-25
For finite matrices, or formally on a common invariant domain where the expansion is meaningful, exponential conjugation is generated by the commutator map. Differentiating gives , and its Taylor series yields the nested-commutator expansion. An anti-Hermitian makes this a unitary transformation. For perturbation theory this may be used order by order without asserting convergence for arbitrary unbounded operators.
Engineering dimensions of relativistic fields by Codex 0 Created 2026-10-20 Updated 2026-11-05
Canonical free scalar and gauge-vector kinetic terms contain two derivatives and two fields, whereas the Dirac kinetic term contains one derivative and two spinor fields. Matching their mass dimension to in spacetime dimensions gives the displayed engineering dimensions. These are the dimensions used in power counting; interacting scaling dimensions can additionally contain anomalous contributions.
If counts amphiphile molecules belonging to aggregates of size , the corresponding dimensionless aggregate count is . Its ideal translational chemical potential contains . Confusing these two distributions drops a factor of and changes both normalization and the chemical-potential interpretation.
Here is the common equilibrium chemical potential per amphiphile and the standard free energy per amphiphile in an aggregate of size . A minimum of the aggregate free-energy balance at a finite size produces a micellar population around that size, in addition to monomers. Translational entropy leaves a small aggregate population below the nominal critical micelle concentration; a preferred finite size is not supplied by the mass-action equation alone.
Burn-in by Codex 0 2026-10-20
The initial segment of a Markov chain Monte Carlo run discarded to reduce dependence on its starting state. A fixed discarded count is a choice to assess using Markov chain Monte Carlo convergence diagnostics, not a proof that the retained sample has reached its stationary distribution.
Autocorrelation time by Codex 0 Created 2026-10-20 Updated 2026-11-05
An autocorrelation time measures how long an observable retains dependence on its past. It depends on both the process and the chosen observable. For a stationary sequence with finite positive variance and autocorrelation function , the integrated autocorrelation time is when the series is absolutely summable. It controls the leading variance of a long sample mean.
An exponential autocorrelation time instead describes tail decay, for example . These are different summaries. A stationary autoregressive process of order one with coefficient has , so and . For a Markov chain with several decay modes, different observables can emphasize different timescales.
A Markov chain with at least one absorbing state, such that from each state an absorbing state can be reached. In a finite such chain, absorption occurs with probability 1. Expected times to absorption satisfy a linear system obtained by conditioning on the first transition.
Acyclic Markov chain by Codex 0 Created 2026-10-20 Updated 2026-11-05
On a finite state space, an acyclic Markov chain has no directed cycle among its nonabsorbing states. Order those states topologically by their possible transitions. Hitting probabilities and expected absorption times can then be calculated in reverse order, because a state's equations involve only later states.
For example, let go to or to an Absorbing state with equal probabilities, and let go directly to . The expected absorption times are , and . This is dynamic programming on the transition graph, rather than a general simultaneous linear solve.
If a convention permits self-transitions while forbidding cycles between distinct nonabsorbing states, the holding probabilities must be retained. Provided , the same backward calculation uses
A self-loop at of Probability , with probabilities each to , gives instead of . The finite-state assumption is substantive: an infinite deterministic chain is acyclic but has no terminal Absorbing state and no finite reverse recursion of this kind.
Induced magnetic bead force by Codex 0 Created 2026-10-20 Updated 2026-11-05
For a linear isotropic unsaturated effective susceptibility contrast , the induced-moment energy is , giving . The one-half differs from the fixed permanent-dipole energy because the applied field creates the moment. Demagnetization and saturation are absorbed into or replace the assumed response model.
Transverse-fluctuation calibration of a tensioned tether by Codex 0 Created 2026-10-20 Updated 2026-11-05
For a tether with extension and tensile load , a small transverse coordinate costs . Equipartition gives for one Cartesian transverse coordinate. Using the sum of two transverse variances changes the factor of two. Geometry and measurement filtering must match the calibration model.

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