Dielectric strength characterizes the electric field at dielectric breakdown under specified test conditions. In an ideal uniform gap, it sets a voltage scale $V_{\mathrm{bd}}\simeq E_{\mathrm{bd}}d$.^[ref] The parallel-plate capacitor model consequently gives the stored energy density scaleThis is a model scale, not an operating rating: fringing field of a capacitor make local electric fields differ from $V/d$, while leakage and dielectric loss spend some supplied energy as heat. Comparing usable capacitor energy therefore requires insulation and breakdown performance as well as permittivity.

The coordinate revealment of coordinate $i$ for a decision tree $T$ under input probability distribution $\mu$ isIt depends on the chosen decision tree and the probability distribution, not just on the Boolean function. Since no coordinate is queried twice on a graph path, indicator functions giveThe second equality uses linearity of expectation; it does not require independence of random variables or a product measure. The cited paper defines these inspection probabilities and their sum for product measures; the displayed indicator function argument extends the identity to any input probability distribution.^[ref]

For the three-bit majority decision tree under the discrete uniform distribution, $({\delta }_1,{\delta }_2,{\delta }_3)=(1,1,1/2)$, whose sum is $2.5$. Reading coordinate 3 first, then coordinate 1, and stopping on agreement gives the same majority function, depth and expected query cost, but coordinate revealments $(1,1/2,1)$. The asymmetry belongs to the chosen query order. Parity gives $(1,1,1)$ for every exact decision tree without repeated queries. If repeated queries were charged, inspection probabilities would count distinct coordinates; total query count would instead require expected multiplicities.

For a fixed decision tree $T$ and input probability distribution $\mu$, its expected query cost isUnder the discrete uniform distribution on the eight three-bit inputs, the three-bit majority decision tree hasThis is an exact average, not a fractional query made during one execution. It is also optimal among exact deterministic decision trees under this discrete uniform distribution: one observed bit never determines the majority function; whichever two distinct coordinates are inspected first, their values disagree with probability $1/2$, forcing a third query. In comparison, querying all three bits unconditionally has the same actual depth three but expected query cost three.

For an arbitrary input probability distribution, the same fixed three-bit majority decision tree gives ${\mathbb{E}}_{\mu }[q_T(X)]=2+{\mathrm{Pr}}_{\mu }(X_1\ne X_2)$. For three independent random variables, each a Bernoulli random variable with common one-probability $p$, this becomes $2+2p(1-p)$; the value $2.5$ depends on $p=1/2$. Averaging over inputs should also be distinguished from averaging over an algorithm's internal random choices at a fixed input.^[ref]

CDK1 activity and protein abundance are different observables. A total-CDK1 Western blot estimates protein amount under its calibration and loading assumptions. A phosphosite-specific Western blot asks about a particular CDK1 phosphorylation state. A histone H1 kinase assay asks how much substrate modification occurs under specified assay conditions. Any conversion between them needs a model and suitable controls.

An original counting example stipulates $100$ CDK1 molecules, with $60$ bound to cyclin B in each of two hypothetical samples. In sample A, $10$ bound molecules are activity-permissive and $50$ are inhibited; in sample B, $40$ are activity-permissive and $20$ are inhibited. The other $40$ are unbound in both samples. Total CDK1 and bound CDK1 agree, but activity-permissive counts differ fourfold. These are invented counts for bookkeeping, not measured biological populations.

If each activity-permissive molecule contributes the same reaction rate, substrate and ATP remain available, and the assay stays linear in time, a simple illustrative readout isHere $R$ is the recorded signal, $R_0$ is a matched blank signal, $N_{\mathrm{active}}$ is the activity-permissive count, $t$ the reaction interval, and $\alpha$ a common signal contribution per active molecule per unit time. The corrected signals in the stipulated samples have ratio $40/10=4$, although their total protein amounts agree. This is an assay accounting assumption, not an ordinary differential equation for the cell cycle. The no-added-cyclin B baseline in the inspected experiment can itself contain catalytic activity; it need not equal an enzyme-free blank $R_0$.

Substrate depletion, differing inhibitory conditions or a saturated detector can break the simple proportionality. Comparing samples therefore requires matched reaction intervals, substrate supply, loading and detector response, rather than assuming that brighter histone H1 labeling automatically means more total CDK1.

