Fact-checked by Grok 2 weeks ago

Binomial

In mathematics, a binomial is a polynomial expression consisting of exactly two terms, typically connected by a plus or minus sign, such as a + b or x - y.^[1]^[2] The binomial theorem provides a formula for expanding the power of a binomial raised to a positive integer exponent n, stating that (a + b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k, where \binom{n}{k} denotes the binomial coefficient, defined as \frac{n!}{k!(n-k)!}, representing the number of ways to choose k items from n without regard to order.^[3]^[4] These coefficients appear in Pascal's triangle, a combinatorial array where each entry is the sum of the two above it, facilitating computation of expansions and underlying applications in probability, such as the binomial distribution for modeling sequences of independent trials.^[5] Originally recognized in ancient Indian mathematics for integer exponents, the theorem was systematized in Europe by Blaise Pascal in the 17th century and generalized by Isaac Newton to fractional and negative exponents, enabling infinite series expansions crucial for early calculus developments.^[6]

Definition and Etymology

Origin and Meaning

The term binomial originates from Late Latin binomius, meaning "having two names," derived from the prefix bi- ("two") and nomius ("name"), reflecting a structure composed of dual elements.^[7] This etymon entered English around the 1550s, primarily through mathematical and scientific discourse, where it denoted expressions or designations formed by exactly two components rather than a single monomial or multiple terms.^[7] In its core sense, a binomial signifies any algebraic expression, linguistic construct, or nomenclature consisting of two distinct terms connected by an operation such as addition or subtraction, or in taxonomy, two words specifying genus and species.^[8] This duality underscores a basic partitioning into paired units, without inherent hierarchy or expansion beyond the two parts, distinguishing it from more complex forms like trinomials.^[9] Early mathematical usage traces to the 16th-century German reformer and mathematician Michael Stifel, who in his 1544 treatise Arithmetica integra applied binomium to describe sums of two terms, such as a + b, and pioneered the concept of binomial coefficients for higher powers, laying groundwork for later expansions while emphasizing the term's literal two-part nature.^[10] Stifel's adoption marked a shift from medieval cossic algebra toward systematic terminology, influencing subsequent European mathematicians despite his work's roots in Lutheran-era computations.

Fundamental Concepts

A binomial refers to an expression or structure composed of precisely two distinct components or terms, a concept rooted in the Latin prefix bi- denoting "two" and nomen meaning "name," reflecting its origin as a descriptor for dual-named or dual-termed entities.^[7] In algebraic contexts, this manifests as a polynomial limited to two monomials connected by addition or subtraction, such as ax^n + b, where the terms differ in variables, exponents, or coefficients, precluding unification into a single term.^[8] This strict limitation underscores its distinction from a monomial, which comprises only one term (e.g., $3x^2), and from trinomials or broader multinomials, which incorporate three or more terms (e.g., x^2 + 2xy + y^2).^[11] Such classification hinges on empirical counting of irreducible components, enabling precise categorization without ambiguity from variable simplification.^[12] The binomial's duality facilitates foundational reasoning in expansions and decompositions, where interactions between two terms model binary causal relationships—such as addition representing superposition or subtraction indicating opposition—before scaling to complex polynomials.^[13] This structure supports verifiable analysis of term dominance and balance, as seen in historical algebraic texts where binomials served as elementary units for deriving higher-order forms, transitioning from mere descriptive notation in 16th-century European mathematics to a rigorous tool for quantitative sciences by the 17th century.^[7] Unlike monomials, which lack interactive dynamics, or multinomials, which introduce confounding multiplicities, binomials isolate pairwise effects, aligning with causal realism by isolating variables for empirical testing and prediction.^[11] Across disciplines, the binomial principle extends beyond pure algebra to denote binary frameworks, such as in biological nomenclature where it prescribes genus-species pairings for species classification, emphasizing observable dual hierarchies over arbitrary descriptors.^[8] This evolution from linguistic descriptor to technical construct, evident by the 1550s in mathematical usage, prioritizes empirical duality for clarity and falsifiability, avoiding the overgeneralization inherent in terms with indefinite term counts.^[7]

Mathematics

Binomial Polynomials

A binomial polynomial, or simply binomial, is an algebraic expression consisting of exactly two monomials combined by addition or subtraction.^[14] Each monomial is a product of coefficients and variables raised to non-negative integer powers, such as ax^m + by^n where a and b are nonzero constants and m \neq n.^[13] Unlike denser polynomials, binomials exhibit sparsity with only two terms, facilitating targeted operations like factorization.^[15] Basic operations on binomials preserve or expand their structure through the distributive property and exponent rules. Addition or subtraction of binomials involves combining like terms if degrees match; for instance, (3x^2 + 2y) + (4x^2 - y) = 7x^2 + y, reducing to another binomial, while unlike terms remain separate.^[16] Multiplication of two binomials, such as (ax + b)(cx + d), yields acx^2 + (ad + bc)x + bd, typically a trinomial, computed via the FOIL method (First, Outer, Inner, Last) for verification: first terms acx^2, outer and inner cross-products, and last bd.^[17] Special cases like (x + y)(x - y) = x^2 - y^2 produce a difference of squares, factorable back to the original for empirical confirmation of exactness.^[18] Factorization reverses multiplication, decomposing binomials into products of simpler factors when possible, such as x^2 - 9 = (x - 3)(x + 3), verified by re-expansion to the original form without approximation errors.^[18] For quadratic binomials ax^2 + bx + c (with middle term zero in sparse cases), roots derive from the quadratic formula x = \frac{-b \pm \sqrt{b^2 - 4ac}}{2a}, yielding exact algebraic solutions when the discriminant is a perfect square.^[19] Division by monomials simplifies coefficients and exponents directly, e.g., \frac{6x^3 + 3x}{3x} = 2x^2 + 1, but binomial-by-binomial division often results in quotients and remainders via polynomial long division.^[16] The formal treatment of binomials as distinct polynomial types solidified during the Renaissance, as Italian algebraists like Niccolò Tartaglia and Gerolamo Cardano advanced symbolic manipulations for cubic equations, treating binomials as aggregations of "species" (powers of unknowns) to enable precise expansions and factorizations.^[20] This era's shift to literal coefficients and irrational terms expanded binomial operations beyond numerical roots, emphasizing verifiable algebraic identities over empirical trial-and-error.^[21] Such developments underpinned exact computations, as re-expansion of factored forms confirms structural integrity without reliance on iterative approximations.^[22]

Binomial Theorem

The binomial theorem provides an explicit formula for the expansion of powers of a binomial expression (x + y)^n, where n is a non-negative integer: (x + y)^n = \sum_{k=0}^n \binom{n}{k} x^{n-k} y^k, with the binomial coefficient \binom{n}{k} defined as \frac{n!}{k!(n-k)!}.^[23]^[24] This finite sum arises causally from the repeated multiplication inherent in raising the binomial to the nth power: each term x^{n-k} y^k emerges precisely \binom{n}{k} times, corresponding to the number of ways to select k factors contributing y from the n identical binomials during expansion, a combinatorial counting principle that directly yields the coefficients without reliance on induction.^[25] This derivation underscores the theorem's foundation in discrete selection processes, distinguishing it from approximate methods and revealing why the expansion terminates exactly at k = n for integer exponents, avoiding the infinite terms that plague oversimplified analogies to geometric series in elementary treatments. Isaac Newton generalized the theorem in a 1676 letter, extending it to arbitrary real exponents r via the infinite series (1 + x)^r = \sum_{k=0}^\infty \binom{r}{k} x^k, where the generalized coefficient is \binom{r}{k} = \frac{r(r-1)\cdots(r-k+1)}{k!}, building on partial expansions by earlier mathematicians like Blaise Pascal for positive integers.^[6]^[26] Newton's insight linked this to emerging calculus concepts, such as equating integrals to series sums through pattern interpolation, though he provided no formal convergence proof, relying instead on empirical verification for specific cases like fractional powers.^[6] This generalization connects causally to Taylor series expansions around x=0, where the binomial form serves as a prototype for deriving limits and approximations in analysis, but demands caution: the series converges absolutely only for |x| < 1, and diverges otherwise, countering naive extensions that treat it as universally polynomial-like.^[27] For instance, expanding (1 + x)^{1/2} yields $1 + \frac{1}{2}x - \frac{1}{8}x^2 + \frac{1}{16}x^3 - \cdots, an exact representation within the radius of convergence but merely asymptotic beyond, highlighting the theorem's precision for finite integer cases versus the conditional utility of its series form— a distinction often glossed over in introductory contexts that prioritize computational ease over rigorous domain limits.^[6]^[27] Newton's formulation facilitated breakthroughs in solving differential equations and computing areas under curves via infinite sums, yet its causal roots in multiplicative combinatorics ensure the integer version remains non-approximative, preserving exactness where series analogs introduce truncation errors.^[6]

Binomial Coefficients and Combinatorics

The binomial coefficient \binom{n}{k}, also denoted C(n,k), quantifies the number of distinct ways to select k unordered elements from a set of n distinct elements, without replacement or regard to order. This is formally expressed as \binom{n}{k} = \frac{n!}{k!(n-k)!} for integers $0 \leq k \leq n, where n! denotes the factorial of n, and \binom{n}{k} = 0 otherwise.^[4]^[28] The formula arises from the principle that the total permutations of n elements taken k at a time, which is \frac{n!}{(n-k)!}, divided by the k! internal arrangements of the selected subset, yields the combination count.^[29] Binomial coefficients exhibit a fundamental recursive structure: \binom{n}{k} = \binom{n-1}{k} + \binom{n-1}{k-1}, with base cases \binom{n}{0} = \binom{n}{n} = 1.^[30] This relation reflects the combinatorial choice when adding the nth element: either include it in the k-subset (preceded by choosing k-1 from the first n-1) or exclude it (choosing all k from the first n-1). Iterating this recursion constructs Pascal's triangle, an array where row n (starting from row 0) lists \binom{n}{0}, \binom{n}{1}, \dots, \binom{n}{n}, and each interior entry is the sum of the two entries directly above it in the prior row.^[30] The triangle's symmetry, \binom{n}{k} = \binom{n}{n-k}, stems directly from the factorial formula, underscoring an inherent invariance in subset selection under complementation.^[4] In combinatorial applications, \binom{n}{k} directly enumerates k-element subsets of an n-element set, a core counting principle used in problems like selecting committees from populations or edges in complete graphs K_n (where the number of edges is \binom{n}{2}).^[31] It also counts monotonic lattice paths in a grid: the number of paths from (0,0) to (n-k,k) using only rightward steps (1,0) and upward steps (0,1) equals \binom{n}{k}, as each path comprises exactly n-k right steps and k up steps in some order, with the total sequences given by the coefficient.^[32]^[31] Generating functions further reveal these counts; the ordinary generating function \sum_{k=0}^n \binom{n}{k} x^k = (1+x)^n encodes the coefficients as the expansion terms, enabling systematic enumeration of combinatorial structures like subset sums or path weights via coefficient extraction.^[33] These interpretations ground binomial coefficients in concrete, verifiable counting invariances rather than abstract generalizations.

Probability and Statistics

Binomial Distribution

The binomial distribution models the probability of observing exactly k successes in a fixed number of n independent Bernoulli trials, each with identical success probability p, where 0 ≤ p ≤ 1 and k = 0, 1, ..., n./05:_Probability/5.07:_Binomial_Distribution) This discrete distribution applies to scenarios with binary outcomes, such as success or failure in quality control inspections or heads in coin tosses, under the causal conditions of trial independence and constant success odds.^[34] The model's foundation rests on repeatable experiments where outcomes do not influence each other, a condition verifiable through controlled replication rather than assumed a priori.^[35] The probability mass function (PMF) is P(K=k) = \binom{n}{k} p^k (1-p)^{n-k}, where \binom{n}{k} = \frac{n!}{k!(n-k)!} counts the ways to select k successes from n trials./05:_Probability/5.07:_Binomial_Distribution) This formula derives from the product of individual Bernoulli PMFs—each P(X_i=1)=p and P(X_i=0)=1-p—combined via convolution for the sum K = \sum_{i=1}^n X_i, with independence ensuring the joint probability factors multiplicatively./3:_Discrete_Random_Variables/3.3:_Bernoulli_and_Binomial_Distributions) The mean equals np, reflecting the additive property of expectations for independent variables, while the variance np(1-p) accounts for the probabilistic spread, decreasing as p approaches 0 or 1 due to reduced uncertainty./05:_Probability/5.07:_Binomial_Distribution) These moments follow directly from linearity of expectation and variance addition for uncorrelated Bernoullis.^[36] Empirically, the distribution aligns with data from controlled binary experiments, such as sequences of fair coin flips (p=0.5), where observed frequencies of k heads in n tosses converge to predicted probabilities as n increases, validating independence and constancy in idealized settings like computational simulations or mechanically uniform tosses.^[34] ^[36] Deviations in real-world applications, such as slight biases from coin physics or environmental factors, highlight the model's reliance on causal isolation of trials, but under rigorous controls—evident in statistical software outputs matching theoretical PMFs—the assumptions hold without systemic distortion.^[37] This grounding in replicable evidence distinguishes the binomial from less empirically anchored models.^[35]

