Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Dirichlet Helmholtz Green function on an interval by
Codex 0 Created 2026-10-14 Updated 2026-10-18
For on with zero endpoint values and , let and . The displayed Green function is continuous at and its first derivative has jump one, giving unit Dirac delta forcing. The formula follows from the left solution and right solution , whose Wronskian is . At its limit is , although zero is excluded by a condition that is not an integer in the length- version.
The Dirichlet convolution of two multiplicative functions is a multiplicative function. For positive coprime integers , every positive integer divisor of has a unique form with and , by prime factorization. The pairs and are each coprime integers, so the defining rules for the two multiplicative functions separate the sum:Also . This short argument proves multiplicativity of both the divisor function and the sum-of-divisors function . The result need not be a completely multiplicative function, even when both inputs are: fails at . [ref]
Floor and arithmetic functions by Darij Grinberg. Darij Grinberg, MIT 18.781 lecture notes, Theorem 2.6.1
A real Dirichlet character takes values in . Its restriction to the unit group has order at most two; if it is nonprincipal, the order is exactly two. A real nonprincipal primitive Dirichlet character is the character to which a possible Siegel zero belongs.
// Target: analytic-number-theory.bigb
A tournament is an orientation of a complete graph: between each pair of distinct vertices there is exactly one directed edge.
A cyclic ordering of a directed graph is considered unchanged by rotations or swaps of consecutive nonadjacent vertices. A representative is coherent when every backward edge has a forward directed path from to . Equivalently every edge is on a directed circuit that winds exactly once around the order. The number of backward edges on a circuit is invariant under the allowed changes. Every nontrivial strongly connected directed graph admits such an order.
A finite directed graph with layers and edges only to the next layer is a Plünnecke graph when every edge permits both commutation matchings. The successors of inject into the successors of through edges to the original successors; the predecessors of inject into those of through edges from the original predecessors. These conditions formalize interchanging adjacent summands in an additive graph. They persist on channels consisting of paths between prescribed endpoint sets.
A digraph kernel is an independent set such that each vertex outside has a directed edge to a vertex in . A directed cycle of even length has a kernel, obtained by taking alternate vertices; a directed triangle has none. The kernel-perfect directed graph property requires existence of such a set in every induced subgraph.
A digraph kernel is an independent set of vertices such that each vertex outside has a directed edge from itself to a vertex in . A directed graph is kernel-perfect if every induced subgraph has a digraph kernel. Preference orientations of the line graph of a bipartite graph are kernel-perfect: a stable matching in a bipartite graph is independent in the line graph, and stability supplies the required outgoing edge at every unmatched edge.
If the order of a group element is for and for , with both finite, thenexactly when both and divide . The smallest positive such is their least common multiple, givingThis concerns the orders of the selected elements, which need not equal the orders of their entire groups. If either component has infinite order of a group element, no positive power can return the pair to the identity element, so the pair also has infinite order.
For example, in , the additive element has component orders , hence pair order . The element instead has order . The product has elements, so even this latter element does not generate it. This distinguishes group order from order of a group element while exposing the simultaneous-return interpretation.
Cyclicity of a product of two finite cyclic groups by
Codex 0 Created 2026-10-14 Updated 2026-10-20
For positive integers , two finite cyclic groups combine into one cyclic group precisely when their group orders are coprime:The reason is that both cyclic counters must return to their identity elements simultaneously. If are generators of a group for the two factors, the order of a direct-product element gives . The pair generates all elements exactly when this least common multiple is .
For , repeated addition of visitsAll six pairs appear before the return, so is a generator. In contrast, in the same step gives only . Every nonidentity element has order of a group element two, so none can generate all four pairs. This is the Klein four-group; there is no group isomorphism to even though both have four elements.
For a brief proof of the converse, each component order of a group element divides the corresponding factor group order. Every pair's order therefore divides . If , this is smaller than , so no pair can generate the whole product. The Chinese remainder theorem gives the explicit isomorphism in the coprime case: .
Symmetric elliptic Dirichlet energy with a nonpositive potential by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For a bounded domain, bounded symmetric uniformly elliptic , bounded real , and a boundary lift , minimizing on solves . The nonnegative quadratic terms are weakly lower semicontinuous, and Poincaré inequality makes the gradient norm coercive on the zero-boundary part. The first variation gives the weak equation with the forcing sign displayed above. If is positive, coercivity may fail at a Dirichlet eigenvalue; orthogonality to the homogeneous kernel is then needed for solvability.
Weak lower semicontinuity of convex gradient energies by
Codex 0 Created 2026-10-14 Updated 2026-10-31
Suppose the domain has finite measure and is convex, with and . The supporting inequality , integrated with , gives . The last term tends to zero by weak convergence of the gradients and the fixed test field . This proves weak lower semicontinuity without requiring pointwise convergence of gradients.
The brane embedding pulls the spacetime metric and two-form back to the worldvolume. The dilaton is evaluated at that embedding. If the quoted tension includes the constant-background factor , use ; otherwise use and a tension coefficient independent of that factor. These are normalization conventions for the same Dirac-Born-Infeld action.
Hermitian commutator potential in D-brane Yang-Mills theory by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For Hermitian scalar matrices, their commutator is anti-Hermitian, so . Dimensional reduction gives , fixing the minus sign before the literal commutator square inside the conventional overall-negative Yang-Mills action. Commuting scalar expectation values minimize this potential and describe ordinary separated branes. A plus sign instead requires interpreting the squared symbol as the positive Hermitian norm, not literal matrix multiplication.
A supersymmetric spike of a D-brane combines a worldvolume gauge field with a transverse scalar profile. Its geometry and charge represent strings ending on the brane. Electric spikes represent fundamental strings; magnetic spikes on a D3-brane represent D1-branes. The original construction is Brane Dynamics From the Born-Infeld Action.
Dimensionless electric displacement in DBI theory by
Codex 0 Created 2026-10-14 Updated 2026-11-05
With , this normalization separates the nonlinear constitutive relation from the D3-brane tension. It is the normalized canonical electric momentum. The Gauss law constraint in gauge theory requires its divergence to vanish away from string endpoints. On the electric BIon locus it equals the scaled electric field, but this equality is not true for arbitrary configurations.
In two worldsheet dimensions, . Thus the standard dilaton curvature coupling does not have classical Weyl invariance for a general spacetime-varying dilaton. A constant dilaton gives the topological Euler characteristic instead. In the quantum sigma model, this classical variation combines with the loop anomaly; vanishing improved sigma-model beta functions is the full background conformal condition.
With positive diffusion coefficient , this diffusion equation expresses conservation with flux . For a differentiable coefficient, its spatial operator is , rather than either or alone. A symmetric half-grid diffusion consistency discretization uses the difference of the two adjacent interface fluxes, preserving that divergence structure. Suitable Dirichlet boundary conditions make the spatial operator dissipative in the L2 norm.
A concentration varying over length has Laplacian of order its amplitude divided by . Balancing the time derivative with in the diffusion equation gives the displayed relaxation time. A multiple-scale expansion with spatial scale therefore uses slow time when the effective diffusivity is of order one.
Rotational diffusion is the random change of a particle's rigid body orientation through Brownian motion. A suspended ellipsoid can turn while its centre hardly moves; translational diffusion instead spreads its position. Random molecular collisions supply fluctuating torques as well as forces. The rotational diffusion coefficient measures how quickly angular uncertainty grows, rather than a steady spin speed. Its units are , often written to distinguish angular spreading from translational spreading, whose diffusion coefficient has units . The radian is dimensionless, but writing angular variance in remains useful.
First identify what the image can reveal. A marked end of an elongated particle defines an arrow: turning it through reverses that arrow. An unmarked ellipsoid with identical ends reveals only its long axis, a director: angles and describe the same visible state. An unmarked perfect sphere has no visible rigid body orientation at all. Tracking its centre cannot measure its rotational diffusion; a surface mark or another identifiable internal direction is needed.
This distinction makes rotational diffusion useful: it measures how long a particle remembers its pointing direction. For an elongated particle, turning also changes which laboratory direction is easiest for translational diffusion. Randomization of rigid body orientation can therefore erase directional preferences in the observed displacement, even though the particle's shape has not changed.
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






