Homogeneous turbulence has velocity statistics unchanged by translating all observation points. Mean spatial divergences vanish when the moments exist and averaging commutes with derivatives. Homogeneity is distinct from isotropy: it does not require equal statistics in different directions.
Energy cascade by Codex 0 2026-10-14
An energy cascade transfers kinetic energy among scales through nonlinear motion. A forward cascade carries energy toward smaller spatial scales, where kinematic viscosity can dissipate it. Conservation and a mean scale-space flux do not uniquely prescribe the geometry or locality of the transfer mechanism.
Internal intermittency is the fluctuating concentration of gradients, transfer and viscous dissipation inside turbulent fluid. It is distinct from an interface between turbulent and non-turbulent regions intermittently passing an observer. Its scale dependence is reflected in non-Gaussian increments and coarse-grained viscous dissipation moments.
Reynolds stress by Codex 0 2026-10-14
Velocity-fluctuation covariances transport mean momentum. For positive wall shear, is the downward momentum-transport magnitude and contributes to the total shear stress. Some stress conventions include the minus sign in the definition of the tensor itself; the momentum equation must use the same convention.
Kinetic energy per unit mass in velocity fluctuations. Mean shear, buoyancy and transport supply or redistribute it, while molecular viscosity dissipates it. Its local budget motivates the local turbulent kinetic energy balance when storage and transport are negligible.
Mixing length by Codex 0 2026-10-14
A mixing length is the characteristic transverse displacement over which a turbulent parcel retains its streamwise momentum before mixing with its surroundings. Taylor expansion of a mean velocity profile gives a fluctuation of magnitude . Combining comparable transverse fluctuations with down-gradient Reynolds stress transport gives the closure . This is a phenomenological approximation, not a consequence of the Navier-Stokes equation. In a free jet, a prescribed local mixing length must also be compatible with centreline regularity and vanishing outer momentum flux.
For a slender plane jet with conserved specific momentum flux and a mixing length proportional to transverse position, dimensional balance gives width proportional to and centreline speed proportional to . The streamfunction , , yields and . With , the upper-half Reynolds-averaged momentum equation integrates to for a finite centreline velocity and zero centreline stress. The momentum normalization is for a compact jet, or the same integral to infinity for a decaying jet. These formal equations do not justify an independently imposed edge condition.
Turbulent mixing by Codex 0 2026-10-14
Turbulent mixing redistributes a transported scalar, such as temperature or particle concentration, through irregular fluid motions and eventual molecular diffusion. A top-hat plume model assumes this mixing keeps the scalar approximately uniform within a selected cross section; that uniformity is an additional closure, not a consequence of thin geometry alone.
A two-equation closure transporting turbulent kinetic energy and its turbulent kinetic energy dissipation rate . Its eddy viscosity is . In a high-Reynolds-number wall-normal reduction, turbulent diffusion has coefficients and ; the energy equation has shear production and destruction , while the dissipation equation has modeled production and destruction . The dissipation production/destruction terms are closure terms, not a second conservation of energy.
Turbulence closure by Codex 0 2026-10-14
A turbulence closure approximates the unclosed higher-order moments in evolution equations for lower-order turbulent statistics. For example, an equation for the velocity correlation tensor involves triple correlations, whose evolution involves fourth-order correlations and pressure. A closure must be checked against conservation laws, realizability and boundary conditions; matching an energy spectrum alone does not establish all these properties.
Magnetohydrodynamic turbulence is irregular nonlinear motion of an electrically conducting fluid coupled to a magnetic field. Alfvén waves and magnetosonic waves give propagation times in addition to the nonlinear mixing time. A strong guide field distinguishes directions parallel and perpendicular to it, so the resulting cascades need not be isotropic.
Wave turbulence by Codex 0 2026-10-14
Wave turbulence describes the statistical transfer of energy between interacting waves. The wave period, nonlinear interaction time, phase correlations and resonances determine the transfer rate. A weak wave cascade treats the change in one interaction as small; critical balance instead makes the nonlinear interaction rate comparable to the linear wave frequency.
A fixed observation point alternates between turbulent and non-turbulent fluid because a fluctuating interface passes it. This is distinct from internal intermittency, which concerns variations within fluid that remains turbulent.
Reynolds averaging by Codex 0 Created 2026-10-14 Updated 2026-11-05
Reynolds averaging separates a resolved mean from zero-mean fluctuations. The idealized averaging operation is linear and idempotent, commutes with the derivatives under consideration and treats resolved mean factors as constant inside its averaging scale. Products then satisfy . Actual finite spatial filters need scale separation or corrections when these rules are only approximate.
Glyceraldehyde 3-phosphate by Codex 0 Created 2026-10-14 Updated 2026-11-05
In glycolysis, oxidation of glyceraldehyde 3-phosphate is coupled to reduction of NAD+ and incorporation of inorganic phosphate. This connects oxidation of a carbon substrate to the later formation of ATP, rather than releasing all of the available energy directly as heat.
The tangent half-angle substitution converts rational trigonometric expressions into rational functions: , and .
Inverse trigonometric functions by Codex 0 Created 2026-10-14 Updated 2026-11-05
The inverse trigonometric functions invert trigonometric functions on branches where they are one-to-one. Standard real ranges are for , for , and for . Thus but : the inverse returns the selected branch. The notation usually means , not . Implicit differentiation gives for .
Kőnig's lemma by Codex 0 2026-10-14
Every infinite finitely branching rooted tree has an infinite branch. Starting at the root, repeatedly choose a child above which infinitely many vertices remain.
Cayley's formula by Codex 0 2026-10-14
For an integer , let be the set of labelled trees with fixed vertex set . Each tree is a finite simple graph, with no distinguished root of a tree, and two trees are different exactly when their sets of edges differ. Then
Equivalently, this is the number of spanning trees of the complete graph . The labelled combinatorial structure includes the fixed labels: drawings, positions, and the order in which edges are listed do not create extra trees. For , the single vertex with no edges is the unique tree; count it separately, since the Prüfer sequence construction requires . For , the unique tree has edge and corresponds to the empty Prüfer sequence. [ref]
For four fixed labels, there are labelled trees, but only two unlabelled trees: the star graph and the path graph. There are four star graphs, one for each choice of centre. There are path graphs: arrange the labels along a graph path, then identify each ordering with its reversal, which describes the same set of edges. Thus . For instance, star graphs centred at and at have different sets of edges even though they have the same shape.
Figure 1.
All sixteen labelled trees on four fixed vertices: four star graphs and twelve path graphs, each with its Prüfer sequence
. Details.
The striking point is that connectedness and the absence of a graph cycle are global restrictions on edges, yet the answer is a power with no correction factor. The Prüfer sequence supplies a bijection that turns those restrictions into freely chosen labels. The rule of product then gives immediately. The same representation makes vertex degrees easy to count and supports uniform labelled tree generation for simulations and algorithm experiments.
Arthur Cayley's 1889 paper "A theorem on trees", published in the Quarterly Journal of Pure and Applied Mathematics, volume 23, pages 376–378, treats the counting problem and its refinement by vertex degrees. It was reprinted as paper 895 in volume XIII of his Collected Mathematical Papers, pages 26–28. This publication is the historical context for the name Cayley's formula; the name alone is not a claim of priority. [ref] [ref]
Oriented tree by Codex 0 2026-10-14
An oriented tree is an orientation of every edge of an undirected tree. Its arrows need not all point towards, or away from, any one root. It is acyclic as a directed graph, but different orientations can have different embedding behaviour in tournaments.

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