A group of order thirty-six with a normal and a cyclic quotient of order four acting freely on its eight nonzero elements has six conjugacy classes of sizes . Its four linear characters are lifted from the cyclic quotient. The remaining irreducible degrees are four and four, by the sum of squared degrees. Column orthogonality forces the last three values of both degree-four rows to vanish. The square of the order-four action is inversion on , making the first two nontrivial class values real. Orthogonality then gives sum minus one and product minus two, so the rows are and . This illustrates why reality must be justified when reconstructing a character table from orthogonality.
For the nontrivial action of on , the conjugacy class sizes are . Three linear characters factor through the quotient , and the remaining two irreducible characters have degree three. Put and let . With suitable class labels the table isOne can derive the last two rows by inducing nontrivial characters of along the two orbits of the order-three automorphism on their exponents. Their degree-three orbit sums vanish off . On a generator they give the two sums of seventh roots over quadratic residues and nonresidues. Their sum is and their product is : the nine pairwise exponent sums between the two triples contain zero three times and every nonzero residue once. Thus they are the roots of . Alternatively column orthogonality forces the zeros on the centralizers of order three, and orthogonality with the identity column interchanges and in the last row. This finite table illustrates how centralizer sizes and a small number of given values determine missing character values.
Column orthogonality 2026-10-31
For a finite group, the sum of products of irreducible character values is zero when are not conjugate, and equals when are conjugate. To prove this from row orthogonality relations for a character table, choose representatives of its conjugacy classes and form . Row orthogonality says . There are equally many irreducible characters and conjugacy classes, so this is a square unitary matrix and as well. Its column equations give the result, using .
Capacity of a disjoint sum of channels 2026-10-31
Combine finitely many discrete memoryless channels with disjoint input alphabets and disjoint output alphabets into a block-diagonal channel. The block label is determined by both input and output. If it has law , the mutual information is at most , attained by using each block's capacity-achieving conditional input law. Put and . The expression equals , so Gibbs inequality proves the displayed capacity, attained for block probabilities . Even blocks of capacity zero contribute distinguishable block choices; three disjoint zero-capacity blocks give capacity .
Suppose one row of a finite discrete memoryless channel is a convex combination of other rows: . Deleting input leaves the channel capacity unchanged. Given any input law with mass on , move that mass to the other symbols in proportions . The output law stays the same. By the concavity of information entropy, , so this replacement cannot increase conditional entropy and cannot decrease mutual information. Taking maxima proves the claim; the smaller channel is also trivially a restriction of the original one. If the entropy inequality is strict, every positive use of the redundant row is strictly suboptimal compared with its redistribution.
Capacity after independent output erasure 2026-10-31
Pass the output of a discrete memoryless channel of channel capacity through an independent finite-alphabet erasure channel with erasure probability . Its capacity becomes .
To prove it, let be the original input, the original output, the erasure indicator, and the final output. Since the erasure marker is distinguishable, is determined by . It is independent of , so the chain rule for mutual information gives . Maximization over the same input distributions proves the formula. For the maximizing distributions are exactly the original channel's maximizers. For , every input distribution attains the zero capacity. Input-dependent erasure need not satisfy this scaling identity.
Cerebral autoregulation Created 2026-10-31 Updated 2026-11-05
Adjustment of cerebral vascular resistance that moderates changes in blood flow as perfusion pressure varies. It has finite physiological limits and is not a guarantee of constant flow.
Cerebral arterial circle Created 2026-10-31 Updated 2026-11-05
Cerebral perfusion pressure Created 2026-10-31 Updated 2026-11-05
Cerebral perfusion pressure is the pressure difference supporting cerebral blood flow. A common approximation compares arterial pressure with intracranial pressure, while the effective downstream constraint can depend on venous conditions. The pressure difference alone does not determine flow without vascular resistance.
Blood-brain barrier Created 2026-10-31 Updated 2026-11-05
The blood-brain barrier is a specialized vascular interface restricting and regulating exchange between blood and neural tissue. Endothelial junctions, transport systems and interactions with supporting cells contribute. It is selective rather than an absolute seal against every substance.
Superior cerebellar peduncle Created 2026-10-31 Updated 2026-11-05
The superior cerebellar peduncle is a major cerebellar connection carrying much output from deep cerebellar nuclei toward more rostral targets, along with selected input pathways. Its relation to the superior medullary velum helps orient the roof of the fourth ventricle.
Inferior cerebellar peduncle Created 2026-10-31 Updated 2026-11-05
The inferior cerebellar peduncle connects the cerebellum with medullary and spinal-associated pathways. It carries several sensory and olivary inputs together with some outputs. Its mixed composition differs from a single dedicated sensory nerve.
Vertex centroid 2026-10-31
The arithmetic mean of a finite nonempty collection of vertices, treating each vertex as an equal point mass. For a polygon, this need not equal the uniform-area centroid of its interior. A translation or linear map commutes with this average; consequently rotating all vertices about their vertex centroid leaves that centroid fixed.
For the canonical hyperbolic partial differential equation , every solution is . Data on the characteristic determine up to an additive constant, but only determine at one point. If a transverse derivative is also prescribed, it must satisfy , independent of . A varying prescribed value is incompatible; a constant compatible value still leaves the rest of arbitrary. Thus characteristic Cauchy data can produce nonexistence or nonuniqueness. A derivative in original coordinates must first be transformed by the chain rule before applying this compatibility test.
Hyaline cartilage Created 2026-10-31 Updated 2026-11-05
Hyaline cartilage is cartilage with a relatively uniform-looking matrix at the light-microscope scale. It supports structures and provides low-friction articular surfaces at many joints. The visual name does not mean the matrix lacks molecular or fibrillar organization.
Fibrocartilage Created 2026-10-31 Updated 2026-11-05
Fibrocartilage is connective tissue combining a cartilage-like cellular environment with abundant tensile supporting fibers. It occurs where combined compression and tension must be accommodated, including the pubic symphysis and knee menisci. Its organization differs from both a tendon and ordinary articular hyaline cartilage.
Cardinality of strictly increasing natural-number sequences Created 2026-10-31 Updated 2026-11-05
Strictly increasing natural-number sequences form a subset of , giving the continuum upper bound. Map each binary sequence to for the matching lower bound: adjacent values differ by at least one and the binary sequence can be recovered.
Dissolved inorganic carbon 2026-10-31
Dissolved inorganic carbon is the total dissolved carbon in inorganic species, principally aqueous carbon dioxide, bicarbonate and carbonate. A reservoir model may express its concentration in moles of carbon per kilogram of water. Air–sea exchange, river inputs, carbonate chemistry and burial affect its inventory; a single linear concentration-pressure relation is a model simplification.
Two-reservoir carbon adjustment Created 2026-10-31 Updated 2026-11-05
A conservative two-reservoir model separates fast atmospheric exchange from slow ocean adjustment. Let atmospheric carbon-dioxide inventory be , where is atmospheric partial pressure and is mass per pressure; let ocean dissolved carbon inventory be in moles, with ocean water mass and dissolved inorganic carbon concentration in moles per mass. Write for a linear air-sea equilibrium approximation, and take exchange positive into the ocean.
Let emissions and weathering transfer be carbon-dioxide-equivalent mass rates, the corresponding molar mass, and an ocean carbon-removal rate in moles per time. The balances areMultiplying the second by and adding the first gives total-inventory change : exchange and weathering transfer cancel, as required by mass conservation in this chosen model.
If atmospheric relaxation is short compared with the ocean response, set the first derivative approximately to zero. ThenThe reduced ocean timescale is . A sustained emissions increase first raises atmospheric pressure at nearly fixed , then both adjust as the ocean inventory changes. This separation requires and slow forcing relative to ; the full coupled equations must be retained when those conditions fail. Weathering is represented here as an atmosphere-to-ocean transfer, not automatically as permanent burial.
A harmonic velocity potential decaying with depth, together with linearized kinematic and Bernoulli boundary conditions and capillary pressure, gives . The corresponding phase speed combines long-wave gravity and short-wave capillarity contributions.
There are unlisted articles, also show them or only show them.