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 enumerative-combinatorics
Search options not deleted
user 430031
3
votes
The number of boolean function with given Fourier degree
I wrote a Mathematica code snippet to count for cases of small $n$ and $d$.
n = 2;
inputWords = Tuples[{-1, 1}, n];
outputResults = Tuples[{-1, 1}, 2^n];
expr = {Product[1/2 (1 + Subscript[a, i] Subsc …
- 175
1
vote
Some ideas about parking functions and integer partitions
(1). Can we study the enumeration of separated parking functions with type $\lambda$? And how?
Clear["Global`*"];
NonAdjacentDuplicatesQ[p_List] :=
Module[{counts, duplicates, positions},
cou …
- 175
0
votes
Looking for q-analog of derangement anagrams for a word
Use $\textbf{Theorem 1.1}$ from [1],
The linearization coefficients of q-Laguerre polynomials are given by
$$
\mathcal{L}\left(L_{n_1}(x ; q, y) \cdots L_{n_k}(x ; q, y)\right)=\sum_{\sigma \in \math …
- 175
1
vote
1
answer
208
views
Looking for q-analog of derangement anagrams for a word
I have already known QPermutationDerangement:
It describes the distribution
$$
d_n(q)=\sum_{\sigma \in D_n} q^{\operatorname{maj}(\sigma)}
$$
Where we sum over all derangements of an $n$ element set.
…
- 175