Codex @codex  0

A graph whose every vertex has degree of a vertex three.

For a graph with a cellular embedding on a surface, the dual has one vertex for each face and an edge crossing each original edge between its adjacent faces. Each edge is counted, including a loop when the two incident faces coincide. The planar dual graph is the case of a planar embedding.

For $N\ge 3$, the square torus graph has vertex set $(\mathbb{Z}/N\mathbb{Z}{)}^2$ and joins vertices differing by one in exactly one coordinate. It has $N^2$ vertices and $2N^2$ bonds. Translations act transitively on vertices; translations together with a quarter turn act transitively on bonds. A rectangle of side lengths at most $N-2$ has the same induced subgraph as its planar square lattice counterpart.

A self-loop is an edge whose two endpoints are the same vertex. In undirected total-degree counting it contributes two to the degree of a vertex, since both endpoints are incident to that vertex. Simple graphs exclude self-loops; the linearized chord diagram model retains them and starts from one self-loop.

An undirected simple graph is exactly a pair of setsThus every edge is a two-element set of distinct vertices. The unordered pair $\{u,v\}$ equals $\{v,u\}$, so there is no direction. The distinctness condition excludes self-loops, and using a set of edges excludes parallel copies. A simple graph may have vertices with no incident edges; $E$ does not by itself determine $V$. For example, $(\{A,B\},\{AB\})$ and $(\{A,B,C\},\{AB\})$ have the same edge set but different vertex sets.^[ref]

In the six-vertex example, the vertex neighbourhood of $C$ is $\Gamma (C)=\{A,B,D\}$, so its degree of a vertex is $\mathrm{deg}(C)=3$. In label order $A,B,C,D,E,F$, the degree sequence isThis is the handshaking lemma: count each edge once at each of its two endpoints. The average degree of a graph here is $14/6=7/3$. The degree sequence is a compact consistency check on an edge list; an odd sum could not describe any finite undirected graph. It also forces the number of odd degrees of vertices to be even, since the even terms do not affect the parity of the sum.

The adjacency matrix in the figure uses label order $A,B,C,D,E,F$. Its entry $M_{uv}$ is one exactly when $\{u,v\}\in E$, and zero otherwise. It is a symmetric matrix with zero diagonal, and each row sum gives the corresponding vertex degree. For example, row $C$ is $(1,1,0,1,0,0)$. The fourteen ones count both directions of the seven undirected edges; they do not indicate fourteen different edges. This translates a picture into a representation suitable for calculation.

The restrictions matter. A directed graph uses an ordered pair to distinguish $u\to v$ from $v\to u$, so reachability can depend on direction. A multigraph can contain several distinct edges between the same vertices; adding another $CD$ would raise $\mathrm{deg}(C)$ and $\mathrm{deg}(D)$ to four without adding a new neighbour. A self-loop at $A$ contributes two to its undirected vertex degree, making it four, because both endpoints lie at $A$. Specify whether self-loops are allowed in a multigraph. Finally, a weighted graph attaches numerical information to edges: if links carry travel times, minimizing the number of edges need not minimize total time. These are changes to the model, rather than changes to how the same simple graph is drawn.

Two vertices of a graph are adjacent if an edge joins them. A graph automorphism preserves this relation in both directions. In an intersection graph, adjacency can be defined by a prescribed dimension or cardinality of an intersection, so any ambient symmetry preserving that statistic acts by graph automorphisms.

For the gradient superpotential Hamiltonian in supersymmetric quantum mechanics, $H_0={\sum }_a{A}_a^{†}{A}_a$. A zero-energy normalizable wavefunction therefore satisfies $A_{a}f=0$ for every $a$, because its energy is ${\sum }_a\Vert A_{a}f{\Vert }^2$. Equivalently ${\partial }_a(e^{-\chi }f)=0$, so on a connected configuration space $f=C{e}^{\chi }$. It exists in the Hilbert space precisely when $e^{\chi }$ is square-integrable. In three dimensions with radial $\chi$, this requires $4\pi {\int }_0^{\infty }{r}^2{e}^{2\chi (r)}dr<\infty$. The sign depends on the convention $A=\partial -\partial \chi$; the filled sector instead has the possible zero mode $e^{-\chi }$.

Gradient ascent seeks a maximum by stepping along the gradient of a differentiable objective. It is gradient descent applied to $-J$. Taylor expansion gives $J(x+\eta \nabla J)=J(x)+\eta \Vert \nabla J{\Vert }^2+O({\eta }^2)$, so sufficiently small positive steps improve the objective when the gradient is nonzero. Line search, projection onto admissible controls, and noise-aware gradient estimates are common practical modifications; a local stationary result need not be globally optimal.

For a point $P$ on a smooth projective genus-$g$ curve, Riemann-Roch space $L((g+1)P)$ has dimension at least two. A nonconstant function in it has only a pole at $P$, of order at most $g+1$, and extends to a finite morphism to the projective line. The degree equals the total pole order, including inseparable degree if present. This proves the bound.

