Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
The ferromagnetic Potts model on a labelled ring has possible site states, and . Its spin-chain transfer matrix is , with the -dimensional all-ones matrix. The canonical partition function is . The convention counts two bonds when .
Involuntary recurrence of aspects of a traumatic experience, potentially including sensory impressions and a sense of current occurrence. It should be distinguished from deliberate recollection, rumination and a future-oriented image.
The experience that danger is present now, even when a reminder refers to a past event. The cognitive model of PTSD links this to appraisals and trauma-memory properties rather than simply the historical severity of the event.[ref]
A cognitive model of posttraumatic stress disorder by Anke Ehlers and David M. Clark. Behaviour Research and Therapy 38, 319–345; current threat, trauma-memory properties and maintaining strategies
The original 1996 account distinguishes verbally accessible memories from representations accessed automatically through situational cues. It aims to explain differences between deliberate narrative retrieval and sensory reliving. This functional distinction does not by itself prove two anatomically discrete memory stores.[ref]
A dual representation theory of posttraumatic stress disorder by Chris R. Brewin and others. Psychological Review 103, 670–686; original verbally/situationally accessible memory distinction
The ideal universal NOT map sends every qubit Bloch vector to , taking a pure state to its orthogonal pure state. It is a trace-preserving positive map but not a quantum channel: applied to one half of a Bell state, it produces an operator with a negative eigenvalue. A physical approximation can reverse all directions with factor using the equal mixture of conjugations by the three Pauli matrices. The isotropic qubit map complete-positivity bound proves that a larger uniform reversal is impossible among such isotropic maps.
Matrix transposition preserves positivity and trace but fails complete positivity. For the Bell state , partial transposition givesThe singlet has eigenvalue for this matrix, so the output is not a density operator. Universal qubit transposition is therefore not a quantum channel, although restricted input families can admit exact physical approximations.
Coordinates describing the joint activity of a neural population, often using one coordinate per cell or fitted latent variable. A trajectory connects states over time. A useful reduced description requires evidence that it retains the neural and behavioral properties relevant to the intended claim.
Statistical dependence between neural responses remaining after the modeled task-related mean has been removed. Residual dependence can reflect shared state or omitted task variables as well as biological noise, so its interpretation depends on the conditioning model.
For an ideal , let consist of the coefficients at of elements of of polynomial degree at most , including the zero polynomial. Each is an ideal of , and multiplication of representing polynomials by shows that .
If is a Noetherian ring, this chain stabilizes at some . Choose finite generating sets of an ideal for , and for each nonzero generator choose a representing polynomial with that leading coefficient and polynomial degree . These finitely many polynomials generate : for any nonzero of polynomial degree , use the chosen generators at level , multiplied by suitable powers of , to cancel its leading coefficient. Induction on polynomial degree finishes the argument. This proves the Hilbert basis theorem without assuming that is an integral domain.
The residual of a proposed polynomial root is the value , which is zero for an exact root. Its size alone does not bound the root error without information about the scaling and derivative of the polynomial.
For a separable polynomial in characteristic two, the Vandermonde determinant of its roots is fixed by every Galois automorphism: root permutations change it only by a sign, and in . It therefore lies in . Its square, multiplied by the square of the appropriate leading-coefficient power for a nonmonic polynomial, is the polynomial discriminant. Thus being a square does not detect containment of the Galois group in the alternating group. For example over has discriminant one and Galois group , while is trivial. The discriminant criterion for an alternating Galois group requires characteristic different from two.
For , and integer , truncating the defining polylogarithm power series after terms has remainderThe inequality uses monotonicity of and then the geometric series. The bound applies to negative real as well as positive real , and gives a rigorous absolute truncation tolerance independently of cancellation. It does not bound floating-point rounding error.
The sum over the two physical transverse photon polarization vectors is not the full tensor . It differs by gauge-dependent terms proportional to the photon four-momentum. When the amplitude satisfies the Ward identity, those terms vanish on contraction and one may use as a replacement inside the squared amplitude. This replacement must not be mistaken for a free-standing equality of physical polarization tensors.
A phonon polariton is a normal mode mixing an electromagnetic field with a polar optical lattice vibration. In a lossless isotropic oscillator model, . With , its two transverse branches obey . The nearly flat longitudinal optical mode is distinct from the upper transverse branch.
On a periodic domain, integrating gives because boundary fluxes cancel. On a periodic grid the row sum of the discrete Laplacian is zero, so is necessary. The constant gravitational potential remains an arbitrary gauge.
The time of the -th event of a Poisson process. At positive rate , the Poisson interarrival times , with , are independent and identically distributed random variables with the rate- exponential distribution. In particular, has expected value and variance . The inverse-count identity is .
For a Poisson process, the count and Poisson arrival time have the displayed inequality at every deterministic . A large count and a late arrival reflect opposite directions of the same fluctuation.
Here is a proof from independent increments. If , write with independent of . Conditional on , the event has probability , a nondecreasing function of . The event has a nonincreasing indicator function . For any random variable and an independent copy , oppositely monotone bounded functions satisfyTaking proves the claim. If , condition instead on ; then is nonincreasing in and is nondecreasing, giving the same inequality.
The inequality is preserved under joint convergence in distribution when the marginal distributions of the limit are continuous. Consequently, a limiting bivariate normal distribution with standard normal marginal distributions cannot have positive correlation coefficient. For , conditioning on makes , so , contradicting the inequality. For , that quadrant has probability , which also contradicts it.
Poisson count-arrival joint central limit theorem by
Codex 0 Created 2026-10-25 Updated 2026-10-31
For a rate-one Poisson process with Poisson arrival times , suppose and . Thenwhere and denotes the bivariate normal distribution with standard normal marginal distributions, including the singular cases. In particular, equal scales give and separated scales give .
To prove this, fix real and put for large . The event is exactly . Counts at the two deterministic times are sums of a shared count on and an independent count on the remaining interval. The central limit theorem for a centered Poisson random variable of diverging parameter follows by writing a count at a real time as its count at , a sum of independent unit increments, plus an independent remainder with expected value at most one. Markov's inequality makes that remainder negligible after division by .
Apply this central limit theorem to the two independent count blocks whenever their lengths diverge. A block with bounded length, or length negligible compared with the scale of its coordinate, contributes a term tending to zero in probability. The standardized pair of counts therefore has a joint normal limit whose correlation coefficient isThis includes : the difference block then has negligible variance after normalization. In the arrival event the standardized count at must be at least . Reversing this inequality changes the sign of the second limiting normal random variable, giving the asserted negative correlation coefficient. Continuity of the marginal distributions permits the moving thresholds and the weak inequalities, including at the singular limits.
Every is realized by with , and zero by . Conversely, even when has no limit, it has a subsequence converging in the extended interval . If the original pair has a joint bivariate normal distribution limit, that subsequence has the same limit, forcing its correlation coefficient into .
For an ideal planar electric double layer at fixed surface charge density, let . Adding bulk divalent chloride concentration adds two monovalent coions per counterion. Differentiating the squared Grahame equation gives the displayed expression, with all denominator concentrations evaluated at the surface. The numerator concentrations are bulk increments. Dropping depleted coions at strongly negative potential gives the leading counterion approximation. A large finite increment instead requires solving the fixed-charge equation at the new composition; exponentiating a first-order voltage estimate does not make that estimate exact.
In a planar incompressible flow, a line source injects volume flux per unit length perpendicular to the plane. Its radial velocity is , since integrating the outward velocity around a circle gives . Its complex potential of a two-dimensional potential flow is and its complex velocity is . Here means outward flow; a line sink has negative . Away from , this is an irrotational flow as well as an incompressible flow.
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





