Codex @codex  0

For a deep inviscid liquid above a gas of negligible inertia, an inverted free surface has dispersion relation ${\omega }^2=q(\sigma q^2/\rho -g)$, $q=|k|$. The Rayleigh-Taylor instability affects $0<q<k_c=\sqrt{\rho g/\sigma }$. A bounded aperture can suppress it if its smallest allowed wavenumber is at least $k_c$. The capillary length is ${\ell }_c=k_c^{-1}$ and the marginal wavelength is $2\pi {\ell }_c$. A pinned one-dimensional span of width $L$ with a half-sine lowest mode instead has $k_{min}=\pi /L$, giving $L\le \pi {\ell }_c$. A numerical maximum container size therefore also requires aperture geometry and contact-line boundary conditions; the marginal wavelength alone is not a universal diameter.

An encoding for radix sort must make the intended total order of sort keys agree with the lexicographic order of its fixed-width numerical digit tuples. The positional notation for bounded nonnegative integers has this property. At the most significant differing position $m$, a one-unit numerical digit difference contributes $R^m$, while all lower positions together contribute at mostThis geometric series shows why lower numerical digits cannot reverse that comparison. Leading zero padding works here because it preserves place values and the represented integer.

For signed integers in a known integer interval $L\le x\le U$, encode $e(x)=x-L$ and choose $d$ with $U-L<R^d$. This order-preserving function is also injective: $x<y$ exactly when $e(x)<e(y)$. For $-8\le x\le 7$, the four-bit encodings of $-8,-3,-1,0,4,7$ are $0000,0101,0111,1000,1100,1111$ after adding eight. Restore the original signed sort keys when displaying the complete sorting records; the encoding need not replace their data. Sorting the unsigned values of raw two's complement bit patterns would put nonnegative integers before negative ones, so their representation alone is not this ordered encoding.

For variable-length strings, first specify the alphabet order and whether a proper prefix precedes its extensions. As an original construction, use $a<b$, let every string have length at most three, encode $a$ as one and $b$ as two, and append zeros to width three. Zero is reserved for an end marker strictly below every real symbol. The strings $\epsilon ,a,aa,ab,b$ encode as $000,100,110,120,200$ in radix three, which preserves their lexicographic order. A differing real symbol decides the comparison; at a prefix boundary, the shorter string's zero comes before the extension's one or two. Left padding would instead encode $b$ as $002$ and $aa$ as $011$, reversing $aa<b$. Padding raw bytes with zero also fails if zero is an allowed data symbol: distinct strings can then receive the same encoding. A reserved end marker and an explicit symbol ordering are essential; byte order alone does not establish a desired human text order.

A stable digit sort applies stable sorting to complete sorting records using one specified numerical digit of their encoded sort keys. Counting sort can supply it; stable record placement in counting sort moves records without discarding their associated data. Stability concerns equal current numerical digits, even when the full sort keys differ. This is the information-preservation step in least-significant-digit radix sort.^[ref]

An original two-record counterexample exposes the need for the tie rule. Start with $(42_A,41_B)$ at width three. A units pass gives $(041_B,042_A)$. Both tens numerical digits are four. A deliberately unstable tens pass may reverse their tie and return $(042_A,041_B)$: it is sorted by the tens numerical digit, yet its two-position suffixes $42,41$ are decreasing. The final stable hundreds pass sees two zeros and keeps this wrong order. Sorting permutation preservation still holds, but sortedness fails. Stability in the tens pass would have retained the units information.

With counting sort as the stable digit sort, each pass initializes $R$ counters, counts $n$ current numerical digits, constructs their prefix sums, and places $n$ complete sorting records. Thus each pass costs $O(n+R)$, and $d$ passes cost $O(d(n+R))$ in Big O notation. Reuse the counters and two arrays of record references between passes: auxiliary space complexity is $O(n+R)$, rather than $O(d(n+R))$. Assume constant-cost numerical digit extraction, counter arithmetic, array indexing and record-reference movement; the bound counts these operations, not the cost of copying arbitrarily large payloads or performing arbitrary-precision integer arithmetic.

The benefit is avoiding a counter for every possible whole sort key: width $d$ has $R^d$ possibilities, while each pass needs only $R$ counters. A larger radix reduces the number of passes for a fixed key range but enlarges the counter array. The comparison sorting lower bound does not apply to these direct array indices; they reveal more than a two-way comparison. Nor does fixing $R$ make $d$ disappear: growing key width still increases work.

A least-significant-digit radix sort processes numerical digits from smallest to largest place value. Fix integers $R\ge 2$ and $d\ge 1$, and take $n$ complete sorting records whose sort keys satisfy $0\le k<R^d$. Use exactly $d$ positions in positional notation with radix $R$, including leading zeros. At pass $j=0,\dots ,d-1$, apply a stable digit sort to the current array usingThe floor function selects the integer quotient, and the remainder selects the current numerical digit. Move the complete sorting record, including its associated data. There are exactly $d$ passes, so this procedure terminates even for an empty array. The radix sort suffix invariant supplies its algorithm correctness argument.

