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 130860
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
9
votes
2
answers
304
views
Reference Request: Length of a reflection in a Coxeter group can be achieved by symmetric word
In a given coxeter group $(W,S)$, a reflection is an element of $W$ that can be written with a symmetric word in the generators $S$.
In multiple sources, I found the following formula:
$$
\mathrm …
- 152
2
votes
Accepted
Simplicial set are to cubical sets what simplicial complexes are to ...?
(This is rather an answer to the question "what is an abstract cubical complex" asked in the comments:)
In this paper, Farley defines an abstract cubical complex $C$ as a collection of subsets of a g …
- 152