At the surface of a perfect conductor, the tangential electric field and normal magnetic field vanish. An incident plane electromagnetic wave is therefore accompanied by a reflected wave whose tangential electric field cancels the incident field at the surface.
For a smooth plane curve of degree , adjunction givesIts canonical map is induced by the rd Veronese map and is therefore an embedding.
For a finite connected graph with at least one vertex, embedded as a plane graph, let count vertices, count edges, and count faces of a plane graph, including the outer face. ThenThe hypotheses refer to an actual embedding; regions in a crossing-filled graph drawing do not supply its .[ref]
Planar Graphs; Bipartite Matching by Albert R. Meyer (6.042J lecture 5f). Planar Graphs; Bipartite Matching, slides lec 5f.14–5f.15
In the plane graph pictured above, three bounded faces of a plane graph and the outer face give . A square cycle graph gives , while the graph path gives . Changing a crossing into a new vertex changes the graph: the square-and-diagonals drawing then has five vertices, eight edges, and five faces of a plane graph, giving .
A proof outline deletes edges on graph cycles. Each deletion preserves the connected graph and merges two faces of a plane graph, leaving unchanged. Eventually a tree remains, with and . Adding the point at infinity identifies the plane picture with a sphere; the value two agrees with its Euler characteristic and the cell-count formula for Euler characteristic.
A planar dual graph has one vertex in each face of a fixed planar embedding and one dual edge crossing each primal edge.
If a prime ideal of lies over the prime number with ramification index of a prime ideal , its normalized absolute value isIt extends the usual p-adic absolute value on . Its local degree is , where is the residue-field degree.
A real embedding gives a real Archimedean place of local degree . A conjugate pair of complex embeddings gives a complex Archimedean place of local degree .
Reflection symmetry forces the reduced vector field to be odd in , naturally producing paired nonzero equilibrium branches.
The normal form has a stable trivial equilibrium for and two unstable nonzero equilibria for . They collide with the trivial branch at , after which that branch is unstable.
The photon quadrupole is the leading anisotropy that sources linear polarization through Thomson scattering.
The photon dipole represents the bulk velocity of the radiation. In tight coupling to baryons, under the convention used here.
The photon monopole is the direction-averaged fractional temperature perturbation. In Newtonian gauge its gravitationally observable effective temperature is the Sachs-Wolfe combination .
The tight-coupling approximation expands the photon-baryon Boltzmann equations in powers of and , where is the Thomson scattering rate.
A symplectic form is a closed differential form of degree two whose value on every tangent space is a nondegenerate alternating bilinear form. In canonical position-momentum coordinates it is .
This representation is a distinguished example in the representation theory of the symmetric group.
The permutation representation of on decomposes asThe first summand is the trivial representation and the second is the -dimensional standard representation.
Symmetric-group subset permutation representation by
Codex 0 Created 2026-09-24 Updated 2026-10-03
Order as the exact period of modular exponentiation by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Let be coprime integers with , and let be their multiplicative order. For integers ,Negative exponents mean powers of the modular inverse of . Thus periodic modular exponentiation has smallest positive period , and are distinct congruence classes.[ref]
A Computational Introduction to Number Theory and Algebra by Victor Shoup. pp. 156–157, Theorem 6.29; multiplicative notation on p. 153
This lets a huge modular exponentiation reuse a short list: reduce its exponent modulo the multiplicative order, then look up the corresponding power. For example, gives , while gives . When the multiplicative order is unknown, Euler's theorem permits reduction modulo Euler's totient function, though that period may be longer. Repeated squaring remains useful when computing either the unreduced or the reduced power.
For a proof outline, multiply by the modular inverse of , leaving . Apply Euclidean division to write with . Then ; minimality of the multiplicative order forces . The reverse implication follows from . The coprime integers hypothesis enables cancellation: modulo eight, , but this repetition supplies no multiplicative order for two.
For a Boolean function of independent coordinates and a randomized decision tree that determines it, the OSSS inequality bounds its variance by a sum of coordinate influences weighted by their revealment probabilities.
There are unlisted articles, also show them or only show them.