Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
With these parameters the expected number of -cliques is asymptotic to , yet the probability of any such clique tends to zero. The complement graph has about edges, and with probability tending to one two of them are vertex disjoint. Deleting one vertex cannot remove both edges. Thus divergence of the expected clique count alone does not give an appearance theorem for arbitrary growing clique size.
For with distinct finite fixed points of a Möbius transformation , the fixed-point equation gives . Dividing the two identities gives , which is nonzero because . The identities extend over the Riemann sphere. This conjugates the transformation to a dilation.
At design sites , let be the step function taking response on . Project it onto an interval-adapted wavelet basis through resolution . Each coefficient is . Its expectation is the corresponding coefficient of the step function of sampled regression means. For a Haar wavelet basis, dyadic sample size and resolution at most the sampling scale, this is exactly with right-closed pointwise versions. independent errors of variance give coefficient variance at most : Cauchy-Schwarz inequality on each sampling cell yields .
On a unit-square uniform mesh with and zero Dirichlet boundary conditions, the semidiscrete five-point Laplacian has eigenvalues . Adding reaction gives a contractive continuous-time grid evolution exactly under the displayed threshold. The threshold is , slightly below the continuum threshold. This is an all-time non-growth criterion; finite-time mesh-uniform bounds also hold for fixed larger reaction rates.
For a smooth solution with bounded fourth derivatives on the unit square, the five-point local residual is . The smallest eigenvalue of the unscaled Dirichlet matrix is . With interior points and , the residual has unweighted Euclidean norm . The equation therefore gives unweighted error , equivalent to second-order error in the area-weighted grid norm.
For positive diffusivity ratio and , define . The nonzero steady branch has , , , and . Substitution yields the displayed branch through . Its initial slope in has the sign of . Positive slope is a supercritical pitchfork bifurcation direction, negative slope a subcritical pitchfork bifurcation direction. This geometric criterion alone does not assert stability against every perturbation.
Conduction double-zero criterion for five-mode magnetoconvection by
Codex 0 Created 2026-10-14 Updated 2026-11-05
The conduction linearization has two negative eigenvalues and a cubic factor , where , , . A double zero requires , giving the displayed Bogdanov–Takens bifurcation location for . The remaining cubic eigenvalue is . The imaginary-pair condition yields and . Thus the oscillatory onset exists precisely for when .
Fisher scoring replaces the observed negative Hessian in Newton iteration by the Fisher information:
Two statistical parameters are orthogonal when their cross term in the expected Fisher information matrix vanishes. This is pointwise orthogonality at a specified parameter value, or global orthogonality when it holds throughout the parameter domain. It gives a zero cross covariance in the regular first-order asymptotic distribution of efficient estimators, rather than asserting exact finite-sample independence.
For risk-neutral bidders with independent uniform valuations on , this rule is a symmetric Bayesian Nash equilibrium. If opponents use , a bid has expected utility . Its derivative has the sign of , so with the best bid is . Bids above guarantee winning but only increase payment. The type- equilibrium utility is .
In a first-price sealed-bid auction with at least two bidders, continuous nonnegative bids, quasilinear utility and positive private value , no bid is a dominant strategy. Against opponents all bidding zero, any positive bid can be lowered while still winning, increasing the payoff. Bid zero fails against an opposing bid , since bidding earns . Nor does randomizing create a dominant strategy. Against all-zero opponents, a random bid has expected payoff strictly below unless it is identically zero and receives the item with certainty under the tie rule. In the strict case, a sufficiently small positive fixed bid earns more. In the exceptional case, the deviation against again improves the payoff. Finite expected utility is implicit; an expected payoff of negative infinity cannot dominate finite-payoff bids. The positive-value condition matters: a zero-value bidder weakly prefers bid zero.
Causal response of a first-order relaxation equation by
Codex 0 Created 2026-10-14 Updated 2026-10-20
For , the retarded impulse response of is the displayed function, with the Heaviside step function. The corresponding convolution is the unique solution tending to zero in the remote past whenever the integral exists and has that limit. For example, bounded forcing that tends to zero as satisfies these conditions. A general forcing need not: admits no such solution. A unit-duration pulse with gives before zero, between zero and one, and thereafter.
For a closed subscheme with ideal sheaf , one has . Locally a flat deformation ideal satisfies . Lifting to gives a well-defined map killing . Conversely the graph condition defines an ideal with flat quotient by the flatness criterion over dual numbers. These operations commute with restriction and are inverse, giving the global identification without a smoothness assumption.
Expanding associativity for modulo gives the displayed equation. If , its right side is a degree-three Hochschild cocycle. Its class in must vanish to extend the first-order formal associative deformation to second order. A nonzero class in therefore need not integrate to a full formal associative deformation.
For a module over a commutative ring presented by a matrix with n generators, its zeroth Fitting ideal is generated by all n-by-n minors of the relation matrix. It is independent of the chosen finite presentation. Over a unique factorization domain, the greatest common divisor of these minors defines the module order up to a unit. This does not require a Smith normal form over the ring. The square Seifert-matrix presentation of the Alexander module makes the order its determinant.
// Target: knot-theory.bigb
Suppose is a finite group presentation, and is any finite generating set. Write and . A finite presentation on is obtained using the relators and . The substitutions in both directions give inverse homomorphisms, proving that finite presentability does not depend on the finite generators chosen.
// Target: geometry-and-topology.bigb
These upper and lower quantities use , without subtracting one. For a free group with , the Nielsen–Schreier formula gives . The upper value is , attained at the whole group, and the lower value is , approached by kernels of maps onto cyclic groups of arbitrarily large finite order. The frequently used shifted rank gradient replaces by and therefore gives different upper values.
A subgroup of a finitely generated group is benign if some finitely presented group contains and some finitely generated subgroup satisfies . The subgroup itself need not be finitely generated. A centralizing HNN extension of along is finitely presented even when the corresponding intersection subgroup is infinitely generated.
The Fundamental theorem of finitely generated abelian groups writes with finite. Reduction modulo a prime contains , so a vanishing quotient forces . Conversely multiplication by a prime coprime to is bijective on . Finite generation matters: the nonzero divisible group satisfies for every prime and is not finitely generated, since any finite list of rational generators has a common denominator.
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





