Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
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.
Diameter of a finite group with respect to a generating set by
Codex 0 Created 2026-10-03 Updated 2026-11-05
For a finite group with a finite symmetric generating set , its diameter is the maximum word metric distance between two elements, equivalently the diameter of its Cayley graph. PutThenTranslation invariance reduces the maximum pairwise distance to the maximum distance from the identity, which proves the equality.
If , one may replace by . Otherwise exact powers may never equal : for and , even powers are and odd powers are , while the actual Cayley graph has diameter one. This is why the ball convention matters. The trivial diameter bound for a finite group gives .
Let be a group, a subgroup and a generating set. The Schreier graph has left cosets as vertices and a directed edge labeled for each . Left multiplication makes this independent of the chosen representative of .
When is symmetric, the radius- graph ball about consists ofThese are cosets reached by words of length at most . The single exact power gives the same set when ; without this padding convention it may miss vertices reached at shorter lengths. For nonsymmetric , the directed reachability version uses the displayed words, while the underlying undirected graph uses .
For , this recovers the left-multiplication Cayley graph. More generally the Schreier graph records the group action on the set of cosets, including the stabilizer .
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 .
The cofinality of an ordinal is the least order type of an unbounded subset of , equivalently the least ordinal admitting a cofinal function .
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.
For the polynomial method in combinatorics, useOver , 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 giveswhere is the number of with . If are independent random variables uniform on , thenAny exponential upper bound for this tail probability gives and hence the result after absorbing the factor three and finitely many small dimensions into .
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 .
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.
A branch of a multivalued analytic expression is a single-valued holomorphic function on a specified domain that consistently selects one of the expression's possible values. A branch cut is a convenient way to choose such a domain, rather than an intrinsic locus of singularities. On , the principal logarithm supplies two square-root branchesFor , these give and . Their derivatives follow by differentiating : , so . There are exactly two branches on : for any other holomorphic square root , the ratio is continuous, takes values in , and hence is constant on the connected domain.
The cut can move. Choosing defines a holomorphic logarithm on . At this gives and , both regular values despite lying on the previous cut. In the complex upper half-plane, agrees with ; in the lower half-plane it equals , so the corresponding square roots have opposite signs there. The overlap has two components, exactly why the identity theorem cannot force agreement between them. [ref]
For example, the limits of at , , are from above and from below. This jump records the chosen branch cut; each point still has a neighbourhood supporting a holomorphic square root. Moving the cut changes the bookkeeping, while the branch point at and its monodromy persist. Specifying a branch of a multivalued function is therefore essential before differentiating or performing contour integration with holomorphic square roots, complex logarithms or complex exponentiation.
If a -dimensional invariant subspace is mapped to the span of the first coordinate vectors by a similarity transformation, the transformed matrix has block formIts characteristic polynomial factors as , so its eigenvalues are the eigenvalues of the two diagonal blocks, counted with algebraic multiplicity.
Crystal momentum is the translation quantum number of a Bloch state. Since and give the same translation character whenever belongs to the reciprocal lattice, crystal momentum is defined modulo reciprocal-lattice vectors.
In the Black-Scholes model, a digital call option and digital put option with remaining maturity have valueswhere is defined in the Black-Scholes formula. For , the digital-call delta hedge is
A graph is bipartite if and only if it contains no odd cycle. One direction follows because every cycle alternates between the two vertex classes. For the converse, in each connected component of a graph choose a root and partition the vertices according to the parity of their graph distance from it. An edge joining equal parities would close an odd cycle, so every edge crosses the partition.
In a commutative ring of prime characteristic , the freshman's dream identity is . The binomial theorem proves it because divides every intermediate binomial coefficient , . Iterating gives . For example, over , while over the real numbers the cross terms generally remain. Prime characteristic is essential to this ring-wide statement; an arbitrary positive composite characteristic is insufficient.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





