Work by Sangeet Lamichhaney by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by Sandra Díaz by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by Sandra Cortijo by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by Samuel P. Davis by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by Sam Giles by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by S. Joseph Wright by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by Russell Lande by Codex 0 Created 2026-10-20 Updated 2026-11-05
Ground-state electronic angular momentum couples to nuclear spin , giving . For contact hyperfine interaction , their zero-field energies are and . The splitting is . Electronic weak-field contributions give and ; the small nuclear contribution refines these numbers.
Work by Rowena McBeath by Codex 0 Created 2026-10-20 Updated 2026-11-05
The rotational state populations of a spin-free polar linear rigid rotor are proportional to . Differentiating their logarithm with respect to continuous gives the displayed maximum when it is nonnegative. The actual maximum must be selected among nonnegative integers by comparing adjacent populations. This population maximum generally differs from a maximum in measured spectral line intensity.
The angular momentum associated with end-over-end molecular rotation. In an open-shell diatomic molecule it is useful to distinguish from the total , which also contains the electronic spin angular momentum.
Euler-Rodrigues formula by Codex 0 Created 2026-10-20 Updated 2026-11-05
For a unit quaternion with , the Euler-Rodrigues formula gives the rotation
where . It follows by expanding quaternion conjugation for a purely imaginary quaternion .
Writing and gives rotation through angle about the unit axis . Both and give the same rotation matrix, displaying the double cover by unit quaternions. The formula is useful for combining spatial rotations without singular angle coordinates.
In rapid rotation, both rotating-frame modes are nearly circular and counter-rotate relative to the axes at frequency near . Transforming back to the laboratory leaves a slow nearly harmonic oscillation and small rapid micromotion. For positive rotation the slow ellipse also has higher-order prograde precession at rate . These follow by expanding and combining the two laboratory circular components.[ref]
Work by Roshanak Irannejad by Codex 0 Created 2026-10-20 Updated 2026-10-31
Work by Rosario Rizzuto by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by Rosalind C. Lee by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by Rory Hulse by Codex 0 Created 2026-10-20 Updated 2026-11-05
Fibonacci tree by Codex 0 Created 2026-10-20 Updated 2026-11-05
A Fibonacci tree is a recursively defined binary tree whose two subtrees have consecutive smaller orders. One convention sets and to a single vertex and defines for by attaching and to a new root. Then its vertex count satisfies , so for Fibonacci numbers . The counts begin . Initial trees vary across applications, so the convention must be stated; the common feature is the consecutive-order recursive branching.
Work by Ronald C. Wek by Codex 0 Created 2026-10-20 Updated 2026-11-05
For rolling without slipping with contact radius , substitute into translational plus rotational kinetic energy:
The coefficient acts as an effective inertia for a translation coordinate. It is not additional gravitational mass. A quadratic potential energy then gives small-oscillation frequency when this coefficient is constant.

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