Locally compact group 2026-10-14
A locally compact group is a topological group whose underlying space is a locally compact space. In Haar measure and Fourier transform theory one normally also assumes it is a Hausdorff space. Local compactness supplies compact neighbourhoods, not just compact sets which algebraically generate the group.
Compactly generated group 2026-10-14
A topological group is compactly generated in the algebraic sense when a compact subset generates its underlying group. Adjoining its inverse and the identity gives a compact symmetric generating set , and is a sigma-compact space. Some conventions restrict the term to locally compact groups or require a compact generating neighbourhood; those stronger conventions supply local compactness. Compact generation by an arbitrary compact subset alone does not.
Open subgroup 2026-10-14
An open subgroup is also closed, since its complement is the union of its other open cosets. Conversely a closed subgroup need not be open, as shows.
Closed subgroup 2026-10-14
A closed subgroup is a subgroup which is a closed set in the ambient topology. It is a topological group in its subspace topology, but need not be an open subgroup.
The additive subgroup of integers is a closed subgroup: every noninteger lies in an open interval avoiding . It is also a discrete subgroup, since . Nevertheless it is not an open subgroup of : every open interval containing an integer contains nonintegers too. Thus having a discrete topology internally says nothing about being an open set in the ambient topology.
This is a distance function satisfying the displayed identity, rather than a Riemannian metric tensor. When it induces the group's given topology, it is a compatible left-invariant group metric. Left translations are isometries.
Right translations are isometries for a right-invariant group metric. Given a compatible left-invariant group metric , the formula defines a compatible right-invariant group metric, since inversion is a homeomorphism and . Compatible invariant metrics need not be Lipschitz equivalent; on the additive group , both and are compatible invariant distances.
For every integer , the map is a continuous unitary character of the circle group: and . By contrast, the two-dimensional group representation has character of a representation . Its value at the identity element is , so this trace is not a continuous unitary character.
Locally profinite group 2026-10-14
A locally profinite group is a Hausdorff, locally compact, totally disconnected topological group. It has a neighbourhood basis at the identity consisting of compact-open subgroups. In smooth representation theory this is also called an -group; that terminology is unrelated to a lattice-ordered group.
Bowen metric 2026-10-14
For a continuous map on a compact metric space, the Bowen metric compares the first points of two forward orbits. Its radius- ball is . If is the largest cardinality of an -separated set in this metric, then topological entropy is . The uniform continuity of the identity between two compatible metrics gives the comparison of separated-set counts needed for independence of the original metric.
For a two-dimensional hyperbolic toral automorphism, the stable and unstable eigenvalues obey . In a sufficiently small Bowen ball, lifting to the stable and unstable coordinates gives widths proportional to and . Its normalized Haar measure is therefore proportional to , uniformly in the centre. Maximal separated sets cover by radius- Bowen balls and pack disjoint radius- Bowen balls, so their exponential growth rate is . Smallness of must exclude nonzero lattice jumps between successive lifted iterates; this is essential to the ball-volume argument.
Use half-width , upward speed , constant inertial reference density , and positive buoyant reduced gravity . Half-section fluxes are , and . With two-sided entrainment , the Boussinesq balances are
Full-width fluxes are twice these definitions. The shape coefficients differ from triangular transverse profiles, so their unsteady balances cannot be used unchanged here.
For plume area and reduced gravity , the principal matrix in variables is . At it has a triple real speed but only two independent eigenvectors. Thus the model is weakly hyperbolic, not strongly or strictly hyperbolic. Real speeds alone do not provide a complete set of characteristic fields or a uniform high-frequency estimate. Shape factors representing nonuniform radial profiles can alter this degeneracy.
With zero source volume flux and zero buoyancy flux but positive source momentum flux, the axisymmetric top-hat plume model reduces to a turbulent round jet. For full-cross-section kinematic fluxes, put . Entrainment gives , while momentum conservation gives . Hence , speed and radius . A finite source flux replaces by . The ideal zero-flux source has singular speed and is a far-field model, not a finite nozzle.
Source volume flux is negligible only when entrained volume greatly exceeds it. In the jet limit of the top-hat plume model, this requires . In a pure plume with , it requires , where for full-cross-section fluxes and . These scales differ from the jet length which measures imposed momentum relative to buoyancy. Neglecting source volume does not automatically permit neglecting source momentum.
In an impermeable cylinder, an axisymmetric turbulent plume with negligible source volume flux requires a downward return flow. With uniform upward plume velocity and ambient velocity , volume conservation gives . An entrainment coefficient based on the relative speed gives . A specified pressure closure is essential for momentum conservation. If the departure from ambient hydrostatic pressure and wall force are neglected in the whole-section integral, the total specific momentum flux obeys . Homogeneous unmodified ambient and no buoyancy loss give . These are leading integral-model closures; restoring the ambient dynamic pressure can change the singularity criterion.
A form of tomography that reconstructs an internal radioactive source from directional counts of individually emitted photons. Known spatial photon absorption gives the exponential path weight in an attenuated Radon transform. Full directed data and a suitable reconstruction formula recover the source intensity rather than a transmitted exterior-beam attenuation map.
Computed tomography Created 2026-10-14 Updated 2026-10-20
Transmission measurements determine line integrals of an absorption coefficient after taking the logarithm of incident intensity divided by transmitted intensity. Under the ideal straight-ray model, these measurements are a Radon transform; filtered backprojection reconstructs a planar slice. Angular coverage, calibration and noise control matter because differentiating measured projections amplifies high frequencies. In contrast, single-photon emission computed tomography reconstructs an emitting source through a possibly attenuating medium.
Light clock Created 2026-10-14 Updated 2026-10-18
A light clock measures time by counting round trips of a light pulse between mirrors. In its rest frame, mirrors separated by give a tick duration , where is the speed of light. Comparing this round trip in another inertial frame provides the geometric time dilation argument above.
Amortized analysis Created 2026-10-14 Updated 2026-10-18
Amortized analysis bounds the total cost of every permitted sequence of operations from a specified initial state. An amortized bound means that some constants satisfy for every such sequence of length . The cost model and allowed operations are part of the claim; Big O notation alone does not specify them.
This distinction, and the credit and potential method viewpoints, are developed in R. Endre Tarjan's 1985 paper Amortized Computational Complexity, sections 1–2, pp. 306–308. The dynamic array doubling example below shows how an expensive operation can pay for itself through the cheap operations that precede it.
Pseudo-polynomial time Created 2026-10-14 Updated 2026-11-05
An algorithm has pseudo-polynomial time when its running time is bounded by a polynomial in the numerical magnitudes of input quantities, rather than necessarily in their encoded lengths. The dynamic programming table for the 0-1 knapsack problem uses arithmetic operations for items and capacity .
A binary numeral system representation needs only bits for that capacity, so the table bound can be exponential in the number of capacity bits. For example, capacities below fit in bits, while a table with one entry for every capacity can have nearly columns. The numerical-value bound does not claim that every instance requires exponential work.

There are unlisted articles, also show them or only show them.