A histone H1 kinase assay measures protein kinase action on supplied histone H1, a protein substrate. When the transferred phosphate carries a radioactive isotope label, label incorporated into histone H1 reports catalytic action over the assay interval. It does not count CDK1 molecules, and a crude preparation can contain other protein kinases acting on histone H1. Attribution therefore needs controls.

A 2010 study prepared human HeLa S3 extracts after a double thymidine block, using swelling, a Dounce homogenizer, centrifugation, dialysis and concentration. Added recombinant cyclin B1 incubated for $20$ minutes.^[ref]

Aliquots received histone H1 and terminal-${}^{32}\mathrm{P}$-labeled ATP for a $15$-minute room-temperature reaction, stopped with Laemmli buffer. Dried SDS-PAGE gels exposed a phosphorimager screen; a BioRad Molecular Imager FX quantified labeling. No-added-cyclin B activity set the normalization baseline; RO-3306 reduced H1 activity approximately $85\%$. Companion Western blots monitored Tyr15 phosphorylation, with actin Western blot loading control.^[ref]

Mixed extracts lose compartment boundaries; inhibitor sensitivity supports a major CDK1 contribution, with residual signal.^[ref] Substrate choice and inhibitor specificity limit attribution. The cell-cycle hysteresis experiment supplies a separate history comparison with this kind of histone H1 readout; its dose thresholds should not be transferred to human biological cells.

A CDK1 phosphorylation state identifies modified amino acid residues. Different sites have opposite effects: in studied Xenopus laevis Cdc2, Thr14/Tyr15 are inhibitory, while Thr161 phosphorylation is activating. T denotes a threonine residue, Y a tyrosine residue, and numbers are protein primary structure positions. Do not assume this numbering for every species.^[ref]

The 1992 study supplies a useful separation of mechanisms: replacing Thr14, Tyr15 and Thr161 still permitted cyclin B binding, but replacing Thr161 prevented activation of histone H1 phosphorylation. Binding therefore did not suffice for catalytic activity in that preparation. Activating phosphorylation also occurred with catalytically inactive Cdc2, supporting a separate CDK-activating kinase rather than a requirement for intramolecular autophosphorylation.^[ref]

In this deliberately coarse classification, bound cyclin B, activating phosphorylation, and cleared inhibitory sites must coincide for the activity-permissive state. Removing inhibitory phosphate groups does not supply missing cyclin B or activating phosphorylation. Conversely, adding activating phosphorylation does not erase inhibitory modification. Actual preparations contain mixtures of states and additional regulators; this classification gives no numerical reaction rate.

A solid thermodynamic phase with a particular crystal structure, among distinct crystalline forms of the same chemical substance. Crystal polymorphism names the existence of these alternatives; a crystal polymorph names one of the forms.

In NIST's 2001 comparison, the Laser-Optimized Cryogenic Radiometer held its cavity near $5.4\mathrm{K}$ and controlled the heat sink separately. Opening the beam reduced heater power at fixed cavity temperature; an AC bridge read the temperature. Tests used stabilized, spatially filtered lasers at $488$, $514$ and $633\mathrm{nm}$, with horizontal input and a movable photodiode transfer detector in the cavity's optical plane. The paper contrasts this with the High Accuracy Cryogenic Radiometer's optical heating followed by two electrical heating cycles and interpolation.^[ref]

The two laboratories compared calibrations of the same transfer detectors, and checked their spatial response. Alignment differences and transported dust limited that comparison; its agreement did not prove universal equivalence. Its correction tables retain window transmission, cavity radiometric absorptance, alignment, electrical readout and optical-electrical heating non-equivalence. The heat sink was controlled, but §3 does not specify its numerical setpoint: the $5.0\mathrm{K}$ reference in the preceding example is stipulated.^[ref]

For a reproducible substitution measurement, record the beam's wavelength and entrance boundary, receiver and reference temperatures, heater terminal voltage and electric current, dark readings before and after illumination, and the settling rule. Check beam collection at the aperture, window transmission, radiometric absorptance, deposited lead heating, and sensitivity to beam position. Repeatability alone misses a stable correction error. Photometric calibration can subsequently use this radiant flux scale, but photometry still needs the appropriate spectral visual weighting; the cold receiver does not itself measure luminous flux.

