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 129831
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
1
vote
2
answers
167
views
Number of zeroes and sign switches in a constructed zero-sum double sequence
See also StackExchange.
Setup. Let $n\in\Bbb N$. Let $a_{1,1}, a_{1,2},\dots, a_{1,n}\in\Bbb R$ be a given sequence of real numbers that sum to $0$, i.e. $a_{1,n}=-(a_{1,1}+a_{1,2}+\dots+a_{1,n-1})$. …
- 1,326
17
votes
3
answers
2k
views
When is the number of areas obtained by cutting a circle with $n$ chords a power of $2$?
Also posted on the Math Stackexchange: When is the number of areas obtained by cutting a circle with $n$ chords a power of $2$?
Introduction
Recently, a friend told me about the following interestin …
- 1,326