About 196,000 results
Open links in new tab
  1. co.combinatorics - Sum of combinations - MathOverflow

    If you are interested in approximations to your ratios, you may find the accepted answer (and some comments of mine) to this MathOverflow post useful: Sum of 'the first k' binomial …

  2. Combinations of multisets with finite multiplicities

    In addition to the OP's 2011 paper with Ž. Jurić: A New Formula for the Number of Combinations of Permutations of Multisets Applied Mathematical Sciences, Vol. 5, 2011, no. 18, 875-881 …

  3. Important formulas in combinatorics - MathOverflow

    Aug 17, 2015 · Zaslavsky's formula is a very important formula in enumerative combinatorics, as well as geometric combinatorics, and the basis for important developments in topological …

  4. Combination formula of $ (-1)^ {n-1}2 (n-1)!$ - MathOverflow

    Feb 17, 2025 · How to prove that $$\\sum_{b=0}^{[\\frac{n}{2}]}(-1)^{n-b-1}(n-b-1)!\\binom{n}{n-2b}\\frac{\\binom{2b}{2}\\binom{2b-2}{2}\\dots \\binom{2}{2}}{b!}2^{n-b}$$ equals ...

  5. Combination with repetition with limit - MathOverflow

    First component (for i = 0) is just a regular combination with repetition, then I subtract all that have at least 1 box overfilled, then I need to add those that have at least 2 box overfilled (since …

  6. Sum of 'the first $k$' binomial coefficients for fixed $N$

    One can take this a step further. In addition to combining pairs of terms of the original sum N choose i to get a sum of terms of the form N+1 choose 2j+c, where c is always 0 or always 1, …

  7. Creating a combinations with unique sets - MathOverflow

    0 I have been struggling with this problem and hope someone could help. I am trying a variation of non-repetitive combination scenario. I can use the formula n!/r!x (n-r)! to find non-repetitive …

  8. asymptotic or approximate formula for a combination expression

    asymptotic or approximate formula for a combination expression Ask Question Asked 12 years, 10 months ago Modified 12 years, 10 months ago

  9. Combinatorial\Probabilistic Proof of Stirling's Approximation

    The Wikipedia page List of probabilistic proofs of non-probabilistic theorems has a reference to the paper: Blyth, Colin R.; Pathak, Pramod K. A Note on Easy Proofs of Stirling's Theorem. …

  10. Source of a formula for tensor product multiplicities?

    May 10, 2013 · This is a follow-up to a recent question by Allen Knutson here, involving a special type of tensor product multiplicity for a simple Lie algebra $\\mathfrak{g}$ over $\\mathbb{C}$ …