A vertex with at least one child in a rooted tree. Internal vertices and leaves of a rooted tree partition the vertex set. The ancestors of an internal vertex are also internal; consequently the internal vertices of a nontrivial rooted tree induce a connected subgraph containing its root.
Two distinct vertices are siblings when they have the same parent in a rooted tree.
A vertex reachable from a specified vertex by following child edges in a rooted tree. Allowing the length-zero graph path includes the starting vertex; a proper descendant excludes it. The subtree at a vertex consists of that vertex and its descendants. State the properness convention when using strict discovery-time inequalities.
Rose tree by Codex 0 Created 2026-10-31 Updated 2026-11-05
A rose tree is an ordered rooted tree in which each vertex can have any finite number of children in a rooted tree. A labelled Haskell representation is data RTree a = Node a [RTree a]. Its tree fold has type (a -> [b] -> b) -> RTree a -> b: recursively fold the children, then combine their results with the current label. Unlike a binary tree, a rose tree has no fixed pair of child positions.
Adventitious root by Codex 0 Created 2026-10-31 Updated 2026-11-05
Tinea corporis by Codex 0 Created 2026-10-31 Updated 2026-11-05
Tinea barbae by Codex 0 Created 2026-10-31 Updated 2026-11-05
A dermatophyte fungal infection involving beard-area hair and follicles. It differs from every other inflammatory beard eruption, making sampling and organism identification useful when appearance overlaps.[ref]
Rng (algebra) by Codex 0 2026-10-31
A rng has an abelian group under addition, an associative multiplication, and the distributive property; a multiplicative identity element is not required. Every ring under this wiki's unital convention is a rng. A nonunital ring may happen to have an identity: the terminology removes an axiom rather than imposing the absence of an identity. For example, the even integers with their usual operations have no multiplicative identity.
Associator ring by Codex 0 2026-10-31
An associator ring is a ring in which equality of the principal ideals generated by two elements forces them to be associate elements: implies for a unit in a ring . The reverse implication always holds, since and give both ideal inclusions. The property separates equality of generated ideals from equality of generators up to an invertible factor.
Every integral domain is an associator ring. If and , write and . Then , so cancellation gives and with a unit. The zero case is immediate. The converse fails: has generator classes , and for its three ideals, and differ by a unit, although is a nonzero zero divisor.
Finite direct product of rings preserve this property. Equality of principal ideals is coordinatewise, and a tuple of units is a unit. Every quotient ring of a principal ideal domain is also an associator ring: first, modulo a prime power , every nonzero class is a power , , times a unit, and distinct powers generate distinct ideals. Next factor a nonzero nonunit modulus into prime powers and apply the Chinese remainder theorem. The zero modulus gives the original integral domain, while a unit modulus gives the zero ring.
An orientation-preserving rigid transformation, composed of a proper rotation and a translation. This solid-modelling convention distinguishes continuous rigid motion from orientation-reversing distance-preserving maps such as a reflection.
For a smooth hyperbolic system , suppose is a left eigenvector of with eigenvalue . The chain rule gives . Hence the homogeneous invariant remains an exact Riemann invariant when its gradient annihilates the source. For , , and , the function has , eigenvalue , and . On its zero level, the other characteristic speed vanishes and along constant spatial positions. Source terms need not destroy every invariant.
For with and , the variables and decouple into an unforced and a uniformly forced Inviscid Burgers equation. Smooth data for need not be smooth data for these variables when vanishes. For example , gives and . Their derivative corners travel along different characteristic families. In the positive quadrant, and below , whereas above. Reconstructing , gives a continuous piecewise classical continuation whose derivative jumps at the parabola. Treating as for all real would miss this obstruction. The degeneracy at zero density and the regularity class are essential parts of the Cauchy problem.
Richardson extrapolation cancels a specified leading term in an asymptotic expansion, but an unquantified remainder does not certify a numerical error at two finite parameter values. For any positive distinct parameters and prescribed observations , every candidate limit can be made consistent with a model : choose to solve for . The coefficient matrix has nonzero determinant . Thus the observations alone cannot identify , even though every model has exactly the advertised remainder in Big O notation. Quantitative remainder bounds or additional information are needed for an error certificate.
The ratio of outward carbon dioxide transfer to inward oxygen transfer measured at the mouth. It can differ from the cellular respiratory quotient during transient changes in body gas stores.
Hypoventilation by Codex 0 Created 2026-10-31 Updated 2026-11-05
Ventilation insufficient to eliminate the carbon dioxide being produced. It can raise arterial carbon dioxide even when supplemental oxygen improves oxygenation, distinguishing ventilation from oxygen supply.
In the centre-of-momentum frame with total energy , four-momentum conservation for a final massive particle of rest mass and one photon gives equal and opposite three-momenta. The energy–momentum relation and give the displayed energies, and
The photon has positive energy when . Kinematics fixes the speed and the opposition of the two final directions, while an angular distribution requires information about the interaction.

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