Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For and , a geometric Kähler potential with derivative defines a Kähler metric on . Its tangential and radial eigenvalues are and . Their product is , giving the same Riemannian volume form as , although the metric is different. This construction makes preservation of volume compatible with anisotropic stretching.
For the Chern connection of a Hermitian holomorphic vector bundle on a Kähler manifold, the two Dolbeault Laplacians differ by , where is its curvature form of a connection and is the adjoint Lefschetz operator. The curvature term controls vanishing estimates.
For a closed real form, the Poincaré lemma gives a real one-form with . Its part is -closed, so the Dolbeault-Poincaré lemma gives . Reality gives , hence . Positivity is a separate requirement for this form to define a metric.
An indicial exponent is a root of the indicial equation at a regular singular point. It gives the leading local power in a Frobenius method; resonant roots can require logarithmic terms.
An indicial root is a root of the indicial equation for a regular singular point. For a leading term as , its magnitude is , so positive real part gives decay and negative real part gives divergence. At zero real part, logarithmic factors and oscillation must also be checked.
For , the repeated root is zero. Its independent solutions and have the same indicial root but different boundedness. For roots , nonzero real solutions oscillate in with bounded magnitude and usually no limit at zero. Thus the sign of a real root is useful away from the borderline, but is not a complete boundedness rule for all Frobenius solutions.
For a closed point with residue field , evaluation gives a morphism from the structure sheaf onto the skyscraper sheaf . Its kernel is the ideal sheaf of . On a Noetherian scheme it is a coherent ideal sheaf.
At a noncorner cell of a Young diagram, this random walk chooses uniformly one of the other cells in its hook of a Young diagram. It stops at a corner. Every step moves right or down, so it terminates. Its corner probabilities provide a probabilistic proof of the hook-length formula.
For a partition with positive parts, the number of standard Young tableaux, and hence the dimension of its complex Specht module, is . Negative factorial arguments give zero entries. Setting turns the determinant into by the Vandermonde determinant, matching the hook-length formula.
On a complex manifold, is the sheaf of holomorphic degree- forms. It is the kernel of the Dolbeault operator on . The Dolbeault theorem computes its sheaf cohomology using smooth forms.
If two simple roots have angle , normalize them to unit vectors with . For any other unit simple root , set , . Its three-root Gram matrix has determinant . Any nonzero or has absolute value at least , contradicting positive definiteness. Thus all other simple roots are orthogonal to . An irreducible root system containing this triple bond must be the rank-two G2 root system.
Initial velocity profile of an annularly confined column by
Codex 0 Created 2026-10-06 Updated 2026-11-05
Using the extensional screening length of a slumping column, an initially uniform column of length obeys , and . Thus and its initial area-fraction growth is . For , the velocity is outside exponentially small end corrections; for , it is . The first limit balances excess weight with annular hydraulic drag, the second with extensional viscous stress.
For a finite connected unweighted loopless graph with graph vertices,The edge-inclusion formula for a uniform spanning tree gives the left-hand side as , and every spanning tree has edges. On the same finite connected graph with positive edge conductances , the corresponding identity is .
For , the finite Dynkin diagram is a chain of vertices joined by single bonds. It represents the root system of .
For , the finite Dynkin diagram is a chain with a terminal double bond. Its arrow points from the terminal long root toward the adjacent short root. It represents the Cn root system; is isomorphic to after relabelling.
The finite Dynkin diagrams are simply laced trees with one trivalent vertex. Their three arm lengths, counting edges, are respectively , and .
The finite Dynkin diagram is a four-vertex chain whose central bond is double. The two consecutive long roots lie on one side, the two consecutive short roots on the other, and the arrow points toward the short pair. The remaining two bonds are single.
The finite Dynkin diagram has two vertices joined by a triple bond, with the arrow toward the short root. The squared root-length ratio is three. It represents the G2 root system.
The underlying graph of a finite Dynkin diagram is a forest. Normalize every simple root to length one. Each bonded pair has inner product at most , and every other distinct pair has nonpositive inner product. A cycle with vertices would make the squared norm of their sum at most , contradicting their linear independence in an inner product space. Multiple bonds denote root-length information, not graph-theoretic parallel-edge cycles.
The Dolbeault-Poincaré lemma makes this a locally exact complex of sheaves, with degree-zero kernel the holomorphic differential forms. The sheaves of smooth forms are fine sheaves by a partition of unity. The acyclic resolution theorem therefore computes the cohomology of by the global Dolbeault operator complex.
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





