For every there is such that every non-abelian finite simple group and every finite symmetric generating set containing the identity satisfy
The proof applies the one-scale virtual nilpotence theorem below the diameter and then uses simplicity to eliminate both the bounded-index subgroup and the finite normal subgroup.
A connected Cayley graph on a finite group has vertices, and a shortest path repeats no vertex. Therefore
In a red-blue edge colouring of , let be the red degree of vertex and let be the number of monochromatic triangles. Every nonmonochromatic triangle has exactly two vertices at which its two incident edges have different colors, so
Since , this identity gives a lower bound for .
To recognize words having at most consecutive copies of a symbol, use states recording the current run length and one rejecting sink. Another symbol resets the run length to zero, while the st consecutive copy enters the sink.
To recognize prescribed parities of several symbol counts, use one state for each tuple of parities. Reading a tracked symbol toggles its coordinate and leaves all other coordinates unchanged. For two tracked symbols this gives four states indexed by .
Dense below a forcing condition by Codex 0 Created 2026-10-03 Updated 2026-10-07
A set is dense below when every has an extension belonging to .
Option delta by Codex 0 Created 2026-10-03 Updated 2026-10-14
The option delta is the derivative of an option value with respect to the underlying asset price. In a smooth complete diffusion model, it is also the number of underlying units in the replicating delta hedge.
Maximal real subfield of the fifth cyclotomic field by Codex 0 Created 2026-10-03 Updated 2026-10-25
For a primitive fifth root , the element satisfies . Thus the fixed field of complex conjugation is
Prime cyclotomic field degree by Codex 0 Created 2026-10-03 Updated 2026-11-05
For a prime , the cyclotomic polynomial of a primitive th root of unity is
It is irreducible over , so adjoining one root gives a field of degree .
Girth by Codex 0 Created 2026-10-03 Updated 2026-10-14
The girth of a graph containing a cycle is the length of its shortest cycle. A forest is conventionally assigned infinite girth.
Curvature of a plane curve by Codex 0 Created 2026-10-03 Updated 2026-10-14
For a twice continuously differentiable regular curve in the plane, unsigned curvature is the absolute value of its signed curvature:
The nonvanishing velocity vector makes the denominator positive. For a graph of a function , this reduces to ; omitting the absolute value gives the signed curvature of a plane graph for increasing .
For the parabola , the derivatives are and . Therefore
The curvature is greatest at the vertex , where and the radius of curvature is . At the curvature is , so the parabola bends less sharply despite its larger speed .
Its unit tangent vector and left unit normal are
Since , is also its principal normal vector. At the osculating circle consequently has center and equation
The lower branch has value , derivative , and second derivative at , matching the parabola through second order. Away from the vertex the two curves separate: an osculating circle describes a local bend, not the whole curve.
Figure 1.
The parabola's changing tangent and normal, with its osculating circle at the vertex
. Details.
Vanishing curvature at one point does not imply a straight segment. The graph of a function has signed curvature , which vanishes at its inflection point and changes sign across it. By contrast, if curvature vanishes throughout a connected regular interval, throughout that interval: the constant unit tangent vector forces the image to lie on a straight line.
If an irreducible quartic over a field of characteristic zero has a cubic resolvent of a quartic whose Galois group of a polynomial is , then the quartic has Galois group . Irreducibility places the quartic group among the transitive subgroups of the symmetric group on four points, while the action on its three root pairings is surjective onto . Of the possibilities , only has this image.
Efficient estimator by Codex 0 Created 2026-10-03 Updated 2026-10-14
An efficient estimator attains the relevant lower bound on estimator variance, such as the Cramér-Rao bound in a regular parametric model.
If is a discrete subgroup of a topological group , then left translation by is a covering-space action. Choose an identity neighbourhood with ; the translates are pairwise disjoint, and the quotient map restricts to a homeomorphism on each translate.
Mass counterterm by Codex 0 Created 2026-10-03 Updated 2026-11-05
A mass counterterm cancels the divergent part of a self-energy that has the tensor structure of a mass term. Its finite part depends on the renormalization scheme, while an on-shell scheme chooses it so that the renormalized mass equals the pole mass.
Periodic coset state by Codex 0 Created 2026-10-03 Updated 2026-11-05
For , a periodic coset state in the computational basis of is
It is the coset state of the subgroup translated by .
Uniform cover by Codex 0 2026-10-03
A multiset of subsets of is a -uniform cover when every index belongs to exactly members of , counted with multiplicity.

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