A finite nonzero Saffman integral gives $E(k)=L{k}^2/(4{\pi }^2)+o(k^2)$ in the standard isotropic spectrum normalization. This follows by expanding the radial spectral transform at small wavenumber. A further analytic term requires additional correlation moments.

With nonzero invariant $L$, a self-preserving integral scale of turbulence gives $L\propto \mathcal{E}{\ell }^3$. Combining this with freely decaying high-Reynolds-number viscous dissipation $ϵ\propto {\mathcal{E}}^{3/2}/\ell$ gives $\mathcal{E}\propto (t-t_{\ast }{)}^{-6/5}$ and $\ell \propto (t-t_{\ast }{)}^{2/5}$. The closure assumptions, not the invariant alone, determine this exponent.

For a nonempty integer set with doubling constant at most $K$, Plünnecke-Ruzsa inequality bounds $|2A-2A|$ by $K^4|A|$. Embed the set modulo a sufficiently large auxiliary prime $q$, randomly dilate it, and select the more populated of two half-intervals of representatives. Differences of two pair sums on that half have absolute value less than $q$, so the lift preserves original relations. Every nonzero original difference is uniformly dilated among nonzero residues; avoiding all residues represented by nonzero multiples of $p$ of absolute value less than $q$ has positive probability when $p>4|2A-2A|$. Reduction modulo $p$ then yields a Freiman 2-isomorphism on the selected half.

For $|A+A|\le K|A|$, one can take $q=8|8A-8A|\le 8K^{16}|A|$. Embed in a much larger prime cyclic group and choose a dilation avoiding the residues of all nonzero multiples of $q$ of absolute value below that prime for every nonzero eightfold difference. A union bound ensures such a dilation. Retain a most-populated ninth-interval of representatives. Eight-term sums then have range shorter than the prime, and reduction modulo $q$ both preserves and reflects eight-term additive relations.

A nonempty finite integer set has a subset of the displayed size Freiman s-isomorphic to a subset of ${\mathbb{Z}}_N$. Embed in a sufficiently large auxiliary prime modulus and randomly dilate. Avoid the residues of every nonzero multiple of $N$ of absolute value less than that prime for all nonzero members of $kA-kA$; a union bound gives a successful dilation. Retain a most-populated one of $k+1$ short intervals of representatives. Its $k$-term sum differences have absolute value less than the auxiliary prime, so reduction modulo $N$ both preserves and reflects relations. Under $|kA-kA|\le C|A|$, this gives $N\le 4C|A|+1$.

From $\mu d{g}_i/d\mu =b_i{g}_i^3/(16{\pi }^2)$ and ${\alpha }_i=g_i^2/(4\pi )$, the chain rule gives $d{\alpha }_i/d\log \mu =b_i{\alpha }_i^2/(2\pi )$. Taking its reciprocal makes the differential equation linear, proving the displayed relation. It assumes a fixed set of active fields and constant one-loop coefficients between the two scales; mass thresholds require piecewise matching. A negative coefficient gives asymptotic freedom.

For $\beta (\lambda )=-{\beta }_0{\lambda }^3/(4\pi {)}^2-{\beta }_1{\lambda }^5/(4\pi {)}^4+O({\lambda }^7)$, define $y=(4\pi {)}^2/{\lambda }^2$ and $L=\log ({\mu }^2/{\Lambda }^2)$. Then $dy/dL={\beta }_0+{\beta }_1/y+O(y^{-2})$. In the asymptotically free regime ${\beta }_0>0$, successive substitution gives the displayed expansion. If the beta function is exactly truncated to two loops, then $y-\frac{{\beta }_1}{{\beta }_0}\log [(y+{\beta }_1/{\beta }_0)/{\beta }_0]={\beta }_{0}L$, after choosing the integration constant. Its next term is ${\beta }_1^2(\log L+1)/({\beta }_0^{3}L)$. Thus the generic remainder after the first two terms is not $O(1/L)$ when ${\beta }_1\ne 0$. Higher-loop terms change the constant coefficient of $1/L$, but not the forced $\log L/L$ term.

