Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For , apply Fourier inversion on a locally compact abelian group at the identity to , whose transform is . This proves the displayed norm identity on . Density and completeness give a unique linear isometric extension to all . On it agrees almost everywhere with the integral Fourier transform on a locally compact abelian group.
With the Fourier convention , translation by multiplies the transform by . The Plancherel theorem gives the displayed correlation identity for every square-integrable function, by extension from integrable square-integrable functions. Thus distinct integer translates are orthogonal exactly when the nonzero integer Fourier integrals of vanish. The products in both integrals are integrable by the Cauchy-Schwarz inequality.
Every finite planar graph admits a proper vertex coloring with at most five colors. Euler formula for a connected planar graph supplies a vertex of degree at most five. Inductively color its deletion. The only obstruction is five differently colored neighbours in cyclic order. If opposite neighbours 1 and 3 are in different two-color components, interchange one component. If they are connected, planarity prevents opposite neighbours 2 and 4 from being connected in their two-color subgraph, and that interchange frees a color instead. This is a Kempe chain proof.
Every finite planar graph has chromatic number at most four. This stronger theorem is distinct from the elementary five colour theorem; the latter's Kempe chain proof does not prove this assertion.
The honeycomb lattice is the periodic degree-three planar graph consisting of the vertices and edges of a regular hexagonal tiling. It has two vertex classes; every edge joins opposite classes. Its planar dual graph is the triangular lattice.
A plane graph is a planar graph with a specified graph drawing whose edges meet only at common endpoints, also called an embedding in the Euclidean plane. Its faces of a plane graph and facial boundary walks refer to that embedding. This geometric use of embedding differs from a graph embedding, which maps one abstract graph into another.
A finite simple graph is a planar graph if and only if it contains no graph subdivision of the complete graph or the complete bipartite graph as a subgraph; equivalently, neither is a topological minor. The easy direction follows by tracing each replacement graph path as one drawn edge. The converse asserts that every failure of planarity contains one of these two patterns.[ref]
Graph Theory by Reinhard Diestel (Planar Graphs preview, §4.4, Theorem 4.4.6, printed p. 111) dates Kuratowski's theorem to 1930 and the equivalent graph minor characterization to 1937. These dates are that textbook's historical attribution.
In the displayed pitchfork bifurcation normal form, zero is stable for and unstable for . At , a symmetric stable pair appears on the side where zero is unstable. Reversing the parameter orientation changes the side, while retaining the supercritical relationship between the new stable branches and the destabilized central branch.
The polar form of the cubic confinement model has an origin pitchfork on when . Its small squared amplitude satisfies along fixed . Thus the leading cubic coefficient vanishes when , at . At either point the exact radius equation gives , so amplitude scales as . The lower point has a stabilizing quintic coefficient ; folds of nonzero equilibrium pairs meet the pitchfork curve there. The upper point has the opposite quintic sign and an already unstable transverse eigenvalue.
For , the rational equilibrium point curve in the display has expansion . Its cubic pitchfork bifurcation coefficient vanishes at , leaving . For larger , the nonzero branch folds at and . If the other eigenvalues remain stable, the two folds bound a bistable wedge between stable zero and stable nonzero states, separated by an unstable branch. If another eigenvalue is critical, a higher-dimensional centre manifold is required instead.
The Hagen-Poiseuille equation describes steady, fully developed, laminar flow of an incompressible Newtonian fluid through a straight rigid circular pipe. With pipe radius , axial coordinate and constant viscosity , force balance reduces to .
Regularity at the centre and the no-slip boundary condition at fix the displayed profile. Integrating over the cross-section gives for length and positive pressure drop . The fourth power makes volume flux strongly sensitive to radius; the assumptions exclude arbitrary turbulent or developing pipe flow. [ref]
For specified exposure periods with constant death hazard functions , the integrated hazard through the endpoint is . The displayed event probability follows from the survivor function identity. For different latent exposure schedules mixed with probabilities , average the schedule-specific probabilities, , rather than exponentiating the average integrated hazard. When the hazards are small, gives a person-time approximation. A comparison must specify the entire custody or treatment schedule; later changes to exposure cannot be inferred from an endpoint rate alone.
For isotropic rotational diffusion, orientation drift and probability density obey the displayed Fokker-Planck equation, normalized with respect to solid angle. Without flow, constant light gives the zero-current density , . Integration over the sphere gives unit mass; its mean projection is the Langevin function. The zero-light limit is the uniform density .
In a long channel , uniform horizontal mean swimming and isotropic translational diffusion coefficient give zero transverse cell flux when , . Normalizing the transverse mean concentration to gives the displayed exponential. For , cells form a layer of thickness at the illuminated wall. This is a bulk approximation; exact closed-end cell conservation equation also requires the integrated axial cell flux to vanish.
A colour index is the difference of an object's measured apparent magnitudes in two photometric passbands, such as . Since magnitude is logarithmic, this difference measures a flux ratio after the respective magnitude zero points are accounted for. It describes spectral shape rather than the object's overall brightness, and changes with both intrinsic radiation properties and interstellar extinction.
NIST Measurement Services: Photometric Calibrations by Yuqin Zong and others describes a concrete experiment (§§3.2–3.3.2): a silicon photodiode, multilayer photometric matching filter, precision aperture, temperature sensor and current-to-voltage converter. A monochromator supplies a small beam; scanning wavelength yields spectral responsivity, and scanning position checks response across the aperture. Finite spectral bandwidth requires correction. The average aperture response converts uniform illumination to illuminance.
On the photometric bench (§§3.4.1, 3.5.3, 3.5.6), align lamp and aperture reference planes, set the lamp's electric current, stabilize, and compare a check lamp with standard photometers. The readout is a voltmeter signal. Subtract the shutter-closed reading (§3.4.4), divide by converter gain to infer electric current, and use calibrated illuminance responsivity to obtain . For a distant source, luminous intensity follows from , with between reference planes.
Controls include repeat lamp operations, distance changes to test the inverse-square law, temperature corrections and gain linearity checks. Spectral mismatch correction is source dependent (§3.4.3). Unknown optical spectra, spatial nonuniformity and incorrect reference planes remain limitations.[ref]
NIST Measurement Services: Photometric Calibrations by Yuqin Zong and others. §§3.2–3.5.6, printed pp. 16–19, 22–28, 33–37: apparatus, dark subtraction, readout, corrections and check-lamp procedure
A photometric matching filter shapes a photodiode's combined spectral responsivity toward the photopic luminous efficiency function. Matching is imperfect, so photometric calibration must retain spectral information. [ref]
For a photodiode in its linear regime, spectral responsivity is the dark-subtracted electric current per incident radiant flux in a narrow band at wavelength , measured in . More generally a photodetector's readout can be electrical voltage or another quantity, with corresponding units. A broad-band readout weights the incoming optical spectrum by the detector's spectral responsivity; it is not the unweighted total incident power. [ref]
https://www.nist.gov/programs-projects/spectral-responsivity-measurements-and-spatial-spectral-power-responsivity. NIST, Spectral responsivity measurements: wavelength-dependent sensitivity and spatial characterization
.For a two-variable Boolean quantum oracle, quantum phase kickback produces the phase on . If the quadratic coefficient is known, apply the Controlled-Z gate to the power : its phase cancels the quadratic term. A Walsh-Hadamard transform then maps the remaining phase state to . The constant term is only a global phase, and both linear coefficients are read in one quantum measurement in the computational basis.
Score equation for a phase-averaged linkage likelihood by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For a known-phase contribution and an independent phase-averaged contribution , an interior maximum satisfiesThis follows by differentiating and multiplying by . The constrained maximum-likelihood estimate on must also be compared with the endpoints. An interior root cannot be asserted without the observed pedigree counts; complete nonrecombinant data, for example, have their maximum at zero.
// Target: biology.bigb
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





