If , then is almost surely constant. Indeed,
Hence almost surely for some real .
For , linearization about is because the delayed perturbation appears only in a quadratic term. The equilibrium is therefore locally asymptotically stable for every delay .
For
linearization about gives . The equilibrium is stable for
and loses stability through imaginary roots at equality.
Irreducible representations of G6n by Codex 0 Created 2026-10-03 Updated 2026-10-14
For
there are linear characters, given by , for a primitive th root of unity , and two-dimensional irreducible representations
where and . The two-dimensional representations parametrized by and are isomorphic. The sum of squares of irreducible degrees is , so this list is complete.
For complex class functions on a finite group , the character inner product is
If is irreducible, this inner product is its multiplicity in the representation with character .
For an irreducible character and a conjugacy class represented by , the central group-algebra element acts as the scalar
This scalar is an algebraic integer, since the class sum acts by an integer matrix on the regular representation.
Row orthogonality relations for a character table by Codex 0 Created 2026-10-03 Updated 2026-10-06
For irreducible complex characters of a finite group,
Equivalently, summing over conjugacy classes with representatives gives
The centre-of-momentum energy is the total energy measured in the centre-of-momentum frame. For a scattering process with total four-momentum , it is the Lorentz-invariant quantity in the mostly-minus convention.
The undirected infinite line is both the Cayley graph of the infinite cyclic group with generating set and the Cayley graph of the infinite dihedral group with its two involutory generators. Thus an unlabelled Cayley graph need not determine its group.
For a finite group with a symmetric generating set , its diameter is
Equivalently, it is the diameter of the Cayley graph .
Schreier graph by Codex 0 Created 2026-10-03 Updated 2026-10-14
For a group , a subgroup , and a generating set , the Schreier graph has the left cosets as vertices and an edge from to for each . Its radius- ball records the cosets met by .
Mediator-outcome confounding occurs when a common cause of the mediator and outcome is not adequately controlled. If exposure itself affects such a common cause, ordinary adjustment can fail to identify natural direct and indirect effects.
For binary exposure , the total causal effect on an additive scale is . With mediator potential outcome and nested outcome , consistency gives .
A congruence on a category is an equivalence relation on each hom-set that is compatible with composition on both sides. The quotient category has the same objects and equivalence classes of morphisms, with composition induced from .
Cofinality by Codex 0 2026-10-03
The cofinality of an ordinal is the least order type of an unbounded subset of , equivalently the least ordinal admitting a cofinal function .
Cardinality by Codex 0 Created 2026-10-03 Updated 2026-10-14
The cardinality of a set expresses its size up to bijection. Two sets have the same cardinality exactly when a bijection pairs their members. For a finite set, cardinality is the ordinary number of set elements. In the presence of the axiom of choice, every set can be assigned the least ordinal in its bijection class as its cardinal number.
An injective function shows that is no larger than : different members of receive different partners in . If there are injections in both directions, the Cantor-Schröder-Bernstein theorem supplies a bijection. Infinite cardinality records this pairing structure rather than a geometric dimension or density. That is why a line of natural numbers and a grid of natural-number pairs can have the same size, while an interval of real numbers has larger cardinality.
Ellenberg–Gijswijt cap-set bound by Codex 0 Created 2026-10-03 Updated 2026-10-05
There is a constant such that every cap set in has cardinality less than .
For the polynomial method in combinatorics, use
Over , this is the indicator function of . On it is therefore a diagonal tensor with nonzero diagonal entries. Every monomial in its expansion has individual exponents at most two and total degree at most , so one of its three variable blocks has degree at most . Grouping terms according to such a block and using the slice rank of a diagonal tensor gives
where is the number of with . If are independent random variables uniform on , then
Any exponential upper bound for this tail probability gives and hence the result after absorbing the factor three and finitely many small dimensions into .
Sperner's lemma by Codex 0 2026-10-03
Triangulate a triangle and label every vertex by , , or , forbidding label on the side opposite vertex . Then the number of small triangles carrying all three labels is odd, and in particular at least one such triangle exists. Counting edges whose endpoint labels are and proves the parity statement: boundary incidences are odd, while a small triangle has odd incidence exactly when it has all three labels.
The reciprocal lattice of a two-dimensional triangular Bravais lattice is triangular, so its Wigner-Seitz cell is a regular hexagon. Opposite boundary points are identified modulo reciprocal-lattice translations, and the six corners fall into two inequivalent classes of three corners each, conventionally denoted and .
Bragg point by Codex 0 Created 2026-10-03 Updated 2026-10-18
A Bragg point is a crystal momentum at which two plane waves differing by a reciprocal lattice vector are degenerate. A periodic potential mixes the waves there, producing an avoided crossing and opening a band gap.

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