8
votes
2answers
219 views

Inequalities for averaging over partially ordered sets

Let's start from a classical inequality: If $0\le a_1\le\cdots\le a_k$ and $0\le b_1\le\cdots\le b_k$ then $(a_1+\cdots+a_k)(b_1+\cdots+b_k)\le k(a_1b_1+\cdots+a_k b_k)$. It can be written also in ...
10
votes
1answer
252 views

Tverberg's theorem in CAT(0) spaces

Does Tverberg's theorem hold for CAT(0) spaces of covering dimension $d<\infty$: Is it true that for any $d$-dimensional $CAT(0)$-space $X$ and a subset $E\subset X$ of cardinality $(d + 1)(r - ...
2
votes
0answers
121 views

A subclass of log-concave functions satifying a sum inequality

Suppose $f:[0,\infty)\to[0,\infty)$ is continuous and for all positive integers $m$ and real $x\geq0$, $\alpha,\beta>0$: $$ ...
20
votes
1answer
1k views

A Weak Form of Borsuk's Conjecture

Problem: Let P be a d-dimensional polytope with n facets. Is it always true that P can be covered by n sets of smaller diameter? Background and motivation The Borsuk conjecture (disproved in ...
3
votes
1answer
410 views

Tverberg partitions with less than (r-1)(d+1)+1 points

The Tverberg Theorem states the following: Let $x_1,x_2,\dots, x_m$ be points in $R^d$ with $m \ge (r-1)(d+1)+1$. Then there is a partition $S_1,S_2,\dots, S_r$ of $\{1,2,\dots,m\}$ such that $\cap ...
7
votes
0answers
208 views

Are plactic classes convex under the right weak Bruhat order?

For those who are unfamiliar with the terminology, I'll explain a little. The symmetric group $S_n$, as a type A Coxeter group, has generators $\{s_1,\ldots,s_{n-1}\}$ with relations (1) $s_i^2$ for ...
22
votes
3answers
2k views

Covering a circle with red and blue arcs

We have a circle and two families of $n$ red arcs and $n$ blue arcs, positioned on the circle so that every two arcs of different colors intersect. Can one show that there is a point in the perimeter ...
15
votes
12answers
3k views

Generalizations of the Birkhoff-von Neumann Theorem

The famous Birkhoff-von Neumann theorem asserts that every doubly stochastic matrix can be written as a convex combination of permutation matrices. The question is to point out different ...
9
votes
3answers
599 views

A “round” lattice with low kissing number?

Historically, the lattices with high density were studied intensively, e.g. E_8 lattice or Leech Lattice. However, there are situations that lattices with low kissing number are required. ...