Peg solitaire is a one-player finite board puzzle in which a peg jumps over an adjacent peg into an empty hole, and the jumped peg is removed. In a standard orthogonal version, the three holes must lie consecutively in one row or column. Board shape, initial occupied holes and the desired final configuration are part of the problem specification.

Every move decreases the number of pegs by exactly one, so a play starting with $n$ pegs has at most $n-1$ moves if at least one peg remains. A solution reducing to a single peg must have exactly $n-1$ moves. This is a counting necessity, not a guarantee of solvability.

The puzzle illustrates state-space search: a position is a subset of occupied holes, and directed edges are legal jumps. Backtracking explores possible continuations, while board symmetries can identify equivalent states. Algebraic invariants and monotone weight functions can prove some target configurations unreachable without enumerating every play.

A pseudobulge is a central stellar concentration in a disk galaxy whose structure and dynamics indicate growth through internal disk evolution rather than only rapid merger-driven assembly. A central brightness excess alone does not establish this origin.

Disk-like flattening, appreciable ordered rotation, nuclear spiral arms, galactic bars and ongoing star formation provide complementary diagnostics. A bar can torque gas and move it inward, feeding central star formation over a long timescale. Individual diagnostics are imperfect, so classifications combine imaging and kinematics instead of equating every low-index brightness profile with a unique history.^[ref]

An opioid receptor is a G protein-coupled receptor recognizing opioid ligands, including endogenous peptides and exogenous drugs. Major receptor classes differ in distribution and ligand responses. Their signalling commonly engages inhibitory G proteins, linking receptor activation to changes in cyclic-AMP production and ion-channel activity. ^[ref]

The same bound ligand need not produce identical effects in every assay. Receptor abundance, coupling efficiency and downstream amplification affect observed efficacy. Experiments comparing candidate opioid agonists showed why low intrinsic G-protein efficacy can help explain apparently favourable signalling profiles, rather than assuming that every difference establishes a uniquely selective pathway. ^[ref]

A transcendental function is an analytic function that is not an algebraic function. Explicitly, on a domain $U$, there is no nonzero polynomial $P(z,w)$ with complex coefficients for whichA rational function is algebraic, and a local branch of $\sqrt{z}$ is algebraic because it satisfies $w^2-z=0$. The exponential function is transcendental. This concerns a relation between functions, rather than the arithmetic nature of a single value: $e^0=1$ even though $z\mapsto e^z$ is transcendental.

Here is a direct proof for the exponential function. Suppose ${\sum }_{k=0}^m{p}_k(z)e^{kz}=0$ on $U$, with polynomials $p_k$ and $p_m\ne 0$. The expression is an entire function, so the identity theorem for holomorphic functions extends the identity to all complex $z$. For positive real $x$, divide by $e^{mx}$:By exponential domination of polynomials, the right side tends to zero as $x\to \infty$. A nonzero polynomial cannot tend to zero along the positive real axis, giving a contradiction. The case $m=0$ is already impossible because $p_0$ would vanish identically. Thus no such algebraic relation exists.

A pointwise operation on functions applies an operation to their values at the same input. If $f,g:X\to Y$ and $\star :Y\times Y\to Y$ is a binary operation, the induced operation on the function space is defined byThe common domain of a function makes the two inputs available at each $x$; the closure of the operation in the codomain makes the resulting value an element of $Y$ again.

For real-valued functions, ordinary addition and multiplication induce pointwise addition and pointwise multiplication. If $f(x)=x+1$ and $g(x)=x^2$, then $(f+g)(x)=x^2+x+1$ and $(fg)(x)=x^2(x+1)$. Function composition instead feeds one output into another rule: $(f\circ g)(x)=x^2+1$ in this example.

Algebraic identities pass to the pointwise construction by evaluation. For instance, if the operation on $Y$ is associative, then $((f\star g)\star h)(x)=(f(x)\star g(x))\star h(x)=f(x)\star (g(x)\star h(x))$ for every $x$, proving equality of the two functions. This explains how algebraic structure on values induces structure on a function space.

An algebraic function is a function whose values satisfy a nonzero polynomial relation $P(z,f(z))=0$. In complex analysis one usually studies a local holomorphic branch of this relation; the relation itself need not specify one globally single-valued function.