Properties and Approximations

The mean of a binomial random variable X \sim \text{Bin}(n, p) is np, and the variance is np(1-p).^[38] The skewness is \frac{1-2p}{\sqrt{np(1-p)}}, which is positive when p < 0.5 (indicating right skew) and negative when p > 0.5 (left skew), approaching zero as n increases for fixed p.^[39] The excess kurtosis is \frac{1-6p(1-p)}{np(1-p)}, which is negative for p near 0.5 (platykurtic relative to normal) and approaches zero for large n.^[40] For large n, the central limit theorem implies that \frac{X - np}{\sqrt{np(1-p)}} converges in distribution to a standard normal random variable, enabling the normal approximation X \approx N(np, np(1-p)).^[41] The De Moivre–Laplace theorem refines this for the binomial case, stating that for fixed p \in (0,1) and n \to \infty, the standardized binomial converges to N(0,1), with the approximation improving as np(1-p) \geq 10 for practical use.^[42] When n is large, p is small such that \lambda = np remains moderate (typically \lambda \leq 10), the binomial approximates a Poisson distribution with parameter \lambda, suitable for modeling rare events; a rule of thumb requires n \geq 100.^[43] Assumptions underlying the binomial model, such as independence and constant p, can be empirically tested using the chi-squared goodness-of-fit statistic, comparing observed frequencies to expected binomial probabilities, provided expected cell counts are at least 5 to ensure test validity.^[44]

Empirical Applications

