Topics (355k) Articles (368k) Users (410) Discussions (242) Comments (383) Files (12k) New article
A narrow outgoing energy packet has phase , so stationary phase gives the arrival shift . For two equal-mass solitons with relative rapidity , . The convention instead gives . Classical time delays determine only the energy-dependent phase difference, not its constant branch.
An exact nonlinear-wave solution containing several localized solitons. In an integrable scattering solution, these objects approach separated incoming and outgoing profiles, with collision effects encoded by position shifts and internal phases. Bäcklund transformations and Hirota's bilinear method construct examples such as the Sine-Gordon multisoliton tau representation.
Soft supersymmetry breaking removes quadratic ultraviolet sensitivity but can leave scalar-mass corrections proportional to the soft squared masses and logarithms of scale ratios. The high-momentum difference of a paired scalar and fermion propagator falls as their squared-mass splitting divided by momentum to the fourth power. Heavy soft partners can therefore still create a tuning problem through logarithmic and finite thresholds even though the original quadratic hierarchy problem has been controlled.
Products of manifold charts form a smooth atlas on the topological product of two smooth manifolds. The transition maps are products of the two smooth transition maps, so the dimension is the sum of the dimensions. The smooth structure is independent of the chosen compatible atlases.
Four-manifold realization of finitely presented groups by
Codex 0 Created 2026-10-07 Updated 2026-10-14
Every finitely presented group is the fundamental group of a closed connected smooth oriented four-manifold. Build a compact four-dimensional handle decomposition with one zero-handle, a one-handle for each generator of a group and a two-handle for each relator. Turning the handle decomposition upside down shows that its boundary surjects on the fundamental group. Its double of a manifold has the same fundamental group by the Seifert-van Kampen theorem.
Every complex symmetric matrix admits a unitary congruence decomposition with a unitary matrix and nonnegative diagonal entries equal to its singular values. This differs from unitary similarity diagonalization. It reduces a multimode squeezed vacuum to independent oscillator squeezing factors.
The paired zero factors converge locally uniformly because converges. Hadamard factorization for the order-one entire sine function gives a possible exponential multiplier; oddness removes its linear exponent and the derivative at zero fixes its constant. This product turns a Dirichlet oscillator determinant ratio into an elementary sine ratio.
The Pauli Z gates give eigenvalue on . Use parity computation by CNOT gates to put the parity bit in a zero ancilla, apply to it, and uncompute. The data acquire exactly , and the ancillary line returns to zero. This compute-phase-uncompute construction needs one- and two-qubit gates. Accumulating parity into the last data line instead uses gates without an extra ancilla. Neither implementation drops the global phase.
Phase I introduces nonnegative artificial variables to create a feasible basis and minimizes their sum, or maximizes its negative. A positive minimum proves infeasibility. At a zero minimum, remove artificial variables and use the resulting feasible original basis in Phase II with the original objective. If an artificial variable remains basic at zero, pivot it out when possible; otherwise its row is redundant. Each phase uses the simplex ratio test to preserve nonnegative basic values.
For a maximization simplex dictionary, choose the smallest-index nonbasic variable with positive reduced cost to enter. Among basic variables attaining the minimum feasible ratio, choose the smallest-index one to leave. This fixed index rule prevents cycling, including in degenerate pivots whose step length is zero. It need not minimize the number of pivots on a particular instance.
Suppose two independent planar simple symmetric random walks are compared while one stays at its th position throughout a deterministic time block. If each block has an unconditional probability bounded below by a positive constant that the other walk visits the origin, simultaneous origin visits occur infinitely often almost surely. Markov-chain recurrence gives infinitely many origin blocks for the sleepy walk. The block bound yields positive probability of infinitely many coincidences; eventual coupling of planar symmetric random walks then makes this future event have probability zero or one. Conditional block bounds or independence of capture attempts are not required.
Infinite mean first passage of a simple symmetric random walk by
Codex 0 Created 2026-10-07 Updated 2026-10-14
For a simple symmetric random walk starting from zero, its first hitting time of is almost surely finite but has infinite expectation. Stopping at exit from , the optional stopping theorem for gives upper-exit probability , while stopping gives mean exit time . The first probabilities tend to one, and the exit times are bounded above by the first passage to , proving both conclusions. Finite-time stopping and bounded stopped positions justify passage to the exit time.
A similarity profile is the time-independent function left after expressing a evolving field in its scaled coordinate, for example . Integrating such profiles converts a global conservation law into an algebraic relation among the time-dependent scales.
The nuisance tangent space is the closed linear span of score functions from statistical paths that vary the nuisance parameter while fixing the target statistical parameter. It is a closed subspace of a Hilbert space inside . Removing its component from a parametric score function leaves the information that nuisance variation cannot imitate.
If the parametric score function has zero conditional expectation given a covariate , it is orthogonal to the centered functions of that form the covariate-density nuisance tangent space. Its efficient score then equals its parametric score function, and the unknown covariate distribution causes no loss of Fisher information. This applies to Gaussian regression scores and more generally to regular conditional models with unrestricted covariate distribution and no additional nuisance components.
Let be prime, , and . Fermat's little theorem makes the displayed multiplication well defined. Its identity is and inverse is ; associativity follows by expanding both bracketings. Projection onto the first coordinate is a group homomorphism with normal cyclic kernel of order . Under the change , multiplication becomes , the semidirect product of the additive prime field by the cyclic group of order . The group is abelian precisely when ; need not be a generator of the multiplicative field group.
For a planar adiabatic explosion with energy per unit area in a uniform medium of mass density , the conserved energy has form , with a finite positive integral of the similarity profiles. Hence . If is shared by two fronts, its fraction assigned to either side is absorbed into .
The generating function weights each self-avoiding walk by to the power of its length, including the zero-length walk. Its radius of convergence is the reciprocal of the upper exponential growth rate of the rooted counts, by the Cauchy-Hadamard theorem.
On the square lattice, a self-avoiding walk using north, east and west steps but no south steps. At each horizontal height, self-avoidance forces one monotone horizontal run. Conversely, such runs separated by north steps always give self-avoiding walks, because every new run is at a previously unvisited height.
An ice floe is a connected floating piece of sea ice. Its diameter relative to wavelength and its thickness affect the reflection, transmission and dissipation of surface gravity waves.
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