For example, $w^2-z=0$ gives two square root branches away from zero. On a slit domain, one can choose a holomorphic branch, but following it around zero exchanges the two values. This is why Riemann surfaces arise naturally when studying an algebraic function. Every rational function $f=p/q$ is an algebraic function, since $q(z)f(z)-p(z)=0$ wherever $q\ne 0$. In contrast, the exponential function is a transcendental function.

Nonlinearity is failure of the linearity conditions appropriate to the objects being studied. For a function $f:V\to W$ between vector spaces over the same field, being a linear map meansfor all $u,v\in V$ and all scalars $a,b$. A function is nonlinear in this sense if even one permitted choice violates the identity. The spaces and their operations are therefore part of the claim.^[ref]

For $f:\mathbb{R}\to \mathbb{R}$ with $f(x)=x^2$, choose $u=v=1$ and $a=b=1$. ThenThe extra term in $(u+v{)}^2=u^2+2uv+v^2$ explains the failure of superposition. Doubling an input also multiplies its squared output by four, rather than two.

A straight-line graph alone does not establish linearity in linear algebra. The affine map $g(x)=2x+3$ has a straight-line graph but $g(0)=3\ne 0$, whereas every linear map sends zero to zero. Its translated change $g(x+h)-g(x)=2h$ is linear in the increment $h$. This distinction matters when a physical instrument has an offset or a model is expressed relative to a nonzero operating point.

A nonlinear function can still have a useful local linear approximation. For the same square function,The derivative at3 gives the linear increment $6h$, while the exact omitted term is $h^2$. At $h=0.01$, the actual change is0.0601 and the linear prediction is0.06. At $h=1$, the actual change is7 and the prediction is6. Local accuracy over small increments does not turn the original function into a linear map. It states that the nonlinear remainder is small on a specified scale.

Unimodality, in the single-maximum convention, means that a real-valued function rises toward one mode or plateau and then falls away. More precisely, for a function $f$ on an interval, there is a point $m$ such that $f$ is nondecreasing to the left of $m$ and nonincreasing to its right. These inequalities are weak: a flat top is allowed, and more than one point may achieve the maximum.

For an original example,is zero throughout $[-1,1]$ and decreases as one moves outward beyond that plateau. It is unimodal despite lacking a unique maximizing point. In contrast, two separated peaks with a genuine dip between them violate the rise-then-fall requirement.

A useful characterization is that a unimodal function in this convention has interval-shaped superlevel sets $\{x:f(x)\ge c\}$. For a function attaining its maximum, the converse holds too: if all those sets are intervals, a decline followed by a later rise on the same side of a maximizer would create a disconnected superlevel set. In one dimension this is the quasiconcave function viewpoint. Boyd and Vandenberghe define quasiconcavity through convex superlevel sets.^[ref]

The convention must be stated. In minimization, unimodal is also used for a function that first decreases and then increases; that corresponds to a quasiconvex function and interval-shaped sublevel sets. A single minimum and a single maximum are opposite shape conditions.

Unimodality also differs from concavity. The function $g(x)=e^{-x^2}$ has derivative $-2x{e}^{-x^2}$, so it rises up to zero and falls afterward. However,so it is not a concave function on the whole real line. Unimodality constrains the ordering of levels rather than the sign of curvature everywhere.

For a probability density, this shape defines one common meaning of a unimodal distribution. Adding symmetry around zero strengthens the conclusion: the centred interval maximizes mass for an even unimodal density lemma shows why a fixed-width observation window collects most probability when centered on the mode.

A quasiconcave function is a real-valued function on a convex set whose every superlevel set is convex. Equivalently, $-f$ is a quasiconvex function, andThe definition allows empty or whole-domain superlevel sets. Boyd and Vandenberghe state quasiconcavity as the superlevel-set counterpart of quasiconvexity.^[ref]

For the equivalence, choose the level $\alpha =\min \{f(x),f(y)\}$. Both endpoints belong to the corresponding superlevel set, and its convexity puts the connecting segment there too. The reverse argument works for any two points whose values are at least a common level.

An original example separates quasiconcavity from concavity:For $0<\alpha \le 1$, its superlevel set isIt is all of $\mathbb{R}$ for $\alpha \le 0$ and empty for $\alpha >1$. These sets are convex intervals. However,is positive when $|x|>1/\sqrt{3}$, so $f$ is not a concave function on the real line.

