Shoni Gilboa

activity

20132025

most citedHow many queries are needed to distinguish a truncated random permutation from a random function?

17 citations · 82 across the 18 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Some combinatorial results on smooth permutations

Shoni Gilboa, Erez Lapid

We show that any smooth permutation $σ \in S_{n}$ is characterized by the set $C (σ)$ of transpositions and $3$ -cycles in the Bruhat interval $(S_{n})_{\leq σ}$ , and that $σ$ i…

math.CO2019★ 1 cited

On the local structure of oriented graphs -- a case study in flag algebras

Shoni Gilboa, Roman Glebov, Dan Hefetz +2

Let $G$ be an $n$ -vertex oriented graph. Let $t (G)$ (respectively $i (G)$ ) be the probability that a random set of $3$ vertices of $G$ spans a transitive triangle (respectively an i…