In quality control processes, the binomial distribution models the count of defective items in a fixed sample from a production batch, assuming each item is independently defective with a constant probability p. For instance, with an estimated defect rate of 0.02, the distribution Bin(n=100, p=0.02) calculates the probability of observing k defectives, informing acceptance sampling thresholds to reject faulty lots.^[45]^[46] This approach has been integrated into supply chain inspections via simulations combining binomial probabilities with Monte Carlo methods to optimize decision-making under uncertainty.^[47] A/B testing in digital product optimization employs the binomial test to evaluate differences in binary outcomes, such as conversion rates between control and treatment groups, aggregating independent trials into binomial counts for hypothesis testing on proportions.^[48]^[49] For example, if variant A yields 65 successes in 100 trials versus a baseline p_0 = 0.5, the exact binomial test computes the p-value as the sum of probabilities under the null, assessing significance without relying on large-sample approximations.^[50] Gregor Mendel's 1866 pea hybridization experiments provided an early empirical approximation to binomial outcomes, with observed dominant-to-recessive ratios (e.g., 3:1) aligning with expected segregation probabilities modeled as Bin(n, p=0.75) for dominant traits.^[51] However, R.A. Fisher's 1936 reanalysis showed Mendel's aggregated data across 84 experiments deviated minimally from expectations—far closer than simulated binomial variates—indicating potential unconscious selection bias rather than pure randomness, though the overall patterns supported underlying genetic mechanisms.^[52] In machine learning for binary classification, the binomial distribution facilitates hypothesis testing on aggregated prediction successes, such as verifying if a model's accuracy exceeds a baseline via Bin(n, p) where n is the test set size.^[53] Recent applications, as of 2024, include exact binomial intervals for error rates in imbalanced datasets and generative modeling of Bernoulli trial sequences to simulate training outcomes.^[54]^[55] Empirical applications often encounter violations of binomial assumptions, including trial independence and fixed p, as in quality control where machine degradation induces dependence or drifting defect rates, or social datasets exhibiting network correlations.^[56]^[57] Such issues undermine causal inference from idealized models, favoring robust alternatives like clustered sampling adjustments. Exact binomial tests, deriving p-values directly from the probability mass function, outperform asymptotic normal approximations for small n or p near 0 or 1, avoiding coverage errors in confidence intervals and providing precise inference without continuity corrections.^[58]^[59]^[60]

Computer Science

Binomial Data Structures

Binomial heaps constitute a class of mergeable priority queue data structures composed of disjoint binomial trees, each satisfying the min-heap property where parent keys are less than or equal to child keys.^[61] Introduced by Jean Vuillemin in 1978, they enable efficient merging of heaps, distinguishing them from binary heaps by supporting union operations without rebuilding the entire structure.^[62] A binomial heap with n elements contains at most ⌊log₂ n⌋ + 1 trees, ensuring no two trees share the same order, which facilitates logarithmic-time manipulations.^[63] The foundational component, a binomial tree of order k (denoted Bₖ), is recursively defined: B₀ is a single node, and Bₖ consists of a root with k children that are roots of B₀ through B_{k-1}, totaling 2ᵏ nodes.^[61] This structure arises from repeated linking of smaller trees, where linking two Bₖ trees attaches the root with the larger key as a child of the smaller-key root, preserving the heap order. Binomial heaps represent the collection as a forest linked by pointers, often maintaining a root list sorted by order for efficient access.^[64] Core operations achieve O(log n) worst-case time complexity. Insertion adds a B₀ tree and merges via carry-like propagation, similar to binary addition, resolving order conflicts by linking. Union merges two heaps by combining roots of identical orders and propagating as needed, bounded by the maximum order difference of O(log n). Extract-min identifies the minimum root in O(log n) by scanning roots, removes it, and merges its children forest into the heap. Decrease-key on a node bubbles up via rotations or swaps, also O(log n).^[65]^[66] Binomial trees serve as the basis for Fibonacci heaps, which extend the structure by allowing multiple trees of the same degree and lazy deletions to achieve amortized O(1) decrease-key and O(log n) extract-min, improving over binomial heaps' worst-case bounds for sequences of operations.^[67] In Fibonacci heaps, trees deviate from strict binomial form through cascading cuts and consolidations, but retain binomial-like linking for amortization analysis via potential functions tracking unlinked children.^[68] In graph algorithms such as Dijkstra's shortest-path or Prim's minimum spanning tree, binomial heaps support efficient priority queue updates, theoretically outperforming binary heaps in merge-intensive scenarios. However, empirical benchmarks on sparse graphs reveal binary heaps often yield superior runtime due to smaller constants and better cache locality, with binomial heaps showing 1.5–2x slowdowns in extract-min heavy workloads despite comparable asymptotic guarantees.^[69] Their utility persists in parallel or distributed settings requiring frequent heap unions, as verified in implementations for network routing simulations.

Algorithmic Uses

The dynamic programming paradigm leverages the recurrence relation for binomial coefficients, C(n, k) = C(n-1, k-1) + C(n-1, k), to compute values efficiently by building a triangular table from base cases C(n, 0) = 1 and C(n, n) = 1, achieving O(n^2) time and space complexity rather than the exponential cost of naive recursion.^[70]^[71] This method optimizes combinatorial problem-solving by enabling rapid enumeration of combinations in algorithms for tasks like path counting in grids or subset selections, where direct factorial computations would be prohibitive due to intermediate overflow and high arithmetic cost.^[70] In broader optimization scenarios, binomial coefficients integrate into dynamic programming frameworks for solving problems reducible to additive recurrences, such as optimizing decision trees or resource partitioning, by representing the number of ways to achieve partial solutions.^[71] For instance, preprocessing binomial tables facilitates faster queries in competitive programming challenges involving modular arithmetic, where algorithms compute C(n, k) \mod p using prebuilt structures to avoid repeated calculations.^[70] Recent advancements in parallel computing address scalability for large-scale binomial computations; a GPU-based dynamic programming implementation distributes the table-filling across threads, yielding speedups of up to 10x for n > 10^4 compared to CPU serial execution, though limited by memory bandwidth in worst-case dense tables.^[72] Empirical benchmarks reveal that while theoretical O(n^2) suggests broad applicability, practical runtimes on standard hardware exceed seconds for n \approx 10^5 due to cache misses and space overhead, prompting hybrid approaches with approximations like Stirling's formula for n > 10^6, which trade precision for feasibility in causal scalability analyses.^[71]^[73] These findings underscore limits in theoretical optimism, as full-precision DP fails empirically beyond hardware constraints without modular reductions or sparse optimizations.^[73]

Linguistics

Binomial Expressions

Binomial expressions consist of two words or phrases from the same syntactic category linked by a conjunction, typically "and," to form coordinated pairs that convey semantic duality through contrast, complementarity, or reinforcement, such as "trial and error" or "peace and quiet." These structures exhibit fixed or preferred ordering in many cases, reflecting conventionalized patterns in English usage rather than arbitrary arrangement.^[74]^[75] Irreversible binomials maintain a rigid order that resists reversal without altering idiomatic meaning or naturalness, as in "kith and kin" versus the infelicitous "kin and kith," while reversible binomials permit flexible ordering depending on context, such as "cats and dogs" or "dogs and cats" in non-idiomatic descriptions. Corpus analyses of over 500 high-frequency binomials from the British National Corpus indicate that the vast majority exhibit some degree of reversibility along a continuum, though irreversibility predominates in entrenched idioms due to repeated usage entrenching specific sequences.^[74] Ordering constraints, tested across semantic, phonological, and frequency factors, show semantic principles—such as placing concrete or prototypical terms first—exert primary influence, followed by metrical and phonological preferences like shorter words preceding longer ones or those with more consonants yielding to vowel-initial forms.^[74]^[76] These expressions frequently occur in English idioms, where duality underscores binary oppositions or habitual pairings, enhancing memorability through rhythmic and associative reinforcement observable in large-scale corpus frequencies. Empirical studies confirm semantic constraints outperform phonological ones in predicting order for novel or less frozen pairs, suggesting cognitive prioritization of conceptual hierarchy over sound patterns alone.^[74]^[77] Historically, binomial expressions in English draw from classical rhetorical traditions, including devices like hendiadys for emphatic duality, evolving through adaptation in medieval texts to proliferate in Early Modern English (1500–1800) across formal and informal registers for stylistic elaboration. Frequency surged in this period, with binomials serving persuasive and enumerative functions in prose and verse, reflecting broader cultural preferences for paired formulations over single terms.^[78]^[79] In cognitive processing, the duality of binomials facilitates rapid comprehension via pre-activation of expected orders, grounded in usage-based frequency that strengthens neural associations for irreversible forms, as evidenced in bilingual studies where L1 conventions influence L2 binomial recognition speeds. This aligns with causal mechanisms where repeated exposure to ordered pairs entrenches preferences, reducing processing load through predictable syntactic-semantic alignment rather than compositional derivation.^[74]