The property expresses the absence of a dip below both endpoint values along a segment. It does not require the stronger chord inequality that defines concavity. A strictly increasing transformation preserves it because the ordering of levels is unchanged.

In one dimension, a quasiconcave function attaining its maximum has the single-maximum form of unimodality, including possible plateaus. For a unimodal distribution with a density, this controls the shape of high-density regions. Adding evenness yields the probability-concentration result in centred interval maximizes mass for an even unimodal density. Symmetry and quasiconcavity are separate assumptions; neither should be inferred merely from a plotted central bump.

A quasiconvex function is a real-valued function on a convex set whose every sublevel set is convex. If the domain is $D$, this meansis a convex set for every real $\alpha$, including levels for which the set is empty. Equivalently,Boyd and Vandenberghe give these level-set and segment characterizations.^[ref]

To see their equivalence, set $\alpha =\max \{f(x),f(y)\}$. Convexity of that sublevel set puts every convex combination of $x$ and $y$ inside it, proving the inequality. Conversely, if two points lie below the same level, the inequality keeps their connecting segment below that level.

Quasiconvexity is weaker than convexity. An original example is $f(x)=\sqrt{|x|}$ on $\mathbb{R}$. For $\alpha \ge 0$, its sublevel set is $[-{\alpha }^2,{\alpha }^2]$; for $\alpha <0$, it is empty. All are convex, butwhich violates the convex-function inequality. Quasiconvexity limits the height along a segment by the larger endpoint value, rather than by the line joining endpoint values.

A strictly increasing transformation preserves the sublevel ordering and hence quasiconvexity. This can be useful when a complicated objective has simple level sets. Quasiconvex optimization exploits those sets through feasibility tests at trial objective values; it need not treat the objective itself as a convex function.

In one dimension the shape corresponds to the single-minimum convention of unimodality. Flat portions require care: the step function equal to0 for $x\le 0$ and1 for $x>0$ is quasiconvex. Every point strictly to the right of zero is a non-strict local minimizer on a small flat neighborhood, yet its value is not globally minimal. Quasiconvexity alone therefore does not justify replacing every local minimum by a global one.

A spectral envelope is a smooth description of the broad shape of a frequency spectrum, separating slowly varying magnitude structure from fine spectral peaks. It is an estimated representation, not a uniquely defined extra part of the Fourier transform. Smoothing scale, whether one smooths linear magnitude or log magnitude, and the estimation method all matter.^[ref]

For a periodic signal passed through a linear time-invariant system, the harmonic line at $k{f}_0$ has amplitude proportional to $|X_{k}H(k{f}_0)|$. The excitation sets the line spacing $f_0$, while the filter's frequency response shapes their broad heights. Changing the fundamental frequency can therefore move the lines without moving the filter's resonant peaks. A spectral envelope aims to capture that broad shape; overly aggressive smoothing can erase meaningful resonances, while insufficient smoothing retains the individual harmonics.

The minimum free-block size is the smallest extent that an allocator's representation can retain as an independent free record. It depends on where the allocator stores a region's size, links and other metadata, as well as memory alignment. A region may contain unused bytes yet be too short to enter the free list. OSTEP demonstrates why allocator metadata must be counted: free records can be embedded inside the free regions themselves.^[ref]

For a hypothetical allocator, let a free record need an8-byte size field and two8-byte links. Its raw metadata requires24 bytes. If all block lengths are multiples of16 bytes, its minimum independently representable size isThe exact fields and sizes are illustrative. An allocator with separate metadata, a singly linked record or another block granularity can have another minimum.

Suppose the same allocator uses an8-byte allocated-block header. An8-byte payload plus that header would occupy16 bytes before enforcing the minimum. Reserving32 bytes ensures that this block can later become an independent free record. Extra allocation space of this kind contributes to internal fragmentation. The allocator might instead use a distinct representation for tiny blocks, so the formula is a design constraint for the stated representation rather than a universal allocation rule.

A proposed split also needs to respect the minimum. Taking80 bytes from a96-byte extent leaves16 bytes, an unsplittable free-block remainder under this layout. Giving the caller the full96-byte extent avoids making an invalid free record but consumes extra storage. Taking32 bytes would leave64, which can be retained. Memory block coalescing can later join adjacent returned extents, but the allocator must have a valid way to represent each extent until that happens.