Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A front worldline at fixed proper distance along a rear observer's simultaneity slice is parametrized by the displayed equations, with velocity and Lorentz factor evaluated at the rear event. The front time is locally future-oriented when , where is the rear signed proper acceleration. At a zero of that factor the rigid coordinate extension encounters an acceleration-horizon obstruction.
For a weak constant spherical potential of radius , the scattering amplitude is proportional to , where . Its forward limit is nonzero. Positive zeros satisfy , with first root , so an elastic incident wavenumber needs to access a zero. The asymptotic roots are ; increasing alone does not remove the low-order root correction.
One-query obstruction to exact Boolean truth-table identification by
Codex 0 Created 2026-10-24 Updated 2026-11-05
For a one-bit-input Boolean oracle, decompose a query input into target eigenstates. The unchanged target- sector has weight , while the target- sectors at inputs have weights . Distinguishing functions differing only at one entry requires , leaving . Then functions differing at both entries have output overlap , so are the same physical ray. Thus one quantum query cannot identify all four truth tables with certainty, although the Deutsch algorithm finds their constant/balanced classification in one query.
Replace the nonlinear Boltzmann collision operator by relaxation to the local Maxwellian with the same mass density, mean velocity and random kinetic energy as . Matching those velocity moments ensures vanishing collision contributions to mass, momentum and kinetic energy balance. The collision relaxation time is often treated as a constant, although microscopic collision rates generally depend on the state and particle velocity.
Treat each interaction as an isolated two-particle scattering event, neglecting simultaneous interactions involving three or more particles. For a dilute short-range gas, the interaction range is much smaller than the mean free path, making this approximation compatible with a local Boltzmann equation. It is distinct from molecular chaos for the Boltzmann equation, which is the statistical factorization of incoming pair distributions.
Approximation in which a small departure from a specified equilibrium distribution relaxes exponentially with time constant . Different observables can have different effective relaxation times; momentum relaxation is not automatically the same as every microscopic scattering lifetime.
Impaired acknowledgment or recognition of part of one’s body. It is not interchangeable with every form of visual neglect.
The magnesian biotite mineral endmember. Iron substitution on its magnesium-bearing positions produces a solid solution requiring an activity model when used in chemical equilibrium calculations.
A semicircular current arc of radius connected tangentially to two parallel semi-infinite wires has the displayed magnetic field at its centre. The arc contributes and each straight segment by the Biot-Savart law. For the continuous hairpin current all three magnetic fields have the same normal direction by the right-hand rule; they add rather than cancel.
An annulus with uniform surface charge density , radii and rigid angular velocity carries ring electric current . The centre magnetic field of each ring is by the Biot-Savart law. Integrating gives , equivalent to the title expression with . The oriented normal follows the positive rotation convention, with the sign of retained.
Fixed-cardinality binomial coefficient asymptotic by
Codex 0 Created 2026-10-24 Updated 2026-10-31
For a fixed nonnegative integer , the number of -element subsets of an -element set satisfiesFor , divide the product formula for the binomial coefficient by :The empty product gives the same result for . For an explicit big theta notation bound, gives . Fixing is essential: these constants are not uniform when the subset size itself increases with .
If a key is smaller than every key of a finite binary search tree , insert and then delete the minimum: the original tree, including its shape, is recovered. The insertion follows the leftmost search route and creates a new minimum leaf; deleting that leaf reverses the same route. The symmetric statement uses a fresh maximum. At a node with root , the bounds on its children therefore let a direct tree fold reconstruct an untouched child from that child's insertion result. This gives a direct fold implementation of insertion without assuming that insertion is injective on arbitrary trees.
Construct a binary heap from an array by processing internal nodes backwards, applying sift down at each. The complete binary tree shape ensures that the subtrees below the current node have already been repaired. The number of nodes whose height is at least is at most , so charging each repair by its height gives total work at most a constant multiple of . The construction takes time in either heap orientation, whereas inserting entries separately has an worst-case bound.
A cascade in which an output transition of one flip-flop clocks the next. With positive-edge-triggered toggle stages and uncomplemented connections, it decrements modulo : a zero bit rises to one and propagates a borrow, while a one bit falls to zero and stops propagation. Ripple propagation takes time, so intermediate transient states are not the settled counter state.
Critical slowing down is the divergence of a relaxation time as a stable equilibrium point approaches loss of hyperbolicity. For a scalar ordinary differential equation it occurs when and the recovery time of a stable equilibrium diverges. At the threshold, nonlinear terms may replace exponential decay by algebraic decay; for example has for positive initial data.
Let be the Boolean quantum oracle for a linear Boolean function, and put . The CNOT gates implement , where the data wires control the ancilla qubit. CNOT control reversal in the Hadamard basis and imply the exact unitary operator identityHere on strings is bitwise exclusive or. To conjugate a product, insert between its factors; each factor reverses its control and target, and the unused Hadamard gates cancel. The global phase is exactly . In particular, the identity holds on arbitrary quantum superpositions, not only on the initialized inputs of the Bernstein-Vazirani algorithm.
The displayed Bernstein-Vazirani algorithm prepares its ancilla qubit in the computational-basis state before the first Hadamard gate. At the function oracle it is therefore the eigenstate of the Pauli X gate, which enables phase kickback. Preparing instead yields at the function oracle; target flips leave this state unchanged, so the data contain no information about .
The Hadamard-conjugated linear oracle makes the more general statement transparent. With zero data and initial ancilla qubit , the full fixed quantum circuit outputsFor nonzero , the correct data outcome has probability . To obtain exact identification for all , this preparation must have , so it is up to global phase. This is a condition on the prescribed preparation circuit: any alternative quantum state preparation that supplies at the function oracle is equivalent.
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





