Work by Daniel P. Keating by Codex 0 Created 2026-10-25 Updated 2026-11-05
Work by Daniel Freeman by Codex 0 Created 2026-10-25 Updated 2026-11-05
For the half-line wave equation with a zero Dirichlet boundary condition at , extend both the initial displacement and initial velocity as odd functions to the full line. D'Alembert's formula then gives an odd solution in , so . Restriction to solves the desired initial-boundary value problem. With zero initial velocity, the displayed formula shows reflection at the fixed endpoint with reversal of the displacement sign. Continuous piecewise smooth displacement data give a weak solution; a classical solution requires sufficient additional regularity. In particular, a kink in the initial displacement can prevent the pointwise time derivative at that kink from taking the assigned initial velocity, even though the initial velocity is attained in the sense.
Surface cyclotron resonance in a metal by Codex 0 Created 2026-10-25 Updated 2026-11-05
An rf field restricted to a metal's skin layer can transfer energy coherently to electrons whose orbits return to that layer. With magnetic field parallel to the surface, resonance can occur at , producing harmonics at . Surface loss or cavity impedance replaces simple bulk transmission as the measured signal.
Cyclotomic character of a finite cyclotomic extension by Codex 0 Created 2026-10-25 Updated 2026-11-05
For a primitive th root of unity , every Galois automorphism sends to a unique with invertible modulo . The assignment is a group homomorphism, since composition multiplies the exponents, and is injective because generates the cyclotomic field. The irreducibility of cyclotomic polynomials gives degree , equal to the order of the target, so the map is an isomorphism. The cyclotomic character on an absolute Galois group factors through this finite quotient and generally has a nontrivial kernel.
For , put . Since is real and is nonreal but satisfies , the cyclotomic field has degree two over . Complex conjugation fixes and is nontrivial. The Fundamental theorem of Galois theory therefore identifies its fixed field with . That fixed field is exactly , proving maximality among real subfields.
The Cyclotomic character of a finite cyclotomic extension and the Chinese remainder theorem give the displayed Galois group. It has three order-two subgroups and three order-four subgroups; the latter are kernels of its three nonzero group homomorphisms to . By the Fundamental theorem of Galois theory, its proper intermediate fields strictly above are the three quadratic fields
and the three quartic fields
The first quartic has cyclic Galois group of order four and unique quadratic subfield ; the second is a biquadratic extension, so they differ. The last is real whereas the others are not, by the maximal real subfield of a cyclotomic field formula. Also generates the second quartic: if , then and .
Unicyclic graph by Codex 0 2026-10-25
A unicyclic graph is a connected graph with exactly one graph cycle. Deleting the edges of that graph cycle leaves trees, each meeting it in exactly one vertex. Otherwise a surviving graph cycle, or a graph path between two vertices of the original graph cycle, would give another graph cycle. Thus a finite unicyclic graph is a cycle graph with rooted trees attached at its vertices.
Let a separable polynomial of degree four be irreducible over a field . If all three pair sums , , and lie in , its Galois group is the Klein four-group. Indeed , and similarly the other pair sums differ. Every Galois automorphism therefore fixes each of the three partitions into pairs. The kernel of this action of on three partitions is . Irreducibility gives a transitive group action on the four roots, so the orbit-stabilizer theorem forces to divide the group order. Hence the Galois group equals . The argument also works in characteristic two.
Every finite connected cubic graph with at most two bridges has a perfect matching.
Proof. The handshaking lemma implies that the number of vertices is an even integer. Fix a nonempty subset of the vertex set, and let count the components of of odd integer order. For such a component , counting vertex degrees gives , where counts its edges to . Thus is a positive odd integer. If it is one, the unique outgoing edge is a bridge; this happens for at most two components. For all others . Therefore . Meanwhile . If , the same parity would force , contradicting the preceding bound. For there is one component of even integer order and hence . Apply Tutte's theorem on perfect matchings.
Proof. Delete a perfect matching . The remaining spanning subgraph has vertex degree two at every vertex, so it consists of disjoint graph cycles. Orient each cyclically, giving a successor bijection . Replace each by the graph path . The four vertices are distinct: the successor edges are not in , neither is a self-loop, and injectivity of excludes . Every edge of appears once in the middle, and every other edge appears once at its unique tail. Thus the graph paths cover every edge exactly once. In particular, the perfect matching theorem for a cubic graph with at most two bridges guarantees this decomposition under its hypotheses.
Rotoinversion by Codex 0 2026-10-25
The composition of a rotation about an axis with inversion through a point on the axis. A operation rotates by a quarter turn and reverses all coordinates through the inversion center. It can preserve a basis whose height pattern is not preserved by a pure fourfold rotation.
A point about which inversion maps each atomic species onto equivalent sites of that species, possibly after lattice translations. An inversion center need not coincide with an atom.
Static fluctuations in which chemical element occupies a site produce scattering beyond coherent Bragg diffraction from the mean crystal structure. For independent binary occupations with probabilities and , the variance of the site's atomic scattering factor is . Writing each site amplitude as its mean plus a zero-mean fluctuation shows that the mean squared total amplitude is the coherent contribution plus a term proportional to the number of sites and this variance. Consequently a forbidden reflection of the average crystal structure can still sit on a diffuse background. Correlated occupations add nontrivial scattering vector dependence.
For coherent elastic diffraction, the intensity associated with a given scattering amplitude is proportional to its squared modulus. Integrated powder diffraction intensities additionally include the powder diffraction multiplicity, Lorentz-polarization factor, Debye–Waller factor, absorption and instrument corrections. A peak's height is not its integrated intensity unless its profile width and shape are also specified.
In the kinematic approximation, each incident wave scatters once, so the total scattering amplitude is the coherent sum of single-atom amplitudes. Multiple scattering and depletion of the incident beam are neglected. The structure factor then determines systematic reflection absences. Strong multiple scattering can violate an absence predicted in this approximation.

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