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 33333
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
6
votes
2
answers
603
views
An easy-to-state elusive combinatorial problem
Let $a_1,a_2 \in \mathbb{Q}:a_1≥1,a_2≥1$. What should be the minimum value of $x\in\mathbb{R}$: $n∈[1,x]$ to ensure that $4k−3≤na_1≤4k−1$ such that $k∈N$ and $4l−3≤na_2≤4l−1$ such that $l∈N$ for all $ …
- 296
0
votes
0
answers
125
views
An easy-to-state elusive combinatorial problem (revisited)
The following question is tackled with based completely on David Speyer's argument on a related problem:
Let $x,y,z\in \mathbb{Q}:x\ge1,y\ge1,z\ge1$. What should be the minimum value of $s\in \mathbb …
- 296
9
votes
1
answer
452
views
A conjecture on intersection of some intervals.
It was proved here that if $a\in \mathbb{N}_{\geq3}$ then
$$\bigcap_{i = 1}^{a} \bigcup_{j = 0}^{i-1} \left[\frac{1+aj}{i},\frac{a(j+1)-1}{i}\right] = \varnothing \tag{1}$$
It may be conjectured tha …
- 296