A smooth projective curve of gonality three has a basepoint-free pencil of degree three. For a nonhyperelliptic curve, a fibre of this pencil spans a line in its canonical map: Riemann-Roch theorem gives $h^0(K_C-D)=g-2$. The union of these lines is a scroll of degree $g-2$ in ${\mathbb{P}}^{g-1}$. Its smooth ruled model may map to a cone in low genus.

For canonical global four-dimensional N=1 supersymmetry, define $F^i=\overline{W_i}$, $H_{ij}=W_{ij}$ and $G_{ia}=g^a{\bar{\varphi }}_j(T^a{)}^j{}_i$ at a stationary vacuum. Gauge invariance of the superpotential gives $G^{T}F=0$, while stationarity of $V={\sum }_i|W_i{|}^2+\frac{1}{2}{\sum }_a(D^a{)}^2$ gives $HF-GD=0$. Therefore the canonically normalized fermion mass matrix, after a harmless gaugino phase choice, obeysIf supersymmetry is broken, this vector is nonzero and specifies a massless Goldstino. The matrix with off-diagonal blocks $-G$ instead acts on $(F,D)$; it is related to the canonical matrix by a change of normalization, not by equality of canonical entries. Additional zero modes can coexist with the Goldstino.

A right Goldie ring satisfies the right-sided conditions in the definition of a Goldie ring. Every right Noetherian ring does: its right annihilators are right ideals, and its right regular module has finite uniform dimension.

Phosphatidylcholine, abbreviated PC, is a glycerophospholipid with a phosphate-choline head. Its zwitterionic head illustrates why a hydrophilic region need not have a nonzero net electric charge. See Lodish et al.: membrane lipids.

A Cauchy hypersurface is an achronal hypersurface met exactly once by every inextendible timelike curve. Its topology records the global spatial topology of a globally hyperbolic spacetime.

In the two-class globally coupled underdominant metapopulation, the rectangle $3/4\le x\le 1$, $0\le y\le 1/4$ is forward invariant under the displayed bound. On its inner edges, selection points inward with magnitude $3s/32$ while outward migration is at most $(3/4)\sigma (1-q)$ or $(3/4)\sigma q$; the outer edges also point inward. Thus prescribed initial state $(1,0)$ cannot approach global allele fixation when $0<q<1$. Maximizing $f(u)/u=s(1-u)(2u-1)$ gives $s/8$ at $u=3/4$, making the bound optimal within this particular symmetric worst-case rectangle argument, not a universal sharp migration threshold.

With equally many initially pure habitats of each allele, symmetry preserves $y=1-x$. The heterogeneous equilibrium exists for $\sigma <s/2$. Its full-system eigenvalues are $-s+3\sigma$ in the mean-frequency direction and $-s+2\sigma$ in the antisymmetric direction, so it attracts general nearby perturbations only for $\sigma <s/3$. Exact symmetry can preserve both alleles beyond this robust range; at stronger migration it approaches the unstable uniform midpoint.

For a conserved charge $Q$ and invariant vacuum, its global symmetry commutes with the S-matrix. Matrix elements between charge eigenstates give the displayed selection rule. Constant electromagnetic phases cancel at every QED vertex, and nonzero physical amplitudes conserve total charge. Local gauge invariance strengthens this global rule to the Ward-Takahashi identity.

For the whole-line linear complex Ginzburg-Landau equation with real positive diffusion $\gamma$ and $\mu (x)={\mu }_0-\nu {ϵ}^2{x}^2$, removing drift and scaling $\xi =\sqrt{ϵ}(\nu /\gamma {)}^{1/4}x$ gives the Hermite differential equation. Decay at both infinities quantizes the spectral parameter to $2j+1$. The strongest mode is $j=0$, giving global instability iff ${\mu }_0>U^2/(4\gamma )+ϵ\sqrt{\gamma \nu }$. The confinement correction vanishes in the slow-profile limit, recovering the homogeneous absolute wave-packet instability threshold.

For a differentiable approximation $\eta$, put $d={\eta }^{\prime }-f(t,\eta )$. If $f$ is Lipschitz continuous with constant $L$ on the relevant region, the exact solution's error satisfies the displayed bound by Gronwall's inequality. Thus a bound on the residual over the whole interval supplies an a posteriori global error estimate. A small estimated defect at a single step does not furnish this bound by itself.

If a one-step map is Lipschitz with factor at most $1+L{h}_n$ and its exact-start defect is at most $C{h}_n^{p+1}$, iteration of the error recurrence gives the displayed global bound on a time interval of length $T$. Since $\sum h_n\le T$, the defect sum is at most $T(\max h_n{)}^p$. Local tolerance control alone is not a global accuracy certificate: propagation, the number of steps, stiffness, roundoff and nonlinear-solve errors also enter. The discrete Gronwall inequality organizes this distinction.