Weyl denominator Created 2026-10-14 Updated 2026-11-05
The Weyl denominator is the alternating expression in the Weyl denominator formula. Its product form uses the Weyl vector , half the positive-root sum. On a compact maximal torus, the factor has unit modulus; if it is only defined on a covering torus, the squared modulus still descends. Thus is a globally defined density in the Weyl integration formula. For the unitary group an integer central shift gives the Vandermonde determinant , whose modulus is the same.
Weyl inequality Created 2026-10-14 Updated 2026-11-05
For a real degree- polynomial with leading coefficient , , and coprime integers satisfying , the displayed bound applies to its exponential sum over . Repeated Weyl differencing reduces the phase to slope . A geometric-sum estimate, the subpower bound for the divisor function and the reciprocal fractional-part sum near a rational complete the estimate. The arbitrary positive exponent absorbs divisor bounds and logarithms.
Wheel modulus Created 2026-10-20 Updated 2026-11-05
The wheel modulus is the product of a chosen finite set of small distinct prime numbers in wheel factorization. Except for those primes themselves, every prime candidate must lie in a residue class coprime to . For , the allowed residues are , repeating every thirty integers. The proportion retained is . Passing the wheel only avoids these small divisors; it does not certify primality, since composite values such as still pass.
Wilson's theorem 2026-10-14
For an integer , Wilson's theorem characterizes prime numbers by a factorial:The right side is an integer congruence, so the least nonnegative remainder is . For example, certifies that five is a prime number, whereas rules out six. [ref]
For an odd prime number , each nonzero congruence class has a unique modular multiplicative inverse. Pair each class with its inverse: each distinct pair contributes one. A class is its own inverse exactly when ; since , Euclid's lemma leaves only . Their product is . The prime number two needs a separate check: . Conversely, a proper divisor divides both and , so the displayed integer congruence would force , a contradiction. [ref]
The composite numbers have an even sharper pattern: for every composite number , but . To check the zero claim, write with . If , both occur as different factors in the factorial. If , the different factors and both occur since , and their product is divisible by . The only excluded case is . Thus four is an exception to the zero pattern, but still fails Wilson's theorem: its required remainder would be three.
This is an exact primality testing criterion, but direct evaluation is expensive: even reducing modulo after every multiplication still takes a number of multiplications proportional to , which grows exponentially with the number of binary digits of . The problem is not merely storing a huge factorial. The more useful role of Wilson's theorem is simplifying factorial expressions in modular arithmetic. For instance, if is a prime number, then gives by a modular multiplicative inverse.
Winding number Created 2026-09-24 Updated 2026-10-14
The winding number records how many net turns a closed piecewise smooth curve makes around a chosen point . Counterclockwise turns contribute positively, clockwise turns negatively. It measures a traversal, including repeated visits; a drawing of the curve's outline alone can lose that information. For a closed curve avoiding ,Equivalently, continuously follow an argument of along one journey and divide its total change by . The start and endpoint agree as complex numbers, so the change is an integer number of full turns. The principal argument at the endpoints cannot retain those turns; a continuous choice along the parametrized path can.[ref]
For , , the winding number about zero is one. Traversing the same unit circle twice makes it two; reversing its orientation of a contour makes it negative. The winding number about is zero: the same journey now stays to one side of the point being measured. Joining one counterclockwise loop and one clockwise loop around zero gives net winding number zero even though both loops encircle zero.
The winding number does not change during a homotopy of closed curves avoiding . This is why it is useful: complicated curves can often be deformed to simple ones whose count is obvious. The argument principle transfers that robust geometric integer to a count of zeros of a function and poles. The example in boundary sampling can miss winding shows why finite samples of a curve need control between samples before they can certify the same winding number.
Word length Created 2026-10-05 Updated 2026-10-14
The word length is the cost of building a group element from the allowed generators of a group. For a symmetric generating set of a group of a group , defineThe empty word over an alphabet represents the identity element and has length zero. A representative with this least number of letters labels a shortest graph path from to in the Cayley graph. Thus word length minimizes over all representatives, rather than counting the letters in whichever expression we happened to write down.[ref]
For the additive integers with , the expression has three letters but represents , whose word length is one. With , the integer has word length three, realized by . The Cayley graphs of the integers visualize why these are minimal. A freely reduced word is always shortest in a free group with its free generators and their inverses; free reduction alone need not give a shortest representative in a general group.
Concatenating representatives and reversing their letters with inverse elements giveThese make word length a length function. A finite gives finite word metric balls, since only finitely many words over an alphabet have length at most a fixed radius. The definition itself also works for infinite symmetric generating sets of a group; the bounded-metric example in equivalence of finite word metrics shows what finiteness adds.
Word metric balls in the integer lattice 2026-10-14
The additive group gives a useful way to see what a word metric measures. Let and , and choose the four-move generating set of a group . Its Cayley graph is the square lattice. Each move changes exactly one coordinate by one, so the word length is the L1 norm, and the word metric is Manhattan distance:At least this many moves are necessary, and moving horizontally then vertically attains the bound. Bridson gives this square lattice as a basic Cayley graph example.[ref]
Now allow all eight neighbouring lattice points as moves:Each coordinate changes by at most one per move. Use diagonal moves until the smaller displacement is exhausted, then use axis moves: the resulting word length is the maximum norm, and the word metric is Chebyshev distance. From to , an -route has five steps, while the -route has three.
The closed word metric balls consist of lattice points inside a diamond for , and inside an axis-aligned square for . For every nonnegative integer radius ,The diamond has lattice points at word length ; the square has choices for each coordinate. At radius three the counts are and . These are discrete closed balls for Manhattan distance and Chebyshev distance; an Euclidean distance bound would instead select lattice points inside a Euclidean disk.
Radius-three word metric balls in the integer lattice: a diamond with 25 points and a square with 49 points, with routes to
. Details. Working set 2026-10-13
An operating-system process's working set is the set of distinct memory pages used in a declared recent window. Here the window counts memory references, not clock time: let identify the memory page accessed by the th memory reference, and let the positive integer be the window length. Immediately after reference ,Repeated memory references to the same memory page contribute only one set element. The working set size is the cardinality . This recent footprint estimates current demand; it cannot guarantee which memory pages future memory references will need. The resident set instead records which memory pages are actually present in computer memory.
For the 20-reference sequence in memory thrashing and , the successive working sets begin , , and . At , the window is references 2–5, namely , so again. Every later four-reference window contains all four memory pages. Under three-page frame LRU replacement, however, the resident set at is : page 2 was evicted. Consequently the working set size is four even though only three memory pages are resident. Under four-page frame LRU replacement, the resident set contains the complete working set after reference 4.
A four-reference working set remains four pages while a three-frame resident set contains only three
. Details. Window choice matters: on this same sequence, reports only two distinct memory pages after reference 2, despite the recurring four-page cycle. A short window forgets useful memory pages sooner; a long window retains evidence from older phases. Enlarging the window can only enlarge or preserve the working set at fixed , because the shorter window is contained in the longer one. No single window is best for every workload.
For a concrete multiprogramming budget, suppose three operating-system processes each have a four-page working set, no shared page frames, and only eight page frames are available for their data. Their combined demand is 12 page frames; all three working sets cannot be resident together. Letting two operating-system processes run while the third waits makes their eight-page demand fit in this simplified model. Real budgets also reserve computer memory for the operating system and other uses; shared memory pages must not be counted repeatedly as different physical copies.
Peter J. Denning's [ref]
https://denninginstitute.com/pjd/PUBS/WSModel_1968.pdf. The Working Set Model for Program Behavior, Communications of the ACM, May 1968, sections 3–4
formalized the working set using recent process execution time, rather than this article's reference count. Its central insight connected memory demand to process scheduling: deciding which operating-system processes run also decides which working sets need room. Temporal locality makes recent use informative, without making it a promise about the future. The beautiful distinction is between a large possible address space and the smaller footprint of the current activity. Young's lattice Created 2026-10-14 Updated 2026-11-05
The Young lattice is a partially ordered set whose elements are integer partitions, including the empty partition. Each partition of an integer is identified with its diagram, and the order is inclusion of Young diagrams. A cover adds exactly one box. A saturated path from the empty diagram to is equivalent to a standard Young tableau of shape .
Young tableau Created 2026-09-28 Updated 2026-10-14
A Young tableau is a filling of a Young diagram with entries, typically positive integers. The shape is the partition of an integer giving its row lengths. We draw Young tableaux in the English convention of Young diagram, with left-aligned rows arranged from top to bottom. A filling need not obey increasing conditions unless these are specified: standard Young tableaux use each of exactly once and strictly increase along rows and down columns; Semistandard Young tableaux permit repetitions and require weakly increasing rows and strictly increasing columns.
In the constructions for a symmetric group involving Young symmetrizers, tabloids, and polytabloids, an unqualified numbered Young tableau means a bijective filling by , with no increasing condition imposed. This narrower convention is compatible with the broader use needed for Semistandard Young tableaux. Historically, Young's work connected these fillings to representation theory of the symmetric group; in particular, the equality between standard Young tableau counts and irreducible representation degrees over the complex numbers predates the modern hook-length formula. See Stanley's Algebraic Combinatorics, historical notes to Chapter 8.
Yu. Ofman Created 2026-10-13 Updated 2026-11-05
Yu. Ofman coauthored the 1962 paper Multiplication of many-digital numbers by automatic computers by A. Karatsuba and Yu. Ofman. The work reduces a multiplication of large integers to three smaller multiplications rather than four, yielding the divide-and-conquer recurrence behind Karatsuba multiplication. It is an early example where an algebraic rearrangement changes an algorithm's asymptotic cost.[ref]
Multiplication of many-digital numbers by automatic computers by A. Karatsuba and Yu. Ofman. paper and three-product identity
Zeeman theorem on twist-spun knots Created 2026-09-24 Updated 2026-11-05
Let be a smooth knot and let be an integer. The exterior of its -twist-spun knot in is a fiber bundle over a circle, with fiber the -fold cyclic branched covering of along with an open three-ball removed. For the open complement, use the corresponding branched cover with a point removed. Its monodromy comes from the cyclic deck action.[ref]
Twisting spun knots by E. C. Zeeman. Main theorem in Section 6; Section 1 distinguishes punctured and bounded-punctured fibers
For , the branched cover is , the compact fiber is a three-ball, and the resulting two-dimensional surface knot is unknotted. Zero-twist spinning is ordinary spinning and is excluded from this nonzero-twist fibration theorem; a zero-fold branched cover is not its fiber.[ref]
Zero-truncated claim-count distribution Created 2026-10-06 Updated 2026-11-05
For a nonnegative integer claim count with , the conditional law given has masses for . Its probability generating function is . Truncation at zero is meaningful only when the positive-count event has positive probability.
Zeta bounds from rounded Pareto variables Created 2026-10-25 Updated 2026-11-05
Let have survival function for , with . Its expected value is . The tail-sum formula for expectation givesThe absolutely continuous probability distribution gives zero mass to the integers, so almost surely and . Taking expectations of gives , which rearranges to the displayed bounds on the Riemann zeta function. Finiteness is justified by and .
Zeta series truncation error 2026-10-14
For a real exponent and a positive integer , the series truncation error in the defining Riemann zeta function series isThe integral comparison for the positive decreasing function gives the explicit boundsOn each unit interval, the area under lies between its endpoint heights. Summing from the first omitted term gives the lower integral from to infinity and the upper integral from to infinity. This uses positivity and monotonicity, not an assumption that the last computed term equals the remaining error.
At , the bounds are , whereas . The errors above fit both intervals. Merely looking at the eleventh term would give for squares, far smaller than the actual remaining .
For a chosen absolute error target , the sufficient condition is , rounded upward to an integer. Thus requires by this bound for squares but only for fourth powers. This is a guarantee from an upper bound, not a claim that those are the smallest successful term counts.



