C. Pelekis

activity

20162019

most citedA fractal perspective on optimal antichains and intersecting subsets of the unit

n

-cube

1 citations · 1 across the 3 of their papers we have counts for

collaborators

4 papers

math.CA2019

A continuous analogue of Erdős' $k$ -Sperner theorem

Themis Mitsis, Christos Pelekis, Václav Vlasák

A \emph{chain} in the unit $n$ -cube is a set $C \subset [0, 1]^{n}$ such that for every $x = (x_{1}, \dots, x_{n})$ and $y = (y_{1}, \dots, y_{n})$ in $C$ we either have $x_i\le y_…

math.CO2017

A generalization of Erdős' matching conjecture

Christos Pelekis, Israel Rocha

Let $H = (V, E)$ be an $r$ -uniform hypergraph on $n$ vertices and fix a positive integer $k$ such that $1 \leq k \leq r$ . A $k$ -\emph{matching} of $H$ is a c…

math.CO2017★ 1 cited

A fractal perspective on optimal antichains and intersecting subsets of the unit $n$ -cube

Konrad Engel, Themis Mitsis, Christos Pelekis

An \emph{ $n$ -cube antichain} is a subset of the unit $n$ -cube $[0, 1]^{n}$ that does not contain two elements $x = (x_{1}, x_{2}, \dots, x_{n})$ and $\mathbf{y}=(y_1, y_2,\ldots, y_n…

math.PR2016

A lower bound on the probability that a binomial random variable is exceeding its mean

Christos Pelekis, Jan Ramon

We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail condition…

A continuous analogue of Erdős' k-Sperner theorem

A generalization of Erdős' matching conjecture

A fractal perspective on optimal antichains and intersecting subsets of the unit n-cube

A lower bound on the probability that a binomial random variable is exceeding its mean

A continuous analogue of Erdős' $k$ -Sperner theorem

A fractal perspective on optimal antichains and intersecting subsets of the unit $n$ -cube