Biology

Binomial Nomenclature

Binomial nomenclature is a systematic method for naming species in biology, consisting of two Latin or Latinized words: the capitalized genus name followed by the uncapitalized specific epithet, both italicized to denote the binomen. Developed by Swedish naturalist Carl Linnaeus, the system was first applied comprehensively to plants in his 1753 publication Species Plantarum, which described over 5,900 species using this two-part format, and extended to animals in the 1758 tenth edition of Systema Naturae.^[80]^[81] This approach replaced earlier polynomial descriptions, which were lengthy and variable, with a concise, standardized identifier that reflects hierarchical classification based on observable morphological similarities. The structure ensures each species has a unique, stable name, such as Homo sapiens for modern humans, where the genus Homo groups related taxa and the epithet sapiens specifies the particular species. Linnaeus's innovation stemmed from empirical observations of natural affinities, aiming to catalog organisms reproducibly for scientific exchange. The system's precision derives from its grammatical rules, drawn from classical Latin, which minimize ambiguity and support causal inference in taxonomy by linking names to type specimens and diagnostic traits. Governance occurs through dedicated codes: the International Code of Zoological Nomenclature (ICZN), which enforces binominal naming for animal species to promote stability and resolve nomenclatural disputes via priority and validity criteria, and the International Code of Nomenclature for algae, fungi, and plants (ICN), which similarly mandates binomials for botanical taxa while allowing for descriptive epithets based on locality or attributes.^[82]^[83]^[84] These codes, revised periodically by international commissions, ensure global applicability and have enabled consistent documentation across diverse ecosystems. Its universality facilitates cross-cultural scientific communication, as a single binomen refers unambiguously to a species regardless of local vernaculars, which often vary or overlap (e.g., multiple species called "finch" in English). This precision supports empirical biodiversity assessments, allowing researchers to track distributions, evolutionary lineages, and conservation statuses through shared nomenclature in databases and publications. Adoption is evidenced by its mandatory use in peer-reviewed taxonomy since the 18th century, underpinning the description of over 1.9 million species in comprehensive catalogs as of 2020.^[85]

Implementation and Criticisms

Following Carl Linnaeus's introduction of binomial nomenclature in the mid-18th century, its widespread adoption by the end of that century standardized the naming of newly discovered organisms amid expanding biological exploration, replacing inconsistent polynomial descriptions with concise, two-part Latinized identifiers.^[86] This shift facilitated international communication among scientists, as evidenced by the subsequent development of formal codes: the International Code of Zoological Nomenclature (ICZN), ratified in 1905 following international congresses starting in 1895, and the International Code of Nomenclature for algae, fungi, and plants (ICN), evolving from 1867 agreements.^[86] These codes enforced rules for priority, stability, and validity, reducing naming disputes; for instance, the principle of priority ensures the earliest valid description prevails, minimizing redundancy.^[87] In modern implementation, digital repositories like the Integrated Taxonomic Information System (ITIS), launched in 1996 as a collaborative U.S.-Canadian effort, compile and disseminate standardized binomial names for over 900,000 species, integrating data from global taxonomic authorities to support biodiversity research and policy.^[88] ITIS applies Linnaean hierarchy while cross-referencing synonyms and common names, enabling efficient queries; as of 2023, it includes taxonomic serial numbers (TSNs) for precise tracking, with updates reflecting peer-reviewed revisions.^[88] Similar databases, such as the Catalogue of Life, aggregate billions of occurrence records under binomial frameworks, demonstrating practical utility in aggregating empirical data from field collections and genetic sequencing.^[86] Criticisms of binomial nomenclature center on its hierarchical rigidity clashing with cladistic principles, which prioritize monophyletic groups (clades sharing a common ancestor and all descendants) over traditional taxa that may be paraphyletic.^[89] For example, groups like Reptilia, excluding birds despite shared ancestry, are paraphyletic under phylogenetic analysis but retained in nomenclature for practical continuity, leading to incongruences where cladograms reject 20-50% of taxonomic classifications in studied plant and animal lineages.^[90] This mismatch arises because binomial names embed rank-based assumptions (e.g., genus-species) not inherent to evolutionary trees, prompting calls for rank-free alternatives like the PhyloCode, though adoption remains limited due to disruption risks.^[89] Hybrid naming poses additional challenges, as interspecific crosses do not fit neatly into binomial species concepts; the ICN and ICZN denote hybrids with a multiplication sign (×), as in Quercus × acerifolia, but this extends beyond strict binomials to denote parentage, complicating stability since hybrids may lack consistent morphology or fertility.^[91] Empirical data show high revision rates for hybrid taxa, with up to 30% of botanical names in certain genera altered due to re-evaluations of hybrid origins via molecular markers, undermining the system's goal of permanence.^[92] Despite these limitations, binomial nomenclature's empirical strength lies in verifiable reduction of ambiguity over vernacular names; pre-Linnaean systems yielded multiple synonyms per organism, whereas post-adoption analyses indicate over 90% consistency in name usage across global databases for well-studied taxa, prioritizing communicative utility over perfect phylogenetic fidelity.^[92] Cladistic overemphasis risks impractical fragmentation, as evidenced by stalled PhyloCode implementation, whereas the Linnaean approach sustains causal realism in applied fields like conservation, where stable identifiers link to ecological data without requiring constant reclassification.^[86] Revisions, while frequent (e.g., 10-15% of species names updated per decade in active groups like insects), are governed by evidence thresholds, balancing innovation with stability.^[92]

Finance

Binomial Pricing Models

The Cox-Ross-Rubinstein (CRR) model, published in 1979, provides a discrete-time lattice framework for pricing options by approximating the underlying asset's price movements as binomial up or down steps over multiple periods.^[93] In this approach, the up factor u and down factor d are set to match the asset's volatility, typically as u = e^{\sigma \sqrt{\Delta t}} and d = 1/u, where \sigma is the volatility and \Delta t is the time step, ensuring the lattice recombines to reduce computational complexity.^[93] Option payoffs are calculated backward from maturity, applying risk-neutral probabilities p = (e^{r \Delta t} - d)/(u - d) and (1-p) for up and down moves, respectively, with r as the risk-free rate, to compute discounted expected values under no-arbitrage conditions.^[93] This risk-neutral valuation derives from the principle that derivative prices equal the expected value of future payoffs discounted at the risk-free rate, assuming investors are indifferent to risk in the pricing measure, which enables hedging replication without specifying preferences.^[93] The model's recombining tree structure causally links discrete price paths to continuous diffusion limits, converging to the Black-Scholes formula as the number of steps n \to \infty, with convergence rate depending on the central limit theorem applied to the binomial distribution approximating lognormal returns.^[93] Empirically, binomial models are calibrated to implied volatilities from market option prices, adjusting parameters to fit observed term structures, as demonstrated in backtests on equity indices where multi-step lattices (e.g., 100+ steps) yield pricing errors under 1% for at-the-money European calls on S&P 500 data from 1990-2000.^[94] For American options, the backward induction accommodates early exercise boundaries, outperforming Black-Scholes in accuracy for dividend-paying stocks, with studies showing binomial prices deviating by less than 2% from market quotes for options with maturities up to 2 years on tech sector calls during 2010-2020.^[95] Limitations arise from finite-step approximations, where non-lognormal features like volatility skew introduce biases; for instance, CRR underprices out-of-the-money puts by 5-10% in empirical tests on historical volatility surfaces without adjustments, as the constant volatility assumption fails to capture stochastic variance observed in data. ^[97] Transaction costs and non-recombining paths in extensions further degrade hedging efficacy, with backtests indicating cumulative errors exceeding 3% over multi-year horizons due to model misspecification relative to actual jump-diffusion dynamics. Despite these, the model's arbitrage-free foundation supports robust valuation for path-dependent derivatives when calibrated to empirical volatilities exceeding 20% in high-volatility regimes.^[94]

