A crystal's interfacial free energy and attachment kinetics depend on the interface normal $\mathbf{n}$. The orientation-dependent energy $\gamma$ and mobility $M$ select directions even when bulk diffusion is isotropic. This supplements the transport mechanism of crystal dendrites; isotropic transport alone does not specify the number of preferred arms.

Effective permeability is a bulk permeability of a porous medium that reproduces the total Darcy flux through a heterogeneous sample under specified boundary conditions. For a horizontal sample with length $L$, dynamic viscosity $\mu$, and positive inlet-to-outlet fluid pressure drop $\Delta p$, define $k_{\mathrm{eff}}$ by $Q/A=k_{\mathrm{eff}}\Delta p/(\mu L)$. The description is useful when individual layers or passages are smaller than the scale of the calculation. It depends on direction, geometry and boundary conditions; it is not generally the arithmetic mean of local intrinsic permeabilities.

Layered porous permeability illustrates the mechanism: when every path must cross a resistant layer, successive hydraulic resistances add; when more permeable paths span the whole sample alongside less permeable ones, their discharges add. This is the same organizing idea as series and parallel resistors. For fixed fluid properties the corresponding hydraulic conductivities average in the same way.

A dimensionless reduction of a porous formation's intrinsic permeability of a porous medium for one fluid phase in multiphase flow. Its effective phase permeability is $K{k}_{ri}$, and its phase mobility is $k_{ri}/{\mu }_i$. It depends on saturation and pore-scale phase configuration; it is not the magnetic use of relative permeability.

For a fixed positive integer $n$, integer-valued periodic functions on $\mathbb{Z}$ with period $n$ are in bijection with ${\mathbb{Z}}^n$: record the values at $0,1,\dots ,n-1$ and repeat. This is a countable set. Allowing any positive integer period gives a countable union of countable sets, which is still countable.

On the rational numbers the answer differs even with period one. Every rational number has a unique representative modulo $\mathbb{Z}$ in $[0,1)\cap \mathbb{Q}$, and that representative set is a countably infinite set. Assigning arbitrary binary values to those representatives and extending periodically gives an injection from its power set into integer-valued period-one functions on $\mathbb{Q}$. Thus there are uncountably many. The difference is the number of residue classes to which values can be assigned independently.

A one-factorization partitions every edge of a graph into perfect matchings. Each matching uses every vertex exactly once. A total of synthemes is precisely a one-factorization of the complete graph on six points.

A minimum-weight perfect matching pairs every vertex exactly once while minimizing total edge weight. General weighted perfect matching has polynomial-time algorithms. In the Christofides algorithm, it corrects precisely the odd-degree vertices of a minimum spanning tree. Alternating edges of a cyclic order on an even number of vertices give two perfect matchings; the cheaper one costs at most half that cycle's cost.

If an infinite percolation cluster exists almost surely, the probability that a large square box intersects one tends to one. The four rotationally symmetric exterior-side arm events are increasing. By the Harris-FKG inequality, their common probability is at least $1-(1-P(D_N){)}^{1/4}$, where $D_N$ is their union. Thus a pair of specified opposite sides both has an infinite exterior arm with probability at least $1-2(1-P(D_N){)}^{1/4}$, tending to one. The rays start at a boundary graph vertex and immediately leave the graph vertex box.

The leading power $\beta$ of the percolation probability approached from above the percolation critical probability. It quantifies how the density of the infinite percolation cluster first becomes positive.

The exponent $\delta$ describes the tail of the critical cluster seen from a specified vertex of a graph. If the expected number of size-$s$ clusters per site scales as $s^{-\tau }$, weighting by cluster size gives $1/\delta =\tau -2$ when these scaling laws hold.

The critical cluster mass-radius scaling exponent $D_f$ describes clusters of mass roughly $r^{D_f}$ at radius $r$. The displayed relation is the below-upper-critical-dimension scaling prediction, not an identity from the definition. In the planar scaling description $D_f=91/48$.

The mean-field predictions model large clusters by branching processes. Rigorous results apply in specified high-dimensional or sufficiently spread-out regimes, using tools such as lace expansion and the percolation triangle condition. The full list involves different observables; the triangle condition alone should not be presented as proving every spatial exponent. With these exponents $2\beta +\gamma =3$, whereas $d\nu =d/2$, explaining the failure of naive hyperscaling relation above six.

A Pauli gate applies a Pauli matrix as a unitary operator to a qubit. The Pauli X gate, Pauli Y gate and Pauli Z gate are common correction operations in quantum teleportation.

An influence-function representer is a centered square-integrable function representing derivatives of a statistical functional along all admissible score functions. Representers may differ by a function orthogonal to the statistical tangent space. This pathwise definition is distinct from defining an influence function solely by point-mass contamination paths.

A refinement of a finite interval partition inserts additional points without removing original points. The union of two partitions is a common refinement. Refinement makes each subinterval smaller, increasing its infimum and decreasing its supremum; this proves Darboux sum refinement monotonicity.

Pad partitions with trailing zeros and compare their first unequal parts. A partition is larger in dictionary order on integer partitions when that first unequal part is larger. This is a total order, whereas dominance order on partitions compares every prefix sum and is generally partial. The row-column collision lemma links these two orders.

A horizontal run has generating function $R(z)=(1+z)/(1-z)$. Decomposing each walk into $H(NH{)}^k$ gives $A(z)=R(z)/(1-zR(z))=(1+z)/(1-2z-z^2)$. Thus $a_0=1,a_1=3$ and $a_n=2a_{n-1}+a_{n-2}$. The exponential growth rate is $1+\sqrt{2}$, furnishing a strict lower bound greater than two for the connective constant of all square-lattice self-avoiding walks.

Apply one CNOT gate from each input qubit to the same target. Their actions commute because controls remain unchanged and each contribution is added modulo two. This reversible circuit computes the parity bit with exactly one two-qubit gate per input, and its inverse is the same circuit. Unlike measuring the inputs to compute parity classically, the unitary preserves quantum superposition and can be uncomputed after phase application.

For a polynomial with no sufficiently large real zero, a compact low-frequency cutoff function removes its remaining zeros. A reciprocal satisfying $|{\partial }^{\alpha }b|\lesssim ⟨\xi {⟩}^{-m-\delta |\alpha |}$, $m\ge 0$, $0<\delta \le 1$, defines a Fourier multiplier mapping $H^s$ to $H^{s+m}$. Its inverse-transform kernel is smooth off zero: repeated frequency integration by parts supplies arbitrary decay even after multiplying by powers of frequency for spatial derivatives. Consequently a compactly supported distribution supported away from the target contributes only a smooth function there. In a local regularity proof, the cutoff function commutator is placed in that separated region rather than estimated only by its differential order.

For the arc-length meridian metric $d{s}^2+f(s{)}^{2}d{\theta }^2$, a unit-speed parallel has $\dot{s}=0$ and $\dot{\theta }=\pm 1/f(s_0)$. Its radial geodesic equation is satisfied exactly when $f\prime (s_0)=0$. Thus extrema of the radius, and any other stationary radii, give geodesic circles. If every parallel is geodesic, the surface is a circular cylinder.

For $\beta =16c_s^2/c^2$, the exterior sonic point of the barotropic spherical accretion equation lies outside $r_G=2GM/c^2$. Its mass density is ${\rho }_c={\rho }_{\infty }\exp [4/(1+\sqrt{1+\beta })-1/2]$. The selected smooth transonic accretion rate is $4\pi r_c^2{\rho }_c{c}_s$. Subsonic formal solutions are not assigned this rate without transonic selection.