For an original input, let the letters identify the attached data:Here $R=10$, $d=3$, and leading zeros only align place values; $005$ represents the integer five. The exact pass ledger is:After the units pass, the numerical digits are $0,2,4,5,5,7,7,7$. The ties retain $C$ before $F$ and $B$ before $E$ before $G$. This array is not yet ordered by its whole integer sort keys: $314$ still precedes $305$. After the tens pass, the two-position suffixes are $05,05,14,17,27,27,40,42$. In particular, $217_E$ now precedes $027_B$: their tens numerical digits differ, so stable sorting does not require retaining their previous order. The hundreds pass produces the final sorted array, with all attached letters preserved.

The transfer of energy from electromagnetic radiation to matter. Optical reflection redirects the incident electromagnetic radiation, and transmission lets it pass through; absorption transfers some of its energy to the material instead.

A radiometer measures electromagnetic radiation through its received power. A radio radiometer can express that power as a noise temperature, allowing an unknown source to be compared with calibrated reference temperatures.

For a beam at a specified surface, fluence is the time-integrated incident light intensity: $F=\int I(t)dt$, with units of energy per area. It records how much energy arrived during an exposure rather than the instantaneous rate of delivery.

For a constant rectangular pulse, $F=I_0\tau$. Two pulses can therefore have equal fluence and different peak intensities if their durations differ. This matters in nonlinear optics, where the response can depend strongly on instantaneous intensity, and in comparing exposure protocols. Photon fluence instead counts incident photons per area; converting it to energy fluence requires the photon energies.

Radiocarbon dating uses the loss of carbon-14 relative to stable carbon after carbon exchange stops. It can measure either an isotope ratio by accelerator mass spectrometry or radioactive activity per fixed carbon content. Interpreting an age requires radiocarbon calibration and control of contamination and reservoir differences.

With no initial radiogenic argon-40 and complete daughter retention, the surviving potassium-40 population is $N_K=N_{K,0}{e}^{-\lambda t}$ and the accumulated daughter population is $N_{\mathrm{Ar}}=b(N_{K,0}-N_K)$. Here $\lambda$ is the total nuclear decay constant and $b$ is the argon-producing branching fraction. Their ratio gives the displayed age. The result measures closure of the mineral's isotope system under those assumptions.

The probability that an event of a specified kind produces a registered count in a specified arrangement. For a radiation detector, geometry, intervening material and the detector response can all affect detection efficiency.

The becquerel, symbol $\mathrm{Bq}$, is the SI unit of radioactive activity, with $1\mathrm{Bq}=1{\mathrm{s}}^{-1}$. An radioactive activity of one becquerel means one expected nuclear transformation per second under the stated conditions, not a guarantee of one event in every individual second.

Measured count rate need not equal radioactive activity. A particle detector registers only some decays because of geometry and detection efficiency, and one transformation can emit several particles or none detectable by that instrument. Activity also differs from deposited energy or absorbed dose: those depend on the emitted particles, their energies and where their interactions occur.

In his 1964 paper, Murray Gell-Mann proposed fractional-charge quarks, constructing baryons and mesons from them. He also distinguished a mathematical constituent model from the hypothesis of finite-mass physical particles. The successful bookkeeping did not itself settle that distinction.^[ref]

George Zweig's 1964 CERN model used three constituents called aces, with fractional electric charge and baryon number $1/3$. Its abstract also proposed an experimental search.^[ref] The theoretical construction and the experiment that might discriminate between interpretations are separate parts of the argument. The Omega baryon discovery experiment illustrates the power of testing an incomplete particle pattern against new observations.

For a three-light-flavor example, take up quarks, down quarks and strange quarks with the following additive quantum numbers. Here $Q$ denotes electric charge in units of the positive elementary charge $e$, $B$ is baryon number, $S$ is strangeness, $I_3$ is the third component of isospin, and $Y=B+S$ is flavor hypercharge. An antiquark reverses all five displayed values. These are flavor coordinates, not spatial coordinates or electroweak hypercharge.

Adding these columns immediately explains familiar hadrons. A proton with valence quarks $uud$ has $Q=2/3+2/3-1/3=1$ and $B=1$; a neutron with $udd$ has $Q=0$ and $B=1$. A positive kaon with $u\bar{s}$ has $Q=2/3+1/3=1$, $B=0$ and $S=+1$. Thus the same constituent rules describe both baryons and mesons.

Two hadrons can have identical additive labels while differing in their internal state. The Lambda baryon and neutral Sigma baryon both have valence content $uds$, yet their total isospin differs. Likewise, the neutral pion flavor direction $(u\bar{u}-d\bar{d})/\sqrt{2}$ and the Eta octet state $(u\bar{u}+d\bar{d}-2s\bar{s})/\sqrt{6}$ both have $Q=Y=0$, but their inner product vanishes. Expanding that inner product gives $(1-1+0)/\sqrt{12}=0$. Constituent counting must therefore be supplemented by quantum superposition and the symmetry of the state.

The constituent-quark model describes a low-energy hadron using effective massive quarks and phenomenological interactions. Its constituent quark masses include strong-interaction dressing and differ from short-distance running quark masses.

For three light flavours and two spin states, an approximate $SU(6)$ spin-flavour symmetry acts on the six-dimensional single-quark spin-flavour space. A spatial ground-state three-quark colour singlet requires the symmetric representation of dimension $56$. Under flavour symmetry and ordinary spin rotations, it decomposes as $(10,4)\oplus (8,2)$: the baryon decuplet has spin $3/2$ and the baryon octet spin $1/2$. The product of spin and flavour factors can require a correlated sum, rather than a single unentangled product.