A triangulation of a convex polygon divides a convex polygon into triangles using diagonals between its existing vertices of a polytope, with no diagonal crossings in the interior. For $m\ge 3$ vertices it uses $m-3$ diagonals and produces $m-2$ triangles. Fixing one boundary edge, its adjacent triangle separates two smaller polygon regions; summing over the possible third vertices of a polytope gives the Catalan recurrence. Thus the number of triangulations of a convex polygon is $C_{m-2}$, with $C_n$ the Catalan number. A quadrilateral has two choices and a pentagon has five.

For a parametric curve represented by fixed scalar functions $b_j$ and control points $P_j$ in Euclidean space, writeThe influence function of this handle is $b_i$: the resulting displacement vector is $\Delta C(t)=\tilde{C}(t)-C(t)=b_i(t)h$, and its norm is $|b_i(t)|\Vert h\Vert$. These are exact finite changes, not only a first-order estimate. Where $b_i$ is negative the displacement points opposite to $h$. Where $b_i(t)=0$, the curve is unchanged at that parameter.

For the cubic Bézier curve above, the Bernstein basis influence function is $b_{1,3}(t)=3t(1-t{)}^2$. Its derivative isIt increases up to $t=1/3$ and decreases thereafter on $[0,1]$. Consequently the largest displacement at corresponding parameters isFor $h=(0,1)$ it is $4/9$. This is a comparison at the same parameter. A geometric closest-distance comparison, as in a closest-point search on a subdivision curve, instead minimizes over another parameter:The closest parameter $s$ can differ from $t$, so $4/9$ is not automatically a maximum closest-distance separation of the two curves. Neither parameter is assumed to be arc length.

The support of a function $b_i$ is the closure of the parameter values where $b_i\ne 0$. It bounds where a nonzero handle move can act, but may include boundary points where the actual displacement is zero. Here the support of a function $b_{1,3}$ is all of $[0,1]$ relative to the parameter domain, while the endpoints are unaffected. In contrast, a B-spline of order $k$ has support within $[t_i,t_{i+k}]$ in its spline knot sequence, so its handle affects only that parameter range; the support and Gram bandwidth of B-splines describes the same locality in another application. Changing the spline knots or the basis along with the handle requires a different comparison.

When the basis functions form a partition of unity, ${\sum }_j{b}_j(t)=1$, each evaluation is an affine combination of the control points. Applying an affine map $T(x)=Ax+a$ to all handles givesThis is affine equivariance of a geometric basis, also called affine covariance: affine maps preserve affine combinations. In particular, translating every handle by $h$ translates the whole curve by $h$, whereas moving just one handle produces $b_i(t)h$. The Bernstein basis has this partition of unity property.^[ref] Nonnegative weights further make evaluations convex combinations, giving the convex hull bound illustrated by the control polygon; nonnegativity is not needed for affine covariance.

For a proof outline of the influence formula, subtract the two basis representations: every unchanged coefficient cancels, leaving $b_i(t)(P_i+h)-b_i(t)P_i=b_i(t)h$. The same subtraction with several moved handles gives $\Delta C(t)={\sum }_i{b}_i(t)h_i$. No claim about interpolation, closest-point search on a subdivision curve or endpoint motion follows until the actual basis values are examined.

An inclined plane tilted slowly from horizontal turns a coefficient of static friction into a critical angle. Assume a nonrotating block on a stationary, rigid, dry surface, with gravitational weight and the contact forces as its only forces. Take $0\le \theta <\pi /2$ to be the angle between the uphill surface direction and horizontal. Let ${\mathbf{e}}_t$ be a unit vector pointing uphill and ${\mathbf{e}}_n$ a perpendicular unit vector pointing outward from the surface. Resolving the gravitational weight givesThe angle between the downward vertical and the inward normal $-{\mathbf{e}}_n$ is also $\theta$. Thus the inward component uses cosine and the downhill component uses sine. These are components of one force, not two additional forces.

Before downhill contact slip, zero acceleration and Newton's second law requireThe required static friction points uphill. Substituting into the bound and dividing by the positive $mg\cos \theta$ givesThe tangent function increases on this range of angles, so the last admissible resting angle isThe inverse tangent takes a dimensionless quantity to an angle. At equality the ideal model still permits a limiting resting state; increasing $\theta$ further excludes it. At a smaller angle, $f_s/N=\tan \theta$ is the demand ratio, not the coefficient of static friction.^[ref]

