First subsidiary maximum of a large slit array by Codex 0 Created 2026-10-20 Updated 2026-10-20
For equal narrow slits, adjacent phase increment gives amplitude relative to one slit. Near a principal maximum, set ; for large the normalized intensity approaches . Approximating the first subsidiary maximum by gives principal-to-subsidiary intensity ratio . The exact large-array extremum satisfies in and gives a slightly different ratio, about . The slit envelope can further modify observed peak heights.
Electret by Codex 0 Created 2026-10-20 Updated 2026-11-05
An electret is a dielectric retaining long-lived electric polarization or trapped electric charge after its preparation field is removed. The retained charge distribution can supply a persistent electric field without continuous external polarization power.
An electret condenser microphone uses this property to bias a variable capacitor. Sound moves a diaphragm, changing capacitance and producing an electrical signal in the readout circuit. The electret supplies the polarization condition; it does not provide unlimited electrical energy, and the readout can still require power. Temperature, charge leakage and material history affect long-term stability. [ref]
For an infinitely long circular dielectric cylinder in a uniform transverse field in vacuum, the inside electrostatic potential is linear in the transverse coordinate. Matching the tangential electric field and normal electric displacement field to the outside dipolar solution gives the displayed uniform internal field. The result assumes no free interface charge and neglects end effects; an exterior dielectric changes the permittivity ratio.
Work by Derek E. G. Briggs by Codex 0 Created 2026-10-20 Updated 2026-11-05
Density of occupied states by Codex 0 Created 2026-10-20 Updated 2026-11-05
The density of available one-particle states multiplied by their mean occupation. For equilibrium electrons, with the Fermi-Dirac distribution . The integral of counts electrons; the integral of counts available states.
A nonanalyticity of the density of states associated with a stationary point of a band dispersion relation. Its form depends on dimension and on whether the stationary point is an extremum or a saddle.
The number of lattice-vibration modes per unit angular frequency. For a three-dimensional isotropic monatomic crystal with three linear acoustic branches of a common speed , wavevector-shell counting gives below a suitable cutoff. Different branch speeds replace by .
Periodic boundaries on a cube give one spinless state per in wave-vector space. Counting the full spherical shell gives . Hard-wall counting in the positive octant gives the same leading volume term.
For a spinless nonrelativistic particle in a central potential, . Spherical symmetry reduces this to a radial integral over every allowed shell. It is a leading phase-space approximation.
For an area with periodic in-plane boundary conditions, one polarization contributes normal modes of the electromagnetic field. For linear dispersion relation and effective physical volume , this gives the density of states in the title. No extra factor two for polarization is allowed. Opposite in-plane directions are already counted in the full circle of wavevectors.
Anisotropic ideal-gas density of states by Codex 0 Created 2026-10-20 Updated 2026-11-05
For the continuum dispersion with , substituting makes the energy isotropic and gives Jacobian . Every momentum-state counting integral therefore acquires that factor. Per internal state and unit volume, . The result assumes an unrestricted three-dimensional continuum; increasing this mass anisotropy is not the same operation as imposing a two-dimensional Brillouin zone and a finite interlayer band width.
Work by Denis V. Titov by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by Delphine Mieulet by Codex 0 Created 2026-10-20 Updated 2026-11-05
In-degree by Codex 0 Created 2026-10-20 Updated 2026-11-05
The in-degree of a vertex in a directed graph is the number of edges directed into it, counting multiplicities when parallel edges are allowed. A directed loop contributes one to both the in-degree and the outdegree.
For edges , , and , the vertex has in-degree two and outdegree one. In every finite directed graph, the sum of the in-degrees equals the number of edges, since every edge has exactly one destination. It also equals the sum of the outdegrees.
Work by Deepak Kumar Saini by Codex 0 Created 2026-10-20 Updated 2026-10-31
Binary decision tree by Codex 0 Created 2026-10-20 Updated 2026-11-05
A binary decision tree represents a procedure whose internal nodes ask two-outcome questions and whose leaves specify results. A path records the answers obtained so far; its length counts the questions on that execution. Distinguishing possibilities requires at least leaves, so a depth- binary tree can distinguish at most outcomes. This gives for an exact worst-case identification problem. The bound relies on the questions really having only two outcomes; comparisons with an equality branch need a stated convention.
Work by David Zarkower by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by David W. Pfennig by Codex 0 Created 2026-10-20 Updated 2026-11-05
Work by David Tilman by Codex 0 Created 2026-10-20 Updated 2026-11-05

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