In the classical risk model with probability density function $3e^{-4x}+e^{-2x}/2$ and relative safety loading $3/5$, the claim mean is $5/16$ and $\lambda /c=2$. The convolution terms $A_a(u)={\int }_0^u\varphi (u-x)e^{-ax}dx$ satisfy $A_a^{\prime }=\varphi -a{A}_a$. Applying $(D+4)(D+2)$ to ${\varphi }^{\prime }=2\varphi -6A_4-A_2$ yields ${\varphi }^{(3)}+4{\varphi }^{\prime \prime }+3{\varphi }^{\prime }=0$. Its solution is fixed by $\varphi (\infty )=1$, $\varphi (0)=3/8$ and ${\varphi }^{\prime }(0)=3/4$, giving the displayed probability. The derivative condition comes from the original integral equation and excludes spurious solutions of the higher-order equation.

A row echelon form is in reduced row echelon form when every pivot element is one and is the only nonzero entry in its column.^[ref] This extra reduction displays each pivot unknown directly in terms of the free variables in a linear system. The zero matrix also satisfies the definition: it has no pivot elements.

Every matrix has exactly one reduced row echelon form under elementary row operations, with its size and column order held fixed.^[ref] Ordinary row echelon form is not unique: multiplying a nonzero row by two over the rational numbers keeps the staircase but changes the matrix. The reduced conditions remove that freedom.

For a fixed number of columns, each row space has a unique reduced matrix after zero rows are removed; at a fixed full size, the number of appended zero rows is also determined. Thus reduced row echelon form represents a vector subspace independently of the starting basis. This is the uniqueness used by Gaussian binomial coefficients to count vector subspaces over a finite field.

The fixed column order matters. Elementary column operations can change the row space, the kernel and the resulting reduced row echelon form. For instance, swapping the columns of $(12)$ over the rational numbers gives $(21)$, whose reduced row echelon form is $(11/2)$ instead of $(12)$. When solving a linear system, a column interchange also requires tracking the corresponding interchange of unknowns.

The rotational symmetry group of a cube has three group orbits on ordered pairs of faces: equal faces, opposite faces, and adjacent faces. Their sizes are respectively $6$, $6$ and $24$. Fixing one face leaves its cyclic group of four quarter-turns, which acts transitively on the four adjacent faces; this proves transitivity in the last orbit rather than merely counting its points.

Permuting the three pairs of opposite faces gives a group homomorphism from the rotational symmetry group of a cube to $S_3$. Its kernel consists of the identity and the half-turns about the three coordinate axes: these are precisely the diagonal sign matrices with determinant one. Thus it is a normal subgroup of order four, a Klein four-group.

For cube vertices $(\pm 1,\pm 1,\pm 1)$, the four vertices of coordinate product $+1$ and the four of product $-1$ form the two inscribed regular tetrahedra. A cube rotation is a signed permutation matrix of determinant one and maps each product class to one class. A quarter-turn about a coordinate axis exchanges the classes. The orbit of either tetrahedron therefore has size two, while the cube rotation group has order 24. The orbit-stabilizer theorem gives its setwise stabilizer subgroup order 12; this is the tetrahedron's proper rotation group.

A rotary encoder converts shaft rotation into a readout of angle or changes in angle. The PS-2120A uses interruptions of a light beam to encode shaft motion; its product specification gives 4000 divisions per revolution. That count is a resolution specification, not a guarantee of the precision of an inferred angular acceleration or moment of inertia. ^[ref]

Write the translation group action as $(A,B,C)\mapsto (e^{i{\theta }_1}A,e^{i{\theta }_2}B,e^{-i({\theta }_1+{\theta }_2)}C)$. Modulo lattice translations, the stabilizer subgroup of $(h,h,h)$, with nonzero real $h$, is the sixfold rotation group. Its fixed-point subspace of a group action is the real line $(a,a,a)$. The stabilizer subgroup of $(r,0,0)$, with nonzero real $r$, consists of the circle ${\theta }_1=0$ together with a half-turn; its fixed-point subspace of a group action is the real line $(a,0,0)$. The equivariant branching lemma therefore supplies generic branches of both axial types.