For the stipulated $m=2\mathrm{kg}$, $g=9.8m/{\mathrm{s}}^2$ and ${\mu }_s=0.40$, the critical angle is approximately $21.8014^{\circ }$. At $\theta =15^{\circ }$, $N\simeq 18.932\mathrm{N}$ and $f_s\simeq 5.073\mathrm{N}$, comfortably below the bound ${\mu }_{s}N\simeq 7.573\mathrm{N}$. At $\theta =25^{\circ }$, maintaining rest would require $f_s\simeq 8.283\mathrm{N}$, but the bound is only $7.105\mathrm{N}$: rest is impossible. At ${\theta }_c$, $N\simeq 18.198\mathrm{N}$ and $f_s\simeq 7.279\mathrm{N}$. Notice that the limiting tangential force here is smaller than the horizontal $7.84\mathrm{N}$ limit because tilting reduces the normal force.

Cancellation of mass makes this relation useful: the ideal critical angle tests a contact coefficient without needing a calibrated force gauge. Doubling the block's mass doubles both demanded static friction and its bound, leaving ${\theta }_c$ unchanged if ${\mu }_s$ is unchanged. This is a testable model prediction. It need not survive a change in surface condition, a direction-dependent coefficient, appreciable deformation, or vibration.

The derivation also assumes continued contact and that sliding occurs before tipping or rolling without slipping. The resultant contact force must act within the supporting footprint so that the block can satisfy torque balance; a tall block may tip first. No extra tension, imposed tangential pull, or lift is included. In a slowly raised apparatus, quasistatic process means that motion of the board contributes negligible inertial forces while locating the threshold. Once downhill contact slip begins, a constant-velocity sliding angle would concern kinetic friction, not the onset of static friction.

A clique records pairwise relationships. If vertices represent sets and an edge means a nonempty intersection, a clique does not by itself guarantee an element common to every set. TakeThen $A\cap B=\{2\}$, $B\cap C=\{3\}$ and $C\cap A=\{1\}$, so their intersection graph is $K_3$. But $A\cap B\cap C=\varnothing$. The graph faithfully records all three pairwise intersections; the stronger claim of a single shared element requires additional hypotheses.

A maximum clique is a clique with the greatest possible number of vertices in the graph. Its size is the clique number. Every maximum clique is a maximal clique, since adding a vertex would produce a larger clique. A graph can have several maximum cliques; the word maximum specifies their common size, rather than uniqueness.

Leonhard Euler's 1751 correspondence already studied triangulations of a convex polygon and gave a closed formula for their counts. Johann Andreas von Segner supplied a combinatorial recurrence relation in a paper written in 1758. Eugène Charles Catalan's nineteenth-century work connected the formula to bracketed products. This history, documented in Igor Pak's account, shows how the same counting structure reappeared through different objects; the modern name alone does not establish discovery priority.^[ref]

A binary parenthesization specifies the order of binary operations on a fixed ordered list of operands, combining exactly two existing expressions at each step. It has a full binary tree as its expression structure: operands are leaves and operations are internal vertices. For four operands $a,b,c,d$, the five possibilities are $((ab)c)d$, $(a(bc))d$, $(ab)(cd)$, $a((bc)d)$, and $a(b(cd))$.

A binary parenthesization of $n+1$ operands contains $n$ binary operations. At the last operation, its left expression can contain $k$ operations and its right expression $n-1-k$. The Catalan recurrence therefore gives $C_n$ possible evaluation structures. The order of operands stays fixed; this is not a count of their permutations. Even for an associative operation whose result is unchanged, different structures can have different evaluation costs, as in the matrix-chain multiplication problem.^[ref]

The first-return decomposition of a Dyck path and the rule of product giveFor a given $k$, choose the inside path in $C_k$ ways and its suffix in $C_{n-1-k}$ ways. Different first-return locations give disjoint groups, so the rule of sum adds their counts. For $n=4$, the terms are $1\cdot 5+1\cdot 2+2\cdot 1+5\cdot 1=14$. Iterating the recurrence relation computes the counts without enumerating every full path.

The carpel region enclosing one or more ovules.

The connection between the stigma and ovary through which a pollen tube can grow.