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 122662
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
4
votes
2
answers
428
views
Combination power elementary symmetric polynomial inequality
Combine my first previous question and second previous question with the Muirhead inequality. I have posed conjectures of two inequalities as follows:
Inequality 1: Let $n>2$ and $1 \le m \le n$ …
- 1,776
1
vote
1
answer
163
views
How many points appear in the plane when the chain of n-gons is close?
Let $A_{11}A_{12}\cdots A_{1n}$ be a regular $n$ polygon, we call $A_{11}A_{12}\cdots A_{1n}$ is the $1st-n-gons$. Now we construct the $2nd-n-gon$ based two condition as follows:
$2nd-n-gons$ is re …
- 1,776
0
votes
Combination power elementary symmetric polynomial inequality
This is not an answer, this is a message to @Gjergji Zaimi. Thank You very much. (And thank to dear Wolfgang very much). Your answer is true with the version above. But if You see my comment to You a …
- 1,776
0
votes
2
answers
368
views
A symmetric polynomial inequality
I improve my previous question. Because this conjecture is exactly natural development of A Muirhead Like Inequality and Muirhead's Inequality so I think the conjecture is true. But I can not prove it …
- 1,776