For the rotational hexagon amplitude equations, put $d={\nu }_2-{\nu }_1$ and $N={\nu }_1+2{\nu }_2$. A roll with $r^2=\mu /{\nu }_1$ has transverse eigenvalues $-d{r}^2\pm \sqrt{{\delta }^2{r}^4+r^2}$, each twice, radial eigenvalue $-2\mu$, and one neutral translation. A hexagon with $\mu =N{h}^2-h$ has real-amplitude eigenvalues $h-2N{h}^2$ and $-2h+2d{h}^2\pm 2i\sqrt{3}\delta h^2$; its imaginary-amplitude eigenvalues are $-3h,0,0$. These follow by diagonalizing the cyclic Jacobian matrix. Stability is understood modulo translations. If ${\nu }_2>{\nu }_1>0$ and $\delta \ne 0$, the upper positive hexagon branch reaches a Hopf bifurcation at $h=1/d$, $\mu =(2{\nu }_1+{\nu }_2)/d^2$.

The simplified moment prescription $q={\sigma }_z^2/({\sigma }_x^2+v_p^2)$, with $e=1-q$ and $\beta =1-{\sigma }_z^2/{\sigma }_x^2$, gives the displayed relation by solving for $v_p^2$. The prescription is an approximation, not a consequence of the tensor virial theorem for arbitrary oblate density profiles. For constant azimuthal streaming $v_{\mathrm{az}}$, the one-component streaming second moment is $v_p^2=v_{\mathrm{az}}^2/2$.

A Galerkin method retaining one stream function mode, two temperature modes and two transverse-velocity modes produces five coupled amplitudes. A useful normalization gives $a^{\prime }=-\sigma a+\sigma rb-{\sigma }^{2}qd$, $b^{\prime }=a-b-ac$, $c^{\prime }=h(-c+ab)$, $d^{\prime }=a-\sigma d-ae$, $e^{\prime }=-(4-h)\sigma e+had$. Here $\sigma >0$ is the Prandtl number, $0<h<4$, and $q$ measures squared rotation. The trivial equilibrium point has characteristic polynomial $(s+\sigma {)}^2(s+1)-\sigma r(s+\sigma )+{\sigma }^{2}q(s+1)$ in its three coupled linear modes; the remaining two modes decay. Stationary bifurcations and oscillatory onset meet at $q=(1+\sigma )/(1-\sigma )$, $r=2/(1-\sigma )$ when $\sigma <1$.

Let a binary cyclic code of length $n$ have defining zeros of a cyclic code $\alpha$ and ${\alpha }^3$, with $\alpha$ of multiplicative order $n$. A single error in position $j$ has error polynomial $X^j$ and syndromesThus $S_1\ne 0$ and $S_3=S_1^3$ are necessary for a single-error pattern. Search the $n$ distinct powers of $\alpha$ for $S_1$; if it is absent, this is not a single-error syndrome. Otherwise flip the unique coordinate $j$ and test membership in the full cyclic code, for example by divisibility by its entire generator polynomial of a cyclic code.

Checking only the two roots is sufficient only when they generate all defining checks, including their field conjugates. A cyclic code with additional defining roots requires those checks too. If the full membership test succeeds and the minimum Hamming distance is at least five, the corrected codeword is the unique codeword within two errors of the received word: two such codewords would be at Hamming distance at most four. The two-syndrome relation alone does not establish membership.

An amplification root of a multistep method is parasitic when it represents an additional numerical mode rather than the principal mode approximating the exact differential-equation flow. For a consistent method the principal root starts at one as the step tends to zero, while other roots can start elsewhere. A simple parasitic root on the unit circle is compatible with zero-stability, but its motion outside the circle for a negative test parameter can destroy absolute stability. Fixed-time convergence and all-time damping must be distinguished.

If stationary mass arrives at the same constant time rate as fuel is ejected, total rocket mass stays fixed. The rocket equation with stationary mass accretion is then $M_0\dot{v}+\alpha v=\alpha u$. For initial rest, speed approaches the relative exhaust speed exponentially with relaxation time $M_0/\alpha$. This is the regular equal-rate limit of the unequal-rate mass-power formula.