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 119533
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
2
votes
Accepted
Instance of polynomial van der Waerden without good bounds
Isn't this paper the most up to date? I believe the introduction covers all of the relevant literature.
"Proving a fully general quantitative polynomial Szemerédi theorem remains a very challenging o …
- 383
5
votes
1
answer
353
views
Primitive recursive bounds for multidimensional polynomial vdW / HJ
In Shelah's paper 679, he proves primitive recursive bounds for the polynomial Hales-Jewett theorem and thus for the polynomial van der Waerden theorem.
How about for the multidimensional polynomial H …
- 383
8
votes
Accepted
Is there any relationship between Szemerédi's theorem and Sunflower conjecture?
I do not know of a direct connection to Roth or Szemerédi over the integers. However, the paper
N. Alon, A. Shpilka and C. Umans, On Sunflowers and Matrix Multiplication, 2012 IEEE 27th Conference o …
- 383
5
votes
2
answers
350
views
Nontrivial expansion in sumsets
Let $A \subset \mathbb{Z}/p$, let $f$ be a function on $\mathbb{Z}/p$ and let $B:=\{f(a): a \in A\}$.
Can we conclude that $|A+B|$ is large if $f$ is a sufficiently "nice" function? For instance say …
- 383
5
votes
0
answers
839
views
Increasing sequences in polynomial progressions modulo p
In a random permutation on $n$ elements one expects the largest increasing and decreasing sequences to have size $(2+o(1))\sqrt{n}$. Is it known if this same property holds in sequences given by poly …
- 383