Constraint propagation repeatedly removes variable values incompatible with local consequences of a constraint satisfaction problem. The goal is to reduce the remaining search while preserving all genuine solutions. For $X<Y$ with domains $\{1,2\}$, enforcing support removes two from $X$ and one from $Y$, leaving the forced pair $(1,2)$. Arc consistency checks support across binary constraints; dedicated global-constraint propagators can reason about larger sets together. Reaching a propagation fixed point does not generally prove that the whole problem has a solution, because locally supported choices can still conflict globally.

The minimum remaining values heuristic chooses an unassigned variable with the smallest current legal domain during constraint search. It tries the most constrained choice first: a domain of size zero proves failure, and size one forces a value. If one variable has two remaining digits and another has seven, the first is selected, with a separate rule for ties. This can expose contradictions earlier but does not guarantee a minimum search tree. The heuristic depends on domains after the chosen propagation method, not simply on each variable's original domain size.

Forward checking in a constraint satisfaction problem updates the domains of unassigned variables after assigning one variable. Remove any remaining value immediately incompatible with the new assignment; if a domain becomes empty, backtrack. For $X\ne Y$ with both domains $\{1,2\}$, assigning $X=1$ removes one from the domain of $Y$. Basic forward checking only enforces constraints involving the latest assigned value; it does not generally propagate every interaction among still-unassigned variables. Stronger constraint propagation can therefore detect failures earlier at additional computational cost.

Kakuro is a numerical cross-sum puzzle on a grid. Each open cell holds a digit from one to nine; every specified horizontal or vertical run must sum to its clue without repeating a digit within that run. It is naturally a constraint satisfaction problem: cells are variables, digits are domains, and each run combines a sum constraint with an all-different constraint. This formulation supports general reasoning about feasible domains and search strategies without selecting or solving a particular puzzle.

A finite constraint satisfaction problem on a $9\times 9$ array. Each entry must be one of the integers $1,\dots ,9$, and every row, column, and designated $3\times 3$ box must contain each value once. Given entries constrain the possible completions; backtracking searches those completions.

An electron occupying an extended state in a conduction band. Its response to an applied electric field depends on its band group velocity, occupation and scattering. Merely counting such electrons does not by itself determine electrical conductivity.

Let $h_j$ be the probability of first success on attempt $j$, conditional on reaching that attempt. Then the chain rule for probabilities gives $P(K=j)=h_j{\prod }_{i<j}(1-h_i)$; no assumption of independent attempts is needed when these are the specified conditional probabilities. The chance of success by attempt $m$ is $1-{\prod }_{j=1}^m(1-h_j)$. Divide the truncated first moment by that probability to obtain the displayed conditional expectation, provided its denominator is positive. This is different from counting all unsuccessful cases as though they succeeded on the last permitted attempt.

X-ray tomography at a scale that can resolve small skeletal features without destroying a specimen. Segmentation and resolution constrain anatomical interpretation.

For a source at angular diameter distance $D_A$,The quantity $Y{D}_A^2$ measures volume-integrated electron pressure, hence thermal energy up to a known ideal-gas factor. The redshift independence of the thermal SZ distortion's surface brightness does not make $Y$ distance independent. Angular integration region, beam convolution, temperature structure and cluster geometry matter when comparing measurements and mass proxies.

The complex derivative exists when this limit has the same finite value for increments $h$ approaching zero from every complex direction. For $f=u+iv$, real and imaginary increments give the necessary Cauchy-Riemann equations. Existence of those partial derivatives at one point alone is not sufficient for complex differentiability at a point; continuous partial derivatives in a neighbourhood, together with the Cauchy-Riemann equations there, give a standard sufficient condition for $f$ to be a holomorphic function.

The Kahan summation algorithm computes a sum in floating-point arithmetic while carrying a correction for low-order information lost by successive additions. With accumulator $s$ and correction $c$ initially zero, process each input $x$ in this order:Every operation shown is rounded in the working floating-point representation. The new $c$ approximates the portion added too much or too little in the rounded $s+y$, so the next input subtracts it. For binary64 inputs $1,2^{-53},2^{-53}$ in that order, ordinary left-to-right summation loses both small increments, returning one; this algorithm recovers $1+2^{-52}$.

The correction substantially improves many long sums, but is not an exact summation method and does not remove ill-conditioning when large opposite-sign terms nearly cancel. Its operation order is essential: a compiler that rewrites $(t-s)-y$ as exact algebraic zero destroys the correction.^[ref]

For the receding edge of a circular emitter ring, the direct-projection model gives $1+z=(1-3r_g/r{)}^{-1/2}[1+\sqrt{r_g/(r-2r_g)}\sin i]$, with $r_g=GM/c^2$. Gravitational and transverse shifts combine with the line-of-sight Doppler factor. Mapping the distant inclination directly to a local photon direction neglects gravitational ray bending.

On a present FLRW spatial slice, a shell has volume $R_0^3{S}^2(\chi )d\chi d\Omega$. The radial light-ray relation gives $d\chi /dz=c/(R_{0}H)$, yielding the displayed expression in terms of transverse comoving distance. At emission the proper volume is smaller by $(1+z{)}^3$. For a conserved comoving population its proper density is greater by the same factor, so either epoch gives the same count.

For an ideal on-axis coherent circular-pupil system the field transfer cutoff is ${\nu }_c=\mathrm{NA}/\lambda$. Incoherent intensity transfer extends to $2\mathrm{NA}/\lambda$. Field and intensity transfer functions must be distinguished.

A persistence detector responds strongly to a sustained input and weakly to short isolated inputs. In an activating coherent feed-forward loop, an intermediate protein accumulates toward a threshold while the target also requires the direct input. Eliminating that intermediate by an instantaneous quasi-steady-state approximation removes its accumulation delay.

The derivative $V_0^{-1}dV/dT$ uses a fixed reference volume $V_0$. It differs from the instantaneous fractional coefficient $V^{-1}dV/dT$ by the factor $V/V_0$. The volume convention must be specified before comparing coefficients.

A complementary p-channel/n-channel transistor pair with joined gates as input and joined drains as output. The p-channel device pulls toward the positive supply and the n-channel device toward ground, producing logic inversion with ideally zero settled-state through-current.

Growth of liquid cloud droplets by collisions followed by merging. Differences in droplet fall speeds and collection efficiency affect the process. Increasing droplet number at fixed liquid-water content can reduce typical sizes and delay drizzle, but cloud mixing and water-content adjustments prevent a universal precipitation response.

Labroides dimidiatus is the bluestreak cleaner wrasse. Its interactions with visiting client fish are used to study cooperation and conflict, because feeding opportunities and the client’s benefit need not always coincide.

For a sphere with metric $a^2(d{\theta }^2+{\sin }^2\theta d{\varphi }^2)$, physical arc length $s$ gives $h={\sin }^2\theta d\varphi /ds$. The cyclic coordinate $\varphi$ proves conservation of $a^{2}h$, while unit-speed normalization givesThis azimuthal form requires $h\ne 0$. The solutions are great circles; meridians have $h=0$ and require another parameter.