Independent link orientations make the canonical partition function $Z_1^N$, with the one-link integral defining the Langevin function. Differentiating its logarithm with respect to force gives $L=Nb\mathcal{L}(Fb/(k_{B}T))$. At high extension, $Nb-L\sim N{k}_{B}T/F$, so the force diverges inversely with remaining length deficit. This requires rigid links and excludes axial bond stretching.

If each link is restricted to a plane, $Z_1={\int }_0^{2\pi }{e}^{\xi \cos \theta }d\theta =2\pi I_0(\xi )$, with $\xi =Fb/(k_{B}T)$. Differentiating gives $L/(Nb)=I_1(\xi )/I_0(\xi )$, where $I_n$ are Modified Bessel functions of the first kind. The high-force angular Gaussian has $⟨{\theta }^2⟩\sim 1/\xi$, so $Nb-L\sim N{k}_{B}T/(2F)$, half the three-dimensional coefficient.

For an isotropic fixed-length step $b$, angular integration gives the characteristic function $\hat{\psi }(\mathbf{k})=\sin (kb)/(kb)$. Independence makes the characteristic function of the sum of $N$ steps its $N$th power. Since $\ln [\sin (kb)/(kb)]=-k^2{b}^2/6+O(k^4{b}^4)$, the central scaling $k=O((b\sqrt{N}{)}^{-1})$ gives $\hat{\Phi }\to \exp [-N{b}^2{k}^2/6]$. The inverse Fourier transform isThis is a density with respect to three-dimensional vector volume, not a radial density; the radial density is $4\pi R^2\Phi$. It has $⟨R^2⟩=N{b}^2$. The approximation holds on the central coil scale $R=O(b\sqrt{N})$, not near the fully stretched finite-length boundary $R=Nb$.

A three-dimensional ideal chain of $N$ independent segments of length $b$ has $⟨R^2⟩=N{b}^2=Lb$. The isotropic small-force susceptibility gives $⟨z⟩=F⟨R^2⟩/(3k_{B}T)$, so $k_s=3k_{B}T/(Lb)$. For a long worm-like chain, the statistical segment is $b=2l_p$. This stiffness describes entropic end-to-end extension, not axial stretching of the material backbone, whose spring constant is $EA/L$.

An iceberg moving toward the equator carries a thermal deficit into warmer water. Melting extracts heat there, equivalent to transport of heat toward the pole. For an annual number of similar bergs, multiply their individual iceberg melt heat budget by the rate per second. Freshwater effects on density stratification and ocean circulation are separate from this heat accounting.

Iceberg towing drag is the water resistance that a towing force must overcome to move an iceberg relative to the surrounding water. A quadratic model is $F_D=\frac{1}{2}{\rho }_w{C}_{D}A{U}^2$, where $U$ is the relative speed and $C_D$ must be defined using the same reference area $A$ as in its calibration.

For a form-drag coefficient, that area is commonly the submerged frontal area. A coefficient describing an equivalent basal resistance may instead use an immersed horizontal area. Interchanging the two conventions changes the force estimate. The $U^2$ dependence makes a modest increase in towing speed expensive, and currents can change resistance without changing the iceberg's speed over the ground.

For a constant wind force $\mathbf{F}$, still water, and linear water drag force $-m\gamma \mathbf{v}$, let $J\mathbf{v}=\hat{\mathbf{z}}\times \mathbf{v}$. The Coriolis parameter $f$ gives equilibrium ${\mathbf{v}}_{\infty }=(\gamma \mathbf{F}-fJ\mathbf{F})/[m({\gamma }^2+f^2)]$. The deviation evolves as $e^{-\gamma t}R(-ft)(\mathbf{v}(0)-{\mathbf{v}}_{\infty })$, a damped inertial oscillation. Actual drag is commonly quadratic, so this is a linear illustrative model rather than a universal iceberg speed law.

Surface water counted as ice needs warming but has already undergone melting. Its presence therefore biases a dry-ice estimate of latent heat of fusion downward. This is why drying the added ice is a quantitative control in ice-melting calorimetry, rather than cosmetic preparation. Let $m_a$ be the total added mass at $T_m$, of which a fraction $r$ is already liquid and $(1-r)$ remains solid. The correct constant-property balance isIf an analysis incorrectly treats all $m_a$ as solid and sets $Q_{\mathrm{env}}=0$, it obtainsThus $r=0.10$ gives a $10\%$ low estimate with no heat leak. Unaccounted incoming heat also lowers the estimate; outgoing heat raises it. These signs follow directly from the displayed energy balance. Conversely, dry ice initially below $T_m$ absorbs additional sensible heat; neglecting that term overestimates $L$. These are different biases and may partially cancel, so agreement with a reference value alone does not validate the controls.

For this model with $r=0$ and $Q_{\mathrm{env}}=0$, the balance predicts $T_f-T_m\simeq 8.829\mathrm{K}$, with $16.700\mathrm{kJ}$ consumed by fusion and $1.845\mathrm{kJ}$ by warming the melted water. At $r=0.10$ with the same zero leak, it predicts $T_f-T_m\simeq 10.369\mathrm{K}$ and $L_{\mathrm{app}}=300.6\mathrm{kJ}\mathrm{k}{\mathrm{g}}^{-1}$. A net incoming $1\mathrm{kJ}$ shifts $L_{\mathrm{app}}$ downward by a further $20\mathrm{kJ}\mathrm{k}{\mathrm{g}}^{-1}$ because $m_a=0.050\mathrm{kg}$. The warmer final water in the wet case is evidence of a smaller fusion budget, not a larger true $L$.

