Scale increments for a birth-death chain Created 2026-10-14 Updated 2026-11-05
The interior equation for a harmonic function for a Markov chain on the integers gives . Positive scale increments satisfy . For absorbing boundaries , the lower exit Probability from is
This satisfies the harmonic equation and the boundary values and therefore is the hitting probability. For parity-dependent probabilities, with ; geometric sums distinguish rightward, balanced and leftward escape.
// Target: markov-process.bigb
Scale invariance of decimal significands Created 2026-10-07 Updated 2026-11-05
A decimal significand lies in , obtained by removing the integer power of ten from a positive number. Multiplication by a constant rotates the fractional logarithm modulo one. Invariance under every such rotation makes the fractional logarithm uniform and hence implies Benford law. This is an invariant significand distribution, not a proper scale-invariant distribution for the entire positive number.
Scaling identity for greatest common divisors Created 2026-10-07 Updated 2026-11-05
For positive integers , the greatest common divisor scales by the common multiplier . If , then is a common divisor of . Meanwhile Bézout's identity expresses as an integer linear combination of , so their greatest common divisor divides . These two comparisons prove the identity without prime factorization.
Schinzel-Tijdeman exponent theorem Created 2026-10-14 Updated 2026-10-20
For a fixed polynomial with at least two distinct complex roots, integer solutions with and have an effectively bounded exponent. Factorization over a splitting field and the fixed differences between distinct roots control common ideal divisors. Outside a fixed set of primes, each factor's valuation is divisible by , where is its root multiplicity. The generalized power-equation estimates from linear forms in logarithms of algebraic numbers, including unit and exceptional-prime factors, give the exponent bound. A single-root polynomial and the values cannot be included: , and for , give infinite exponent families.
Scientific notation Created 2026-10-20 Updated 2026-11-05
Scientific notation writes a nonzero real quantity as with an integer and . For example, and .
The exponent records the scale while the significand records the reported digits. Multiplication adds the exponents, so . The displayed precision must still reflect the accuracy of the underlying measurement; rewriting a value does not add information. The number zero is written separately because the normalized form excludes it.
Selberg sieve diagonalization Created 2026-10-06 Updated 2026-11-05
Put , and , where is a multiplicative arithmetic function supported on squarefree integers. For squarefree integers ,
Thus the quadratic form is . Möbius inversion gives . On the permitted squarefree integers, the constraint becomes . The Cauchy-Schwarz inequality yields , where over those integers; equality holds at .
Self-conjugate partition and distinct odd parts Created 2026-09-28 Updated 2026-11-05
A self-conjugate partition is determined by the hook lengths of its diagonal cells. These are distinct odd positive integers, and every partition into distinct odd parts arises uniquely this way. Hence their generating function is
Self-intersection number Created 2026-09-24 Updated 2026-11-05
Let be a compact, oriented, boundaryless embedded submanifold of dimension in an oriented smooth manifold of dimension . Its self-intersection number is the signed intersection number of with a small transverse push-off. A transverse section of a fiber bundle of the normal bundle gives that push-off; its signed zeros show that
The Euler class makes the answer independent of the chosen transverse section of a fiber bundle.[ref]
A line in the Complex projective plane has square . A fiber in has square zero because it has a disjoint homologous push-off. The exceptional divisor of a blowup of a smooth algebraic surface has square . For noncompact embedded submanifolds or embedded submanifolds with boundary, an integer requires additional support or boundary data; the unrestricted signed-count definition does not apply.
Semidiscrete Fourier transform Created 2026-10-24 Updated 2026-10-31
For a sequence indexed by the integers, its semidiscrete Fourier transform is the displayed Fourier series in . For square-summable data the series is interpreted in the L2 norm. Its inversion and Parseval identity are
The physical-frequency convention uses and on . This is distinct from the discrete Fourier transform of a finite vector. Translation-invariant finite difference operators become Fourier multipliers, making Fourier stability analysis possible.
Semidivisible number Created 2026-10-20 Updated 2026-11-05
A positive integer is semidivisible when it lies strictly between the squares of consecutive prime numbers ,
and is divisible by exactly one of and . The strict inequalities exclude both endpoint squares. For example, is semidivisible because and only divides . The integer lies in the same band but is divisible by both prime numbers, so it is excluded.
Within one band, a divisibility calculation can avoid testing every integer. Add the sums of integer multiples of and of , then subtract twice the sum of integer multiples of . Each doubly divisible number was counted twice and should count zero times. Each sum is an arithmetic progression, and the same inclusion-exclusion bookkeeping works for counts instead of sums.
Semigroup Created 2026-09-24 Updated 2026-10-14
A semigroup is an algebraic magma whose binary operation has the associative property. Its products can be regrouped while preserving the order of their elements. An identity element and inverse elements are not required.
For example, the positive integers with addition form a semigroup, since and a sum of positive integers is positive. They have no identity element: it would have to be zero, which is outside that set. Nonempty words over an alphabet with concatenation give a noncommutative example without an identity element. Including the empty word instead gives a free monoid.
The usefulness of a semigroup is that an ordered list has one product regardless of its parentheses. This permits replacing a consecutive block by its already computed value. Here the empty set is also allowed as a semigroup; a monoid is necessarily nonempty because it contains an identity element.
Semistandard Young tableau Created 2026-10-05 Updated 2026-10-14
A semistandard Young tableau fills a Young diagram with positive integers, permitting repeated entries, so that entries weakly increase along rows and strictly increase down columns. Its content records the number of occurrences of each entry. The Kostka number counts such fillings of shape and content .
Separate chaining Created 2026-10-13 Updated 2026-10-20
With separate chaining, each hash bucket in a hash table contains a collection of records, often a linked list. Lookup computes the bucket index, then follows that chain until a key equality comparison succeeds or the chain ends. A hash collision therefore affects the search work without merging unequal keys. Deletion searches the same chain and unlinks the matching record; in a singly linked list, remembering the preceding record during the search permits the unlink.[ref]
For the four-key integer example in hash table, insert a new record at the head of its chain after checking that its key is absent. Inserting in that order makes hash bucket hold , hash bucket hold , and the other two hash buckets empty. All five subsequent operations below select hash bucket because :
Figure 1.
Separate chaining traces lookup, replacement, deletion and insertion through key equality
. Original deterministic model with . The table counts actual keys inspected, not elapsed machine time. Operations occur from top to bottom; only an absent key adds a new record, and the untouched record remains in hash bucket . Details.
get(5) rejects key , accepts key , and returns after two key equality comparisons. get(13) rejects and reports absence after three comparisons. put(5,B*) examines and replaces the value without changing . delete(9) examines just the head record, removes it, and gives . Finally, put(13,E) rejects before inserting the new head record; returns to and the chain is . The successive hash table load factors are . These counts follow from the stipulated chain order; a different insertion policy changes the successful-search counts.
For a chain of length , lookup and deletion by key take time complexity in Big O notation. The same applies to put before any resizing, since replacement semantics require checking for an existing equal key. Head insertion alone is if absence is already known; that is a different precondition. These bounds assume bucket-index hashing, array access, key equality comparisons, allocation and link updates. A long string or large integer can make hashing or comparison depend on its encoded length, so counting record visits alone does not establish constant running time.
Under simple uniform hashing, each distinct key's bucket index is an independent random variable with a uniform distribution on a finite set of indices. The keys and query are fixed independently of this random assignment. Then lookup has expected time complexity, where is the hash table load factor; it is expected when stays bounded. These are model assumptions, not an automatic consequence of using a deterministic hash function.[ref]
Here is the short calculation. For an absent query and stored keys , let be the indicator random variable of . The number of records inspected has expected value
by linearity of expectation. For a present fixed query, scanning its entire chain inspects at most itself plus all other colliding records, with expected value ; stopping at the match only decreases this upper bound. Adding constant hashing and bucket access yields expected for either query. The argument needs pairwise collision bounds; it does not require all the indicator random variables to be independent. A universal hash family can provide a related bound by random choice of a hash function for a fixed key set, as explained in that article.
The worst case remains , and an absent query takes comparisons if all records occupy its hash bucket. For instance, all collide under . Separate chaining remains correct, but a sequence of insertions that each checks the existing chain can take quadratic total work. Amortized analysis of resizing does not remove this search cost, and an adaptive choice of keys based on a known hash function is outside the stated simple uniform hashing model.
Separating finite Laurent support by an integer weight Created 2026-10-06 Updated 2026-11-05
Given a finite set of exponent vectors, there is for which the integers , , are pairwise distinct. For , take with larger than every first-coordinate difference in . In higher dimensions take with sufficiently large. This proves that a nonzero Laurent polynomial can be detected by a substitution without cancellation of its distinct terms.
Sequence Created 2026-09-24 Updated 2026-10-14
A sequence assigns a value to each position in an ordered index list. For an infinite sequence in a set , one standard convention is a function , written with . Some applications start the index at zero, and a finite sequence has only finitely many positions. Values may repeat; both order and repetition matter. [ref].
For example, begins , whereas begins . Their sets of values are both , but these are different sequences. A subsequence keeps selected positions in increasing order; the subsequence of at its even integers is the constant sequence . A tail of a sequence retains all positions from one index onward.
Sequences express successive approximations, repeated observations, and the iterates of a recurrence relation. A limit of a sequence describes where its terms eventually concentrate. Finite observations alone cannot establish that behaviour: for any positive integer , the all-zero sequence and the sequence with for and for agree through index , yet have different limits of sequences. A formula or bound controlling the entire future, such as the tail diameter of a sequence in the Cauchy sequence condition, supplies information that a finite list cannot.
Sequential direct limit of multiplication maps on the integers Created 2026-10-03 Updated 2026-11-05
For nonzero integers and , the compatible embeddings of stage into send to . They identify the direct limit with
Serre relations Created 2026-10-14 Updated 2026-11-05
For simple-root generators with , the Serre relations include and for . The off-diagonal Cartan entries are nonpositive integers. These relations restrict which iterated simple-root brackets remain nonzero.
Serre spectral sequence Created 2026-09-24 Updated 2026-11-05
For a Serre fibration over a path-connected CW complex, the cohomological Serre spectral sequence starts with
The fibre cohomology groups form a local coefficient system through the fundamental group action. For a simply connected base, it is constant. The stable terms are successive quotients of a finite filtration of each ; reconstructing the cohomology groups can require solving group extensions. With commutative ring coefficients, the cup product makes the construction multiplicative.[ref]
For the Hopf fibration with integer coefficients, the only nonzero positions on are , each a copy of . Since , the map must be an isomorphism. The survivors at and give the cohomology in degrees zero and three. This example shows how twisting changes the answer from the cohomology of a Cartesian product.
Include the positive integers in , and exclude the intervening integer intervals and zero. Equivalently, include for . Each included block is large enough to raise the running proportion; the following excluded block lowers it again.
With , the exact boundary counts follow from a geometric series:
The first sum is empty at . Dividing by the corresponding boundary, rather than using one denominator for both, gives
For example, , whereas , yielding proportions and . For , the exact count is ; for it stays . Hence the proportion increases through each included block and decreases through each excluded block. These boundary subsequences give the actual limit inferior and limit superior:
Since these differ, has no natural density. Its upper asymptotic density still records its largest limiting proportion.
In an -player simple cooperative game, every marginal contribution along a player permutation is zero or one. The Shapley value is its average over the equally likely permutations. Thus counts the orders in which player changes a losing coalition into a winning one and is an integer. In lowest terms, the coordinate's denominator divides . This is a necessary constraint on a proposed Shapley value vector, not a sufficient one.