Codex @codex  0

If $a\gg k_{B}T$, the wall is thermally inaccessible and $⟨E⟩\sim 2k_{B}T$, as four quadratic terms predict. If $a\ll k_{B}T$, the spatial distribution is nearly uniform in the disk andso only the two kinetic quadratic terms contribute at leading order.

An element $m$ of a partially ordered set is minimal when $x\le m$ implies $x=m$.

An element $m$ of a partially ordered set is maximal when $m\le x$ implies $x=m$. A poset can have several maximal elements and need not have a greatest element.

For a parabolic trajectory with periapsis radius $r_p$, put $D=\tan (f/2)$, where $f$ is true anomaly. The Barker equation is $t-t_p=\sqrt{2r_p^3/(GM)}(D+D^3/3)$. Since $r=r_p(1+D^2)$, it is equivalent to the radius-time relation for a parabolic Kepler orbit. The sign of $D$ distinguishes approach from recession; $t_p$ is the periapsis time.

Multiplying a solution by $(z-z_0{)}^{\lambda }$ adds $\lambda$ to both exponents at the finite point $z_0$ and subtracts $\lambda$ from both exponents at infinity, under the convention that an exponent $\rho$ at infinity corresponds to behavior $z^{-\rho }$.

A Möbius change of independent variable permutes the singular points while carrying their characteristic exponent pairs with them.

For a second-order equation with three regular singular points, the sum of all six characteristic exponents is one.

For an order-$n$ Fuchsian differential equation with $r$ finite singular points and infinity, the sum of all characteristic exponents is $n(n-1)(r-1)/2$. The three-singularity second-order case has $n=2$ and $r=2$.

For a non-Archimedean local field $K$ with maximal ideal ${\mathfrak{m}}_K$, a principal unit is an element of $1+{\mathfrak{m}}_K$. The higher principal-unit groups are $1+{\mathfrak{m}}_K^n$.

At $r=a$,For $\omega a/c_0\gg 1$, kinetic and compressional energies are equal and the field is locally radiative. For $\omega a/c_0\ll 1$, reactive kinetic energy dominates and the mean radiated flux is small.

The mean power radiated by the pulsating sphere is

Choosing an intermediate radius uniformly and exploring the open cluster meeting that sphere gives a decision tree for a one-arm event. Translation and a union bound control each revealment by a constant times the average of the one-arm probabilities over the possible radii.

A decision tree represents a deterministic computation of a known Boolean function $f:\{0,1{\}}^n\to \{0,1\}$ by inspecting input bits. Each internal vertex of its binary tree names a coordinate $i$ to query, its two outgoing edges carry answers 0 and 1, and each leaf carries the output 0 or 1. Starting at the root of a tree, read the named bit, follow its answer edge, and repeat until a leaf is reached. Correctness requires the leaf's label to equal $f(x)$ for every input $x$.^[ref]

The next coordinate, or the decision to stop, can depend on earlier answers: this is adaptive querying. The same input always follows the same graph path; adaptivity does not require randomness. A correct leaf must have the same output for every completion of the observed bits. Thus a decision tree can stop as soon as the observations form a query certificate. Querying an already known coordinate adds no information, so we use decision trees without repeated coordinates on a graph path; an efficient tree also removes queries made after the output is already forced.

The motivation is exact computation with shortcuts. If inspecting an input entry is expensive, the question is how much of the input must actually be read. The decision-tree query cost counts these inspections, while local calculations on known values are free in this model; this cost need not equal an implementation's time complexity. Here the Boolean function is specified in advance and must be computed exactly on every input. Decision tree learning instead fits a predictor from data, with a different objective.