In a constant-thickness laminar boundary layer at an ablating glacier, approximate fluxes by $\kappa (T_{\infty }-T_i)/\delta$ and $D(C_{\infty }-C_i)/\delta$. Neglect solid diffusion and sensible heating relative to latent heat. With ablation speed $U>0$, solute balance gives $U(C_i-C_s)=D(C_{\infty }-C_i)/\delta$, so $C_i=C_s+(C_{\infty }-C_s)/(1+P)$, $P=U\delta /D$. The liquidus $T_i=T_m-\Gamma (C_i-C_s)$ and Stefan condition $UL/c_p=\kappa (T_{\infty }-T_i)/\delta$ then give the displayed law, where $A_T=LD/(c_p\kappa )$. Its positive root exists when the ocean is above its own freezing point. In the small-$P$ regime, interface salinity approaches ocean salinity; in the large-$P$ regime it approaches the ice composition.

Salt lowers the freezing temperature of water. Consequently ice can ablate in saline water below the pure-water melting temperature if the ocean is warmer than its own liquidus. Solute diffusion towards the interface sustains the freezing-point depression. In the diffusive glacier-ablation interface law, small compositional Péclet number makes interfacial salinity close to ocean salinity and gives $P\simeq [T_{\infty }-T_m+\Gamma (C_{\infty }-C_s)]/[LD/(c_p\kappa )+\Gamma (C_{\infty }-C_s)]$ near the no-ablation threshold. This is diffusion-assisted dissolution rather than a supply of heat above the pure-water melting point; latent heat must still be supplied to complete the phase change.

A hyperedge is a member of the edge family of a hypergraph. In an $r$-uniform hypergraph it is an $r$-element subset of the vertex set. For $r=2$ it is an ordinary edge of a graph. A simple hypergraph has no repeated hyperedges; a multihypergraph records multiplicities.

A hypergraph isomorphism is a bijection of the vertex sets such that a subset is a hyperedge of the first hypergraph if and only if its image is a hyperedge of the second. The condition preserves both edges and nonedges. In the two-uniform case it is the usual relation of isomorphic graphs.

A colouring is polychromatic with $r$ colours if every hypergraph edge contains a vertex of every colour. For $r\ge 2$, this is stronger than requiring every hypergraph edge to be nonmonochromatic. Under independent uniform colours, a $k$-element edge misses at least one of three colours with probability $3(2/3{)}^k-3(1/3{)}^k$. If each edge meets at most $m$ other edges, the edge-intersection dependency graph of events and the Lovász local lemma therefore give a polychromatic three-colouring whenever $e(m+1)[3(2/3{)}^k-3(1/3{)}^k]\le 1$.

An edge of a hypergraph is one of its specified subsets of the vertex set. In a uniform hypergraph all edges have the same cardinality; unlike an ordinary edge of a graph, an edge may contain more than two vertices.

A multipartite hypergraph has a specified partition of its vertex of a hypergraph set into parts, and every hypergraph edge meets each part in at most one vertex of a hypergraph. For an $r$-uniform hypergraph with $r$ parts, an hypergraph edge chooses exactly one vertex of a hypergraph from each part; its indicator is therefore a function on the Cartesian product of those parts. A quadripartite three-uniform hypergraph instead has four possible types of hypergraph edge, according to the omitted part. A choice of one vertex of a hypergraph from each of its four parts is a three-uniform tetrahedron exactly when all four triples are hypergraph edges. Specifying the parts makes both subset density and labelled counting precise.

For hypergraphs $F,H$, a labelled copy is an injective function $\varphi :V(F)\to V(H)$ taking every hypergraph edge of $F$ to an hypergraph edge of $H$. Specified vertex of a hypergraph classes may additionally require $\varphi (i)\in V_i$. The count is the sum, over these injective maps, of the product of the host hypergraph edge indicators. Without injectivity the same expression counts hypergraph homomorphisms. On a common host of size $n$, their counts differ by at most $\left(\genfrac{}{}{0ex}{}{|V(F)|}{2}\right)n^{|V(F)|-1}$: every noninjective map identifies at least one pair of abstract vertices of a hypergraph, each prescribed equality permits at most $n^{|V(F)|-1}$ maps, and the union bound completes the estimate. An induced copy additionally preserves nonedges, so its indicator product includes nonedge factors. The counting lemma for octahedrally quasirandom three-uniform hypergraphs estimates these labelled products when the requisite centered triple indicators have small box norm.

A vertex of a hypergraph $H=(V,E)$ is an element of its ground set $V$. Each hypergraph edge is a subset of $V$, and isolated vertices may belong to no edge. In a multipartite hypergraph, each vertex additionally lies in exactly one of the specified parts. This is the hypergraph analogue of a vertex of a graph, allowing edges of cardinality other than two.

A hypergraph is linear when two distinct hypergraph edges intersect in at most one vertex of a hypergraph. Equivalently, every pair of distinct vertices of a hypergraph has hypergraph codegree at most one. This restricts local overlap without bounding the hypergraph chromatic number: the random alteration method gives linear three-uniform hypergraphs of arbitrarily large hypergraph chromatic number.

A proper hypergraph colouring assigns colours to the vertices of a hypergraph so that no hypergraph edge is monochromatic. Each colour class is a hypergraph independent set. This is often called weak colouring, to distinguish it from requiring every pair of vertices in each edge to have different colours.

For a three-uniform hypergraph, the link of a vertex $v$ is the ordinary graph on the remaining vertices in which $xy$ is an edge precisely when $vxy$ is a hyperedge. Its edge count is the hypergraph vertex degree of $v$.