Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
The instability strip is a region of the Hertzsprung-Russell diagram in which certain stellar oscillations grow because pulsation driving exceeds damping. For the classical Cepheid instability strip, partial ionization zones enable the kappa mechanism. Their heat-exchange times and location inside the star determine whether they can supply positive work to a mode.
The boundaries are physical stability limits, rather than lines marking a new fuel source. Moving to a different effective temperature changes the relevant layers and the role of convection, which can remove or redistribute the heat needed for driving. A star can cross the instability strip during stellar evolution and temporarily become a variable such as a Cepheid variable. Different classes and modes need not share identical boundaries.
Outgoing Green function for the three-dimensional Helmholtz equation by
Codex 0 Created 2026-10-05 Updated 2026-10-06
The outgoing Green function satisfies and the Sommerfeld radiation condition. For time dependence , its radial phase travels outward. Away from its source it solves the homogeneous Helmholtz equation. At large , .
Heat transfer asks how quickly heat crosses a boundary and how the temperature varies along its path. Its principal mechanisms are thermal conduction, convection and thermal radiation. A warm wall can conduct heat through its interior while exchanging heat with moving air and emitting thermal radiation at its surfaces. Identifying these paths lets us estimate heating requirements and cooling times.
Distinguish the accumulated heat from its rate , a power measured in . The heat flux is the rate per unit area, measured in : a uniform normal heat flux across area gives . The steady bar in thermal conduction carries through , hence ; maintained for , it transfers . This distinction makes a surface's intensity and a whole object's heating load easy to compare.
An element is weakly harmonic on an open set when for every test function . This is the statement in distributions. It requires no regularity of the domain boundary. The Weyl lemma, a form of elliptic regularity, identifies such an element with a smooth harmonic function.
A real separable Banach space has a sequence in its dual unit ball with for every . Choose a dense sequence in the unit sphere and apply the Hahn-Banach theorem to obtain . In the complex case use .
An Alpha-spending function assigns the cumulative Type I error budget to successive information fractions in a group sequential design. Its total at the final analysis is the overall significance level. The rejection boundaries must be calibrated using the joint distribution of the sequential test statistics; independent fixed-level tests do not automatically spend the assigned budget correctly.
The Conditional error principle permits adaptation of a testing design if, conditional on the observed interim information, the modified future rule's Type I error does not exceed the original rule's conditional future rejection probability. Averaging then preserves the original unconditional error bound. For a completed single-look test that has not rejected, there is no future conditional error budget under that original design.
A field is a splitting field for a finite group if every simple module over its group algebra is absolutely simple: it remains simple over every extension field. Equivalently, the quotient by the Jacobson radical is a product of full matrix algebras over . In characteristic , containing all th roots of unity, where and , is sufficient. This is the modular splitting-field theorem; it is substantially stronger than merely having eigenvalues for one chosen group element.
A pseudoreal complex representation is isomorphic to its conjugate but has an invariant antilinear map squaring to minus the identity. Such group representations admit antisymmetric invariant bilinear forms and can support half-hypermultiplets in four-dimensional extended supersymmetry.
Restriction of an irreducible representation to a subgroup is multiplicity-free when its semisimple representation decomposition has no repeated irreducible summands. Over the complex numbers, for finite groups, this is equivalent to the restricted module's endomorphism algebra being commutative. This follows by writing that algebra as a product of matrix algebras of sizes equal to the multiplicities.
A vector is cyclic for a group representation if the linear span of is all of . Equivalently, generates as a module over the group algebra. For a finite group over a field in which is invertible, the averaging projection operator has image the fixed-point subspace of a group action. Since , cyclicity implies , so this space has dimension at most one.
The invertibility hypothesis matters. In characteristic , let and let , with the two generators acting by multiplication by and . The vector is cyclic, but both and are fixed. Thus a cyclic group representation in modular representation theory can have a two-dimensional fixed-point subspace of a group action.
A finite group presentation with cyclically reduced symmetrized relators is a Dehn presentation if every nonempty freely reduced null word contains a relator segment longer than half that relator. Replacing the segment by the inverse complementary segment strictly shortens the word. Finiteness of both the alphabet and the relator set is part of this definition; merely permitting all null words as an infinite relator set would make the shortening property vacuous as a finiteness criterion.
A block system for a group action is a partition of the acted-on set such that every group element permutes its parts. For a transitive action, a nontrivial block system has more than one part and more than one element per part. The full symmetric group preserves no such partition: a transposition exchanging one point in each of two parts breaks it.
For no incident radiation and outward intensity approximated as direction independent, the surface angular moments are and . Integrating the radiation momentum equation with the Eddington closure approximation yields the grey atmosphere law . This is an approximate angular boundary condition, not isotropy across both hemispheres.
An edge contraction merges the two endpoints of an existing edge. For a finite simple graph and , replace by a new vertex . Retain every edge with neither endpoint in , and join to every member ofHere and denote the original open graph neighbourhoods, and is the new graph neighbourhood. Remove the self-loop arising from and merge duplicate edges, so the result is again a simple graph. This is not deletion of , which keeps both original vertices.[ref]
Edge contraction of a four-cycle and a triangle in a graph: common neighbours determine the lost edge count
. Details. The left example contracts in the cycle graph to give . Its endpoints have no common neighbours, so four edges become three. The right example contracts in the triangle in a graph with edges . Its endpoints have the single common neighbour , so the two edges become one edge : three edges become one.
For any such edge contraction, the exact counts areThe contracted edge accounts for one loss. Each common neighbour contributes exactly one further loss, since become a single edge . All other edges correspond one-to-one to surviving edges. In particular the new degree of a vertex isThese formulas depend on simplifying to a simple graph; a multigraph convention that retains duplicate edges has different counts. In the six-vertex branch set of a graph minor diagram, contracting loses one edge, contracting the resulting loses two because of its common neighbour , and contracting loses one. Hence its seven edges become the three edges of : .
An edge contraction can increase a degree of a vertex even while decreasing both total counts. For example, contracting in the tree with edges merges two vertices of degree of a vertex three into one of degree of a vertex four. This is the mechanism behind the distinction between a graph minor and a topological minor.
A branch set of a graph minor is the connected region representing one target vertex. For finite simple graphs and , a witness to assigns a nonempty set to each , such that the sets are pairwise disjoint, each induced subgraph is a connected graph, and every has a witnessing edge of between and . Extra edges between branch sets of a graph minor are allowed: they can be deleted. Unused vertices are also allowed.[ref]
In the diagram, the host graph has vertex set and edgesChoose , , and . Their internal edges establish connectedness. The edges witness , respectively, so they form a model of the complete graph . The additional edge also joins to ; it supplies another witness for the same target edge, not a fourth target edge. Contracting and merging duplicate edges gives exactly .
The same branch sets of a graph minor also witness the path graph : retain the witnesses , and delete to remove the unwanted adjacency. This demonstrates why the definition requires an edge for every target adjacency, without forbidding other adjacencies in the host graph. For a complete graph , there are no unwanted pairs: its model consists of disjoint connected branch sets of a graph minor with an edge between every pair.
To turn a model into an operation sequence, keep a spanning tree inside each , keep one witnessing edge for each edge of , and delete all other edges and unused vertices. Contract each chosen spanning tree to one vertex. Disjointness prevents two target vertices from merging; connectedness provides the edge contractions that merge each individual region. Conversely, track the original vertices merged into every surviving vertex during a deletion-and-edge contraction sequence. They form disjoint connected branch sets of a graph minor, and each surviving edge comes from an original edge between its two regions. A list of these regions, their connecting trees, and their witnessing edges therefore gives a directly checkable certificate.
The complete graph minor density threshold isThe density here is edge count divided by order, half the average degree of a vertex. For large , this threshold has order , with the logarithm taken to base .
A -semicoloring of a finite graph assigns one of colors to every vertex and is a proper graph colouring on an induced subgraph containing at least half the vertices. This is weaker than a proper coloring of the whole graph, and is useful as an intermediate step in a randomized algorithm.
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