Politics and Electoral Systems

Binomial Voting Mechanisms

Binomial voting mechanisms entail electoral districts electing exactly two legislative representatives, with seats allocated via formulas that prioritize the leading vote recipient and the runner-up to ensure dual representation within localized constituencies. These systems commonly adapt highest averages methods, such as the D'Hondt formula, where initial quotients (votes divided by 1) determine the first seat for the top list, and subsequent quotients (including the leader's votes divided by 2) compete for the second seat.637966_EN.pdf)^[98] This results in the leading group claiming both seats only if its halved vote share exceeds the runner-up's full share, establishing a dominance threshold around 66.7% for the leader.^[98] The core design logic balances majoritarian control with minimal proportionality, compelling voters' preferences to manifest as a primary winner alongside a viable secondary voice, while district magnitude of two inherently disadvantages third or smaller contenders due to the limited seats available.^[99] In theoretical terms for duopolistic party landscapes, outcomes approximate vote-seat proportionality—e.g., a 55-45 split yields one seat each—yet the method's bias toward larger lists reinforces coalition-building over splintering, as effective vote thresholds for the second seat demand substantial consolidation to outpace the leader's secondary quotient.637966_EN.pdf) This structure causally links low-magnitude multimember districts to reduced party fragmentation, as mechanical effects penalize dispersed votes, fostering environments where broader alliances predominate and governance pivots on negotiated majorities rather than myriad veto players.^[100] Such mechanisms inherently trade fuller proportionality for systemic stability, as evidenced by district magnitude's inverse relation to effective party numbers: magnitudes of two yield more concentrated legislatures than single-member plurality (which excludes runners-up entirely) but avert the proliferation of micro-parties seen in higher-magnitude PR systems.^[99]^[100] By design, they incentivize pre-electoral pacts, stabilizing post-election bargaining while anchoring representation to district-level majorities and oppositions, though this can amplify disproportionality if vote shares skew heavily toward one side. Historical implementations beyond specific national variants include two-member districts in U.S. state legislatures through the mid-20th century, where plurality block voting similarly elevated the top two candidates, promoting localized bipolar competition until judicial challenges favored single-member districts for equal protection reasons.

Chilean Binomial System: History and Effects

The binomial electoral system was implemented for Chile's first post-dictatorship legislative elections on December 14, 1989, as part of the transitional arrangements following General Augusto Pinochet's defeat in the October 5, 1988 plebiscite, which rejected his continued rule under the 1980 Constitution. This framework, designed by the military regime, divided the country into 60 two-member districts for the Chamber of Deputies (and initially 38 for the Senate, reduced to 19 multi-member districts post-1989 amendments), awarding both seats in a district to the leading coalition only if it doubled the second-place votes; otherwise, seats split one each. The threshold effectively privileged large coalitions holding at least 33% of district votes, serving as a safeguard for conservative forces against a fragmented opposition, with the system's origins traceable to regime strategists aiming to embed veto protections in the democratic handover.^[101]^[102] Between 1989 and 2013, the system produced empirical patterns of seat allocation that disproportionately benefited the center-right Alianza por Chile coalition, particularly in competitive races where vote shares hovered near parity. In the 1989 Chamber elections, the center-left Concertación coalition captured 49.5% of list votes but secured 72 of 120 seats (60%), while right-wing parties with 34.5% votes obtained 48 seats (40%), reflecting initial majoritarian bias toward the victors; however, as Concertación's margins narrowed, Alianza's underrepresentation reversed. By 2001, Alianza garnered 42.5% of votes yet claimed 48% of seats, and in 2009, with 41% popular support, it held 49% of Chamber seats, as seat-vote curve analyses confirm a structural bias amplifying minority coalitions' legislative weight when exceeding the 33% threshold without opposition fragmentation.^[103]^[104]^[105] These distortions fostered post-1990 stability by institutionalizing minority veto powers, which constrained Concertación governments (1990-2010) from enacting unilateral reforms despite presidential majorities, necessitating cross-aisle pacts on fiscal and social policies amid economic liberalization. This dynamic supported Chile's average annual GDP growth of 5.3% from 1990-2013, higher than regional peers, by averting populist reversals and promoting incremental consensus over ideological swings, though it entrenched bipartism at the expense of smaller parties' access. Empirical studies attribute the system's role in mitigating post-authoritarian volatility to its enforcement of disciplined coalitions, enabling sustained investor confidence and institutional continuity despite underlying vote-seat disproportionality.^[106]^[101]

Empirical Outcomes and Debates

The Chilean binomial electoral system produced notable disproportionality in legislative representation, as quantified by the Gallagher least-squares index, which measures the deviation between vote shares and seat allocations; values under the system frequently ranged from 6 to 12, higher than in many proportional systems and indicative of systematic bias favoring larger coalitions.^[107]^[103] This distortion particularly underrepresented left-leaning parties and smaller groups, with the right-wing coalition often securing over 50% of seats despite receiving around 40-45% of votes in post-transition elections from 1993 to 2013.^[108]^[104] In response to these imbalances, the system was abolished via legislative reform on January 20, 2015, replacing it with the D'Hondt method of proportional representation to enhance seat-vote alignment and accommodate the Nueva Mayoría coalition's demands for fairer outcomes.^[109]^[110] Post-reform elections demonstrated reduced disproportionality, with Gallagher indices dropping below 5 in subsequent cycles, though debates persist on whether the change fully mitigated prior biases or introduced new fragmentation risks.^[103] Critiques from left-wing perspectives framed the binomial design as inherently anti-democratic, engineered under authoritarian rule to entrench conservative overrepresentation and suppress pluralistic representation, exacerbating perceptions of illegitimacy and contributing to lower voter turnout rates, which hovered around 80-85% in the 1990s-2000s compared to regional averages.^[111]^[112] Defenders, often from the right, argued it promoted governance stability by incentivizing broad coalitions between the two major alliances—Concertación and Alianza—reducing electoral extremism and enabling policy continuity, such as the sustained implementation of market-oriented economic reforms initiated in the 1990s, including pension privatization and trade liberalization, which correlated with Chile's GDP growth averaging 5% annually from 1990-2010.^[111]^[104] These coalitions fostered compromise, limiting radical shifts and maintaining fiscal discipline, though at the cost of diluting smaller parties' influence.^[113] Empirical analyses link the system's two-seat districts to strong incentives for pre-electoral pacts, which stabilized cabinets but also entrenched a duopolistic party dynamic, potentially stifling innovation; post-2015 data shows increased multipartism but higher legislative gridlock, challenging claims of unalloyed improvement in democratic responsiveness.^[103]^[104]

References

