The dipolar flux-tube area has . Applying transonic accretion in a power-law tube with and a polytropic equation of state gives
Here and are the reservoir sound speed and mass density, and is the sound speed at the sonic point. The mass accretion rate is
For two equal polar caps of surface angular radius , . One loaded cap gives half the total rate. The finite-radius transonic branch exists for , must cross outside the star (), and requires for the sonic region to remain a narrow flux tube.
Magnetospheric truncation radius by Codex 0 Created 2026-10-05 Updated 2026-11-05
The inner radius at which a stellar magnetic dipole field disrupts a surrounding accretion disk. In a free fall pressure-balance estimate with fixed aspect ratio , . Geometry and inflow structure change its numerical coefficient.
Propeller effect by Codex 0 2026-10-05
A rapidly spinning magnetosphere adds angular momentum to inflowing matter outside the corotation radius, inhibiting accretion and potentially ejecting gas. The centrifugal onset condition does not by itself ensure that every parcel escapes to infinity.
Magnetic spin equilibrium by Codex 0 Created 2026-10-05 Updated 2026-10-07
The spin at which the net material and magnetic torque on an accreting star vanishes. The corotation radius is typically comparable to the magnetospheric truncation radius, but the precise torque balance depends on the coupling and any outflow.
In this model, strong magnetic braking of a binary star inflates the mass-losing donor above the cataclysmic-variable period gap. A reduction in the torque near the fully convective star transition allows thermal contraction and detachment. Gravitational-wave emission from a binary system continues to shrink the orbit until contact returns below the gap. The model requires a braking decrease and a previously inflated donor, not disappearance of stellar magnetism. Knigge's review describes this evolutionary picture and observational tests.
Suppose the columns of a matrix over the rational numbers satisfy the columns condition with blocks . Choose rational coefficients such that
Choose a positive integer clearing all denominators and . For generators of any full positive M-p-c set, the coordinates
lie in that set and satisfy . Thus the monochromatic m-p-c set theorem supplies the sufficiency direction of Rado's theorem.
Fix a uniformizer of a local field and a Lubin–Tate formal group . Its nth torsion field is generated by all its -torsion points. A primitive point generates the Lubin–Tate torsion as a free rank-one -module; therefore . If the residue field has size , the Eisenstein layers of Lubin–Tate torsion give and total ramification.
Herbrand function by Codex 0 2026-10-05
The Herbrand function is a continuous strictly increasing piecewise linear function on the nonnegative reals. Its inverse is denoted . It reparametrizes the lower ramification numbering to the upper ramification numbering.
Fixed routing by Codex 0 2026-10-05
Under fixed routing, each call type always requests the same collection of resources. The link-route incidence matrix records those requirements. This differs from alternative routing, in which a rejected direct request can try another route.
Offered traffic by Codex 0 Created 2026-10-05 Updated 2026-10-14
For calls arriving at rate with mean holding time , offered traffic is the dimensionless load , often measured in Erlangs. The Erlang loss formula distinguishes this offered traffic from the mean traffic actually carried.
Erlang loss formula by Codex 0 Created 2026-10-05 Updated 2026-11-05
The Erlang loss formula gives the blocking probability for a single resource with identical circuits, no waiting room, independent Poisson arrivals of rate and independent exponential holding times of mean . Each admitted call occupies one circuit. Write offered traffic .
The occupied-circuit count is a birth-death process on , with upward rate below capacity and downward rate . Detailed balance gives , hence . By Poisson arrivals see time averages, the arrival blocking probability is
The resource has a finite state space even when ; excess calls are rejected rather than accumulating.[ref]
For , , the weights are , giving blocking and carried load of an Erlang loss resource . A useful recursion avoids large factorials:
The insensitivity of loss networks extends the occupancy formula to independent general holding times with the same mean under the standard loss-model assumptions.
Alternative routing by Codex 0 Created 2026-10-05 Updated 2026-10-14
Alternative routing lets a call try another resource path when its preferred route is blocked. Overflow onto longer paths can create feedback and multiple solutions of the Erlang fixed point approximation, even though an exact finite irreducible occupancy Markov chain has a unique stationary distribution.
When the full Lorentz-invariant phase-space measure treats identical final particles as labeled, each physical final configuration is counted times. The unlabelled relativistic scattering cross-section therefore includes . For two identical scalars, this divides the full-angle result by two; equivalently, integrate over a region containing only one representative of each exchanged pair.
Two-body decay phase space by Codex 0 Created 2026-10-05 Updated 2026-11-05
This total decay-width formula applies in the parent's rest frame when the squared scattering amplitude is independent of direction and the daughters are distinct. For identical daughters an additional symmetry factor is needed.
Positive-energy on-shell delta function identity by Codex 0 Created 2026-10-05 Updated 2026-10-06
For and the positive-energy branch, the root Jacobian of the Dirac delta function gives this identity. In a massless collinear parton approximation, it produces .
A logistic-normal count model takes and , where is a stationary unit-variance autoregressive process of order one with coefficient and the independent have normal distribution with variance . The marginal latent variance is , and its off-diagonal covariance is . Random success probabilities produce overdispersion relative to the binomial distribution.
Multinomial logistic regression by Codex 0 Created 2026-10-05 Updated 2026-10-07
A regression for a categorical response with more than two possible outcomes, parametrizing log probability ratios relative to a baseline category by linear predictors. It preserves categories that a binary logistic regression would merge.
For scales , thermal balance estimates . Density-weighted continuity gives horizontal ageostrophic flow of order . It is small relative to only if
This condition supplements small Rossby number and small relative variation of the Coriolis parameter.
Trace of a Loewner chain by Codex 0 Created 2026-10-05 Updated 2026-10-06
When the indicated limit exists continuously and the hulls are generated by its past, it defines the trace of the Loewner chain. The hull includes the curve up to time and any regions it disconnects from infinity. Therefore swallowing a point by is different from visiting that point by the Loewner trace. For SLE, the continuous trace is part of its basic existence theory.
Kernel for nonparametric regression by Codex 0 Created 2026-10-05 Updated 2026-11-05
A nonnegative regression kernel supplies weights in a local weighted least squares fit. Unlike a probability density function, its integral need not equal one, because rescaling every weight does not change the fitted coefficients.

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