The direct path and the indirect path of a coherent feed-forward loop have matching overall signs. The all-activating case with an AND rule can delay activation while allowing rapid removal of the production signal when the direct input disappears.

alpha-linolenic acid is an 18-carbon omega-3 fatty acid with three double bonds. Its presence in conventional plant oils is distinct from substantial synthesis of EPA or DHA.

eicosapentaenoic acid is a 20-carbon omega-3 fatty acid with five double bonds. Engineering its production requires coordinated desaturation, elongation and lipid-carrier handling.

docosahexaenoic acid is a 22-carbon omega-3 fatty acid with six double bonds. Production and storage can require additional steps beyond an EPA-producing pathway.

For a monic squarefree polynomial $f\in {\mathbb{F}}_q[X]$, the Berlekamp polynomial factorization algorithm computes the fixed space of the Frobenius map on $A={\mathbb{F}}_q[X]/(f)$:This is a vector space over ${\mathbb{F}}_q$, obtained as the kernel of a matrix minus the identity. If $f$ has $r$ distinct irreducible factors, the Chinese remainder theorem identifies $B$ with ${\mathbb{F}}_q^r$, so its dimension is $r$.

A nonconstant element of $B$ separates factors through $\gcd (f,g-a)$ for $a\in {\mathbb{F}}_q$. Repeating these splits produces the irreducible factors. Repeated factors require an initial squarefree factorization step; the fixed-space dimension statement assumes squarefreeness. The method converts polynomial factorization into linear algebra over a finite field.

A polynomial sieve enumerates irreducible polynomials by marking polynomials divisible by smaller irreducible polynomials, analogously to a number-theoretic sieve. Over a finite field ${\mathbb{F}}_q$, there are only $q^d$ monic polynomials of each polynomial degree $d$, so one can sieve all monic polynomials through a prescribed degree $N$.

Process monic polynomials in increasing polynomial degree. Each unmarked nonconstant polynomial is irreducible; mark its monic polynomial multiples through degree $N$. Every reducible polynomial of degree at most $N$ has an irreducible polynomial factor of degree at most $N/2$, so these factors suffice. For example, over the field with two elements, the degree-one factors $X$ and $X+1$ mark $X^2$, $X^2+X$ and $X^2+1=(X+1{)}^2$. The remaining monic quadratic $X^2+X+1$ is irreducible. This gives small defining polynomials for constructing finite fields as quotient rings.

For an air gap of thickness $d$, an extra internal round trip has length $2d/\cos \theta$, but consecutive transmitted rays emerge at different positions. Comparing them at the same outgoing wavefront subtracts $2d\tan \theta \sin \theta$, leaving optical path difference $2d\cos \theta$. Reflection-coating wave phases are separate from this geometric path calculation.

Spectral resolution and order identification are separate design constraints. An instrumental width narrower than a line separation does not prevent a different interference order from placing another wavelength at the same angle. Choose optical thickness so the source range fits a known order interval, sufficient finesse to resolve neighbouring lines, and an angular window or order-sorting filter to exclude unwanted orders. Material dispersion and the internal/external angle conversion must be calibrated.

Matrix stiffness describes resistance of an extracellular matrix to deformation under a specified loading geometry and timescale. It differs from pore size, ligand density and fibre alignment, although changing a matrix formulation can alter all of them.

A basement membrane is a specialized extracellular layer associated with the basal surface of an epithelium and other tissue interfaces. Breaching it is a mechanically and biologically distinct step from moving across a culture surface.

A porin–cytochrome assembly in Shewanella that couples a periplasm-facing multiheme component to an outward-facing cytochrome across the outer membrane.

An extracellular conductive structure. Composition and conduction mechanisms vary; a filament or pilus image alone does not establish conductivity.

For a smooth one-form $A$, the components ${\partial }_a{A}_b-{\partial }_b{A}_a$ transform as a covariant rank-two tensor. The non-tensorial second derivatives in the ordinary covector derivative under nonlinear coordinate changes are symmetric in $a,b$ and cancel. For a torsion-free connection the same components are ${\nabla }_a{A}_b-{\nabla }_b{A}_a$. This is the coordinate expression of $dA$, without choosing a metric.

An addition chain for a positive integer $k$ is $1=a_0<a_1<\cdots <a_r=k$, where each $a_t$ is the sum of two earlier entries, which may coincide. It computes $x^k$ in $r$ multiplications by reusing previously computed powers. For example, $1,2,3,6,12,15$ computes $x^{15}$ in five multiplications.

Repeated exponentiation with right association: ${}^{1}a=a$ and ${}^{h+1}a=a^{{}^{h}a}$. For example, ${}^{3}a=a^{a^a}$, rather than $(a^a{)}^a$. Computing its remainder modulo an integer often uses a chain of smaller exponent moduli; applying Euler's theorem requires checking its coprimality hypothesis at every level.

For a nonnegative integer $N$ and a positive integer $k$, the integer nth root is the unique integer $r\ge 0$ such that $r^k\le N<(r+1{)}^k$. Thus $\lfloor \sqrt[3]{30}\rfloor =3$.

Because $r\mapsto r^k$ is increasing on the nonnegative integers, binary search with exact comparisons computes the root without relying on rounded floating-point arithmetic. This is useful in perfect-power tests and exact bounds in integer factorization. Verifying the two inequalities also certifies an answer obtained from an approximate initial guess.

An $n$th root of $a$ is a solution of $x^n=a$, where $n$ is a positive integer. For $a\ge 0$ there is a unique nonnegative real root, denoted $\sqrt[n]{a}$. For odd $n$ each real number has exactly one real root; for even $n$, a positive input has two real solutions and a negative input has none.

For example, $\sqrt[4]{16}=2$ denotes the principal nonnegative root, although both $2$ and $-2$ solve $x^4=16$. Over the complex numbers, a nonzero $a$ has $n$ distinct roots, differing by $n$th roots of unity. Specifying the field and the principal-root convention prevents ambiguity.

A value of the form $a^4$, the product of four copies of $a$.