Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with co.combinatorics
Search options not deleted
user 18702
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
2
votes
Accepted
Product of $q$-analogues
Recall Legendre's formula
$$ v_p(n!) = \sum_{s=1}^\infty\left\lfloor\frac n{p^s}\right\rfloor = \sum_{r=0}^\infty a_r[r]_p $$
where $n = \sum a_r p^r$ is the base-$p$ expansion of $n$.
A $q$-analogu …
- 1,838
8
votes
1
answer
294
views
Product of $q$-analogues
Background
Recall that the $q$-analogue $[n]_q\in\mathbb Z[q]$ of a natural number $n\in\mathbb N$ is defined as
$$ [n]_q := \frac{q^n -1}{q-1}$$
the idea being that formulas involving $q$ will speci …
- 1,838