[1]
7.5 - The Binomial Theorem
A binomial is a polynomial with two terms. We're going to look at the Binomial Expansion Theorem, a shortcut method of raising a binomial to a power.
[2]
Tutorial 54: The Binomial Theorem - West Texas A&M University
May 19, 2011 · This theorem gives us a formula that enables us to find the expansion of a binomial raised to a power, without having to multiply the whole ...
[3]
Calculus II - Binomial Series - Pauls Online Math Notes
Nov 16, 2022 · In this section we will give the Binomial Theorem and illustrate how it can be used to quickly expand terms in the form (a+b)^n when n is an ...
[4]
Binomial Coefficient -- from Wolfram MathWorld
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number.
[5]
1.3 Binomial coefficients
The entries in Pascal's Triangle are the coefficients of the polynomial produced by raising a binomial to an integer power.Missing: definition | Show results with:definition
[6]
How Isaac Newton Discovered the Binomial Power Series
Aug 31, 2022 · He recounts how he made a major discovery equating areas under curves with infinite sums by a process of guessing and checking.
[7]
Binomial - Etymology, Origin & Meaning
Originating in the 1550s from Late Latin binomius, meaning "two names," binomial refers to an algebraic expression with two terms or a two-term scientific ...
[8]
BINOMIAL Definition & Meaning - Merriam-Webster
The meaning of BINOMIAL is a mathematical expression consisting of two terms connected by a plus sign or minus sign. How to use binomial in a sentence.
[9]
BINOMIAL Definition & Meaning - Dictionary.com
Binomial definition: an expression that is a sum or difference of two terms, as 3 x + 2 y and x 2 − 4 x.. See examples of BINOMIAL used in a sentence.Missing: etymology | Show results with:etymology
[10]
[PDF] The Story of the Binomial Theorem
The Binomial Theorem, familiar at least in its elemen- tary aspects to every student of algebra, has a long and reasonably plain his- tory. Most people ...
[11]
monomials, binomials, trinomials, polynomials - BYJU'S
A monomial has a single term, a binomial has two terms, a trinomial has three terms and a polynomial has one or more than one term. Q2. What are the examples of ...Missing: distinction | Show results with:distinction
[12]
Binomial Definition (Illustrated Mathematics Dictionary) - Math is Fun
Illustrated definition of Binomial: A polynomial with two terms. Example: 3x2 + 2.
[13]
Binomial - Meaning, Coefficient, Factoring, Examples - Cuemath
A binomial is an algebraic expression that has two terms. In other words, an algebraic expression consisting of two unlike terms having constants and variables ...
[14]
Binomial Definition - BYJU'S
Oct 22, 2020 · The algebraic expression which contains only two terms is called binomial. It is a two-term polynomial. Also, it is called a sum or difference ...
[15]
Binomial Definition, Calculation & Examples - Lesson - Study.com
The Latin prefix "bi-" means "two", the root "nom" means name, and the suffix "-ial" means "of or relating to". The literal translation of the word binomial ...
[16]
Operations on Polynomials | Beginning Algebra - Lumen Learning
Multiplying polynomials involves applying the rules of exponents and the distributive property to simplify the product. Polynomial multiplication can be useful ...
[17]
Multiplying binomials (video) - Khan Academy
Jun 14, 2012 · People who do this are treating the terms (items being added) as if they were factors ... multiply this binomial. But lets just apply FOIL. So First says just ...
[18]
Tutorial 7: Factoring Polynomials - West Texas A&M University
Dec 13, 2009 · Factoring is to write an expression as a product of factors. For example, we can write 10 as (5)(2), where 5 and 2 are called factors of 10.
[19]
11.3.2: Operations with Polynomials - Mathematics LibreTexts
Dec 15, 2024 · To multiply a monomial by a binomial, you use the distributive property in the same way as multiplying polynomials with one variable. Example.
[20]
History - Polynomials
§ In the early 16th century, Italian mathematicians Scipone del Ferro, Niccoló Tartaglia, and Gerolamo Cordano were able to solve the general cubic equation in ...
[21]
(PDF) Polynomials and equations in medieval Italian algebra
Aug 6, 2025 · In short, polynomials were regarded as aggregations of the different species (powers) of the unknown, and medieval algebraists preferred to set ...
[22]
(PDF) Irrational "coefficients" in Renaissance algebra - Academia.edu
The introduction of irrational coefficients marked a shift in algebraic notation starting in 16th-century Europe. Premodern algebraists limited coefficients to ...
[23]
Binomial Theorem - Formula, Expansion, Proof, Examples - Cuemath
The binomial theorem states the principle for expanding the algebraic expression (x + y) n and expresses it as a sum of the terms involving individual ...
[24]
https://artofproblemsolving.com/wiki/index.php/Binomial_Theorem
[25]
Binomial theorem from first principles? - Math Stack Exchange
Mar 14, 2021 · Here is one way to understand the binomial theorem that doesn't use induction. I'll explain the links between this and probability at the end of this post.How can the binomial theorem be proved? - Math Stack ExchangeProof of binomial theorem for non-integers - Math Stack ExchangeMore results from math.stackexchange.com
[26]
[PDF] The Binomial Series of Isaac Newton - quadrivium.info
These series appear in this form in the letters (1676) to Oldenburg in which. Newton explained his binomial series at the request of Leibniz (Callinger, 1982; ...
[27]
Fractional Binomial Theorem | Brilliant Math & Science Wiki
The binomial theorem for integer exponents can be generalized to fractional exponents. The associated Maclaurin series give rise to some interesting identities.
[28]
Binomial coefficient - StatLect
In combinatorics, the binomial coefficient is used to denote the number of possible ways to choose a subset of objects of a given numerosity from a larger set.
[29]
2.4: Combinations and the Binomial Theorem - Math LibreTexts
Aug 16, 2021 · The binomial coefficient ( n k ) represents the number of combinations of n objects taken k at a time, and is read “ n choose k . ” We would now ...
[30]
[PDF] 3 Properties of Binomial Coefficients - Clemson University
Here is the famous recursive formula for binomial coefficients. ... Binomial coefficients can be arranged in what is called Pascal's triangle (even though.
[31]
Binomial Coefficients - Discrete Mathematics
Here are some apparently different discrete objects we can count: subsets, bit strings, lattice paths, and binomial coefficients.
[32]
[PDF] MAT344 Lecture 4
May 16, 2019 · A lattice path in the plane is a curve made up of line segments that either go from a point (i, j) to the point (i + 1,j) or from a point (i, j) ...
[33]
[PDF] Ordinary Generating Functions - UCSD Math
... Binomial coefficients Let's use the binomial coefficients to get some prac- tice. Set ak,n = n k . Remember that ak,n = 0 for k > n. From the Binomial Theorem,.
[34]
Binomial Distribution - Online Statistics Book
When you flip a coin, there are two possible outcomes: heads and tails. Each outcome has a fixed probability, the same from trial to trial. In the case of coins ...
[35]
Special Distributions | Bernoulli Distribution | Binomial Distribution
A Bernoulli random variable is a random variable that can only take two possible values, usually 0 and 1.
[36]
[PDF] The Binomial distribution Outline Coin tossing example Tossing an ...
We have n coin tosses, with probability p of Heads. We conduct the trials independently. What is the probability of getting exactly j Heads? IP{Y = j} =.
[37]
How random is the toss of a coin? - PMC - NIH
Dec 8, 2009 · The toss of a coin has been a method used to determine random outcomes for centuries. It is still used in some research studies as a method of randomization.
[38]
[PDF] Chapter 3
RS - Chapter 3 - Moments. 5. Example: The Binomial distribution. Let X be a discrete random variable having the Binomial distribution --i.e.,. X = the number ...
[39]
[PDF] 1 I. COMMON DISTRIBUTIONS 3 II. MOMENTS OF A ...
Limit of a binomial distribution as n→inf, p → 0. λ = rate per unit of ... Skewness and Kurtosis: Let mn be the nth central moment of a r.v. X.
[40]
[PDF] Handbook on probability distributions - Rice Statistics
This handbook covers discrete, continuous, and multivariate probability distributions, focusing on definition, estimation, and application.
[41]
28.1 - Normal Approximation to Binomial | STAT 414
We will now focus on using the normal distribution to approximate binomial probabilities. The Central Limit Theorem is the tool that allows us to do so.
[42]
[PDF] STAT 516 - Central Limit Theorem
Apr 7, 2020 · Normal approximation to Binomial:de Moivre-Laplace. Central Limit Theorem. ▷ Let X = Xn ∼ Bin(n,p). Then, for any fixed p and real-valued x.
[43]
The Connection Between the Poisson and Binomial Distributions
As a rule of thumb, if n ≥ 100 and n p ≤ 10 , the Poisson distribution (taking λ = n p ) can provide a very good approximation to the binomial distribution.
[44]
Lesson 16: Chi-Square Goodness-of-Fit Tests - STAT ONLINE
The general rule of thumb is that the expected number of successes must be at least 5 (that is, ) and the expected number of failures must be at least 5 (that ...
[45]
Binomial Distribution - an overview | ScienceDirect Topics
A simple example from quality control: the probability, estimated by the relative frequency, of finding a defective sample in a batch is 0.02. One can use the ...
[46]
How does the concept of binomial distribution apply to quality control?
May 10, 2024 · The binomial distribution in quality control models the probability of success/failure outcomes. It is used in defect analysis, acceptance ...Missing: empirical | Show results with:empirical
[47]
(PDF) Decision-Making Research on Supply Chain Quality ...
This study proposes a quality inspection method combining binomial distribution and Monte Carlo simulation for enterprise production processes.
[48]
https://towardsdatascience.com/a-b-testing-a-complete-guide-to-statistical-testing-e3f1db140499
[49]
Binomial test and 95% confidence interval (CI) using SPSS Statistics
Feb 13, 2020 · For example, a restaurant is launching a new menu, which will include adding a "bread and butter pudding" to the dessert menu. The chef creates ...
[50]
Understanding A/B Testing and Statistics Behind
Mar 12, 2017 · There are multiple ways to implement binomial test in R. We tried three of them. In [2]:. # method 1: use binom.test binom.test(x=65, n=100 ...
[51]
Mendel's pea crosses: varieties, traits and statistics - PubMed Central
Oct 31, 2019 · From this binomial distribution it is clear that two values, for le ... data for Mendel's experiments 1 and 2 are for the combined values.
[52]
Binomial distribution | Probability, Statistics & Mathematics - Britannica
Fisher observed that Mendel's laws of inheritance would dictate that the number of yellow peas in one of Mendel's experiments would have a binomial distribution ...
[53]
Binomial Distribution: 4 Useful Applications in ML - Data Science Dojo
Aug 21, 2024 · Role of Binomial Distribution in Machine Learning · Binary Classification · Hypothesis Testing · Generative Models · Monte Carlo Simulations.
[54]
Binomial Distribution: A Complete Guide with Examples - DataCamp
Aug 23, 2024 · A binomial distribution is a discrete probability distribution that models the count of successes in a set number of independent trials.Missing: empirical | Show results with:empirical
[55]
A machine learning based variable selection algorithm for binary ...
Jan 16, 2025 · The binomial probability distribution is used to generate simulated data set consisting of 5000 observations and 100 categorical predictors ...
[56]
Interpreting the Binomial Distribution in Real-World Contexts
Sep 30, 2025 · In quality control, machine wear-out may increase defect rates over time. When p changes from trial to trial, the binomial model becomes less ...
[57]
The Three Assumptions of the Binomial Distribution - Statology
Aug 14, 2021 · We assume that each trial only has possible two outcomes. For example, if we flip a coin 100 times, each time there can only be two possible ...
[58]
Exact test of goodness-of-fit - Handbook of Biological Statistics
Jul 20, 2015 · The most common use of an exact binomial test is when the null hypothesis is that numbers of the two outcomes are equal. In that case, the ...
[59]
https://users.stat.umn.edu/~rend0020/5915_2021/inference-on-proportions.html
[60]
[PDF] Lecture 18 - Biostatistics
Hypothesis tests for binomial proportions. • Consider testing H0 : p = p0 ... • Inverting the exact binomial test yields an exact binomial interval for ...
[61]
[PDF] Binomial Queues - cs.Princeton
Binomial queues, invented by Jean Vuillemin in 1978, allow all of these operations (including join) in O(log N) time. The imperative implementation has cost ...
[62]
A data structure for manipulating priority queues - ACM Digital Library
A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, ...
[63]
[PDF] A Data Structure for Manipulating Priority Queues
This is called the "heap condition" by Knuth [17], and it arises through the natural "contraction" of perfect tournaments as shown in Figures 4(a) and 4(b).
[64]
Implementation and Analysis of Binomial Queue Algorithms
The binomial queue, a new data structure for implementing priority queues that can be efficiently merged, was recently discovered by Jean Vuillemin.
[65]
[PDF] 19 Binomial Heaps
In particular, the UNION operation takes only O(lg n) time to merge two binomial heaps with a total of n elements.
[66]
[PDF] Binomial Heap - IIITDM Kancheepuram
Insert and extract min can be done in O(log n) time. Merging of two heaps can be done in O(log n) in worst case, whereas classical heap incurs O(n).<|separator|>
[67]
[PDF] Fibonacci Heaps
A binomial tree of order k is a single node whose children are binomial trees of order 0, 1, 2, …, k – 1. ○. Here are the first few binomial trees: 0. 0. 1.
[68]
[PDF] Binomial & Fibonacci Heaps and Amortized Analysis Main Reference
Set Ci = ∅. If exactly one of Ai,Bi,Ci 6= ∅ Set Ci to be that binomial tree. Link the Ci together to form the merged binomial heap. Let k = lg(|H1 + |H2|).
[69]
[PDF] A Performance Study of Priority Queues: Binary Heap, Fibonacci ...
The results demonstrate that the Binary Heap achieves the best execution time and cache performance across the evaluated graphs. Keywords: Binary Heap, ...
[70]
Binomial Coefficients - Algorithms for Competitive Programming
Oct 22, 2024 · Binomial coefficients are the number of ways to select a set of elements from different elements without taking into account the order of arrangement of these ...
[71]
Fast computation of binomial coefficients | Numerical Algorithms
Mar 19, 2020 · In the present paper, we review numerical methods to compute the binomial coefficients: Pascal's recursive method; prime factorization to cancel out terms; ...Missing: empirical runtime
[72]
[PDF] Accelerated Parallel Generation of Binomial Coefficients using GPU
In this paper a parallel implementation of dynamic programming algorithm for generating Binomial coefficients on GPU has been proposed. Though the proposed ...
[73]
A Fast Algorithm for Computing Binomial Coefficients Modulo ... - NIH
The algorithm consists of a preprocessing stage, after which any number of binomial coefficients can be computed modulo 2N (or modulo any number 2Q with 0 ≤ Q ...
[74]
Revisiting binomial order in English: ordering constraints and ...
Feb 17, 2012 · The vast majority of English binomials is reversible to a smaller or larger degree. Reversibility scores were computed for all binomials in ...
[75]
The (Ir)Reversibility of English Binomials: Corpus, Constraints ...
This book focuses on binomials (word pairs such as heart and soul , rich and poor , or if and when ), and in particular on the degree of reversibility that ...
[76]
[PDF] Competing Semantic and Phonological Constraints in Novel Binomials
This research found that semantic constraints had the most influence over word ordering, followed by metric constraints, word frequency, and finally ...
[77]
[PDF] The (Ir)reversibility of English Binomials. Corpus, constraints ...
Chapter 5 is concerned with the diachronic perspective on binomial revers- ibility. After a brief review of historical linguistic work on binomials, it sets out.
[78]
Hendiadys as Part of Binomials: Historical Genesis and Distinctive ...
Thus, the aim of this paper is both to retrace the history of hendiadys as part of binomials from Old English to Present-Day English including the periods of ...
[79]
Early Modern English (Part III) - Binomials in the History of English
Jul 5, 2017 · The present study provides evidence that in the sixteenth and seventeenth centuries binomials are likewise abundant in less formal writings, ...
[80]
Kenneth Spencer Research Library Blog » Systema Naturae
May 18, 2015 · Spencer Library holds one of approximately thirty surviving copies of the first edition of Linnaeus' epoch-making Systema Naturae. Spencer's ...
[81]
Carl Linnaeus - Linda Hall Library
May 23, 2025 · It listed over 5900 species of plants from around the world, giving each a binomial name that was unique. It is the starting point, year 1, for ...
[82]
Article 5. Principle of Binominal Nomenclature
The system of nomenclature in which a species, but no taxon of any other rank, is denoted by a combination of two names (a binomen, q.v.). zoological ...
[83]
International Commission on Zoological Nomenclature
The ICZN is responsible for producing the International Code of Zoological Nomenclature - a set of rules for the naming of animals and the resolution of ...Bulletin of Zoological Nomenclature · The Code · ICZN Publications · About
[84]
International Code of Nomenclature for algae, fungi, and plants
Jul 21, 2025 · The International Code of Nomenclature for algae, fungi, and plants is the set of internationally agreed rules and recommendations that ...
[85]
Binomial nomenclature: Two names are better than one
May 6, 2020 · This prevents confusion that is often introduced by using common names. Binomial nomenclature uses Latin or Latinized adjectives or descriptive ...<|control11|><|separator|>
[86]
Twenty-First Century Biological Nomenclature—The Enduring ...
Adoption of a system of binomial nomenclature by end of the 18th century helped standardize the process of naming the wealth of new organisms collected during ...
[87]
Recontextualising the style of naming in nomenclature - Nature
Nov 18, 2021 · It has also been said that Linnaeus used the binomial method to honour his predecessors, however, there has been an occasion where he was ...<|separator|>
[88]
ITIS.gov | Integrated Taxonomic Information System (ITIS)
The Integrated Taxonomic Information System (ITIS, www.itis.gov) partners with specialists from around the world to assemble scientific names and their ...Missing: binomial | Show results with:binomial
[89]
Incongruence between cladistic and taxonomic systems
Sep 1, 2003 · Cladistic and taxonomic treatments of the same plant group usually exhibit a mixture of congruences and incongruences.Missing: binomial | Show results with:binomial
[90]
Incongruence between cladistic and taxonomic systems - PubMed
Another is the policy regarding paraphyletic groups: to ban them in cladistics but ignore the ban in taxonomy. These two differences automatically lead to ...<|separator|>
[91]
How to Write Scientific Names of Plants and Animals - AJE
Sep 14, 2022 · In the 1750s, Carl Linnaeus developed the system of binomial nomenclature (a two-part naming system) that we use today to name and classify ...Missing: implementation | Show results with:implementation
[92]
Stop using racist, unethical, and inappropriate names in taxonomy
Oct 30, 2024 · Yet, many in the field claim that extensive revisions could disrupt the stability of binomial nomenclature and the science that depends on it.Missing: rates | Show results with:rates
[93]
Option pricing: A simplified approach - ScienceDirect.com
This paper presents a simple discrete-time model for valuing options. ... The option to expand a project: its assessment with the binomial options pricing model.
[94]
A Binomial Tree-Based Empirical Study on the Biases of American ...
Based on the binomial tree model, this study empirically examines the pricing accuracy of American call options in both the technology sector and the ...
[95]
Black-Scholes vs. Binomial Model | Which Is Best for Options Traders?
Jan 31, 2025 · Binomial is the better model for getting more accuracy with long-dated options on securities that have dividend payments.
[96]
Understanding the Binomial Option Pricing Model - Investopedia
Aug 19, 2024 · While more computationally intensive, the binomial model can often provide more accurate prices than simpler models like Black-Scholes.
[97]
[PDF] The D'Hondt Method Explained Seat Allocation How it works
Suppose you are in charge of allocating seats to parties. Once the votes have all been cast and counted, you are faced with a group of parties each of which has ...
[98]
District Magnitude — - ACE Electoral Knowledge Network
Under any proportional system, the number of members to be chosen in each district determines, to a significant extent, how proportional the election results ...
[99]
Which electoral systems succeed at providing proportionality and ...
Jan 17, 2017 · Abstract. Electoral systems are typically faced with the problem of being asked to provide both proportional representation and party system ...
[100]
Origins of the Chilean Binominal Election System - SciELO Chile
The political regime the Aylwin government inherited from Pinochet differed markedly from the one established by the Constitution of 1925 that governed Chilean ...
[101]
(PDF) Origins of the Chilean Binominal Election System
Aug 5, 2025 · PDF | strategic reaction by the military regime to the defeat of General Augusto Pinochet in the 1988 Plebiscite since the system was ...Missing: implementation | Show results with:implementation
[102]
(PDF) Coalition incentives and party bias in Chile - ResearchGate
PDF | This article revisits the debate over Chile's binomial electoral rules and its consequences and examines how the new electoral system conceived by.Missing: distribution | Show results with:distribution
[103]
Coalition incentives and party bias in Chile - ScienceDirect.com
This article revisits the debate over Chile's binomial electoral rules and its consequences and examines how the new electoral system conceived by a democratic ...Missing: mechanisms | Show results with:mechanisms
[104]
https://www.sciencedirect.com/science/article/abs/pii/S0261379421000810
[105]
Continuity and Change in the Chilean Party System - Sage Journals
The party system consequences of Chile's “binomial” (two-member-district) legislative electoral formula have been the subject of much debate.
[106]
[PDF] Proportionality, disproportionality and electoral systems
The d'Hondt formula is concerned above all to minimize the over-representation of the most over-represented party. Giving A 4 seats (80 per cent) with 60 per ...
[107]
Here's the Bias! A (Re-)Reassessment of the Chilean Electoral System
In Chile, for example, before the country's transition to democracy in 1990, the authoritarian government of General August Pinochet designed and implemented an ...<|separator|>
[108]
Chile reforms Pinochet's voting system | Spain - EL PAÍS English
Jan 21, 2015 · The Chilean parliament overhauled its entire voting system on Tuesday when it approved legislation to replace the binomial system introduced by Augusto ...Missing: history implementation
[109]
Chile's 2015 Electoral Reform: Changing the Rules of the Game - jstor
A third objective was to improve the representativeness of the system. The binomial system did not clearly reflect majorities and minorities. Legislative ...<|separator|>
[110]
Electoral Engineering and Democratic Stability: The Legacy of ...
Such a system was designed to over represent the conservative forces in Chile in light of the electoral defeat suffered by Pinochet in the 1988 plebiscite ...
[111]
Crisis of Representation in Chile? The Institutional Connection
Dec 1, 2016 · 2 Democratic Transition, Protected Democracy Formal Political Institutions. Chile's post-authoritarian political and party context have deeply ...
[112]
[PDF] The Origins and Transformations of the Chilean Party System
Political parties have long been key institutions in the development and operation of. Chile's democracy. Their centrality and strength as vehicles for the ...