For radial acceleration , conserved specific angular momentum and reduce the Binet equation to the displayed linear equation. If , its angular oscillation frequency is ; attraction proportional to changes the apsidal angle. A zero of ends the physical positive-radius branch and corresponds to escape, not passage to a negative radius. A spatial self-intersection need not be a periodic return because velocity may differ.
An infinite path is a binary function all of whose finite prefixes belong to the tree. Its path space is closed in Cantor space, since failure is witnessed by one finite prefix outside .
A binary tree of finite strings is computable when membership of a finite binary string is decidable. An infinite computable tree need not have any computable infinite path. Removing all nodes without infinite extensions need not preserve decidability.
A modular-addition quantum oracle for a linear function over the three-element finite field reveals its two coefficients in one query. Prepare the answer qutrit in , whose unit shift eigenvalue is . Quantum phase kickback produces a product of Fourier states labelled by the coefficients; inverse quantum Fourier transforms read both coefficients exactly.
The Bell basis diagonalizes the commuting Pauli operators and . Two local anticommutations make the joint operators commute. Their signs encode parity and relative phase. The displayed projectors turn the signed eigenvalues into literal zero-or-one bit eigenvalues: even parity and plus phase have bit zero.
Apply a Hadamard gate to the first qubit, then a controlled-NOT gate from the first to the second. This maps a computational-basis state to the Bell state with phase bit and parity bit . Its inverse uses the same gates in reverse order because each gate is self-inverse but they do not commute. Applying the forward sequence twice is not generally a decoding operation.
If every model's likelihood is multiplied by the same positive factor independent of its parameter or model index, Bayes theorem cancels that factor from the normalized posterior. Fixed-count Bernoulli sampling and sampling stopped at a specified positive head count give such proportional likelihoods for the same total heads and tails. This conclusion uses their actual sampling likelihoods; it is not a claim that every selection or stopping rule can be ignored.
Let have the positive-integer geometric distribution with success parameter , and conditionally toss independent coins with head probability . Exactly one head has conditional probability . Combining this with the prior by Bayes theorem gives the displayed posterior with ; its normalization uses . For , the posterior is . It is also a shifted negative binomial distribution, with equal in law to the number of failures before two successes of probability .
If , a subset satisfies and . A dependent random choice argument in the popular sum graph finds many four-edge paths representing each member of the difference set. The Petridis minimal-growth lemma then bounds all higher iterated sumsets and difference sets.
There are absolute such that finite sets of size , a bipartite graph of density at least , and a restricted sumset of size at most yield subsets with and . A graph formed by popular representations of sums turns this into the usual large-additive energy form of the Balog-Szemerédi-Gowers theorem.
For distinct increasing knots and , the explicit divided difference formula writes an order- B-spline as a finite sum of truncated power functions of degree . It is a piecewise polynomial function and is globally . Below its first knot the order- divided difference annihilates a degree- polynomial; above its last knot all values vanish. Nonzero first and last pieces give the exact closed support. Order one gives interval indicators instead of continuous splines.
A finite collection of the standard partition-normalized B-splines is nonnegative and has sum at most one on the entire real line. Extend the knot sequence in both directions. The full order-one collection sums to one, and summing the Cox-de Boor recurrence preserves that sum because the two coefficients of each lower-order function add to one. The finite collection is a subset. On the basic knot interval the finite sum equals one, also following from Marsden's identity.
For a linearly independent partition-normalized B-spline basis, equivalence of norms gives a lower coefficient-stability constant. The upper bound follows from the subpartition of unity for B-splines. A knot-independent stability bound can be chosen depending on spline order. This norm comparison transfers matrix estimates to the B-spline interpolation operator norm.
The auxiliary-metric brane action is a quadratic embedding action with an independent worldvolume metric. Its embedding equation is . Its metric equation is . For , tracing determines and hence ; eliminating the auxiliary field gives twice the invariant worldvolume volume, before including the overall brane tension. The Weyl-invariance exception for the string among branes prevents unique elimination at .
In a cyclic group of arbitrary order , a Bohr set with frequencies, defined by , contains an arithmetic progression of distinct residues of length at least . Partition the -dimensional cube into boxes, with . The pigeonhole principle supplies with simultaneously. The residues , , remain in the Bohr set and do not wrap around the cyclic group. The weaker exponent permits composite moduli without assuming that every nonzero step has large order.
Loss of summer sea ice need not be irreversible at fixed external forcing. Open water can release excess heat in autumn, and thin ice grows faster than thick ice during winter because it offers less resistance to thermal conduction. Continued climate change can nevertheless shift the long-term ice cover downward. A one-summer perturbation and persistent forcing are different physical experiments.
Monomial alternant by Codex 0 2026-10-07
A monomial alternant is the determinant formed from powers with an integer exponent tuple . It is a polynomial when the exponents are nonnegative, and otherwise a Laurent polynomial. Equal exponents give equal columns and zero determinant; interchanging exponents changes its sign. Ordered strictly decreasing nonnegative exponents give a basis of alternating polynomials, by grouping monomials into permutation orbits.
For the constant gas-radiation ratio vertical disc structure, the integrated alpha prescription gives the displayed mean kinematic viscosity and . Uniform dynamic viscosity and nonuniform pressure are compatible because this prescription is an integrated equality. Imposing the corresponding pointwise equality would not preserve the exact vertical solution.
Monomial curve by Codex 0 2026-10-07
Over a field , an affine curve parametrized by positive integer powers of one parameter. Its coordinate ring is the subalgebra generated by those powers, and its defining prime ideal is the kernel of sending to . Equal exponent sums yield binomial relations. Studying those relations connects an additive semigroup of exponents to the geometry of the curve.
Mixing two lotteries with the same third lottery and the same positive weight preserves their strict preference order. For affine utility on probability measures, the difference of the two mixed utilities is the original difference multiplied by that weight. At weight zero the strict preference disappears, so positivity is essential.

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