Transverse electrostatic field inside a dielectric cylinder by
Codex 0 Created 2026-10-20 Updated 2026-10-20
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.
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.
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.
Single-polarization two-dimensional photon density of states by
Codex 0 Created 2026-10-20 Updated 2026-11-05
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.
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.
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.
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.
There are unlisted articles, also show them or only show them.