17 citations · 82 across the 18 of their papers we have counts for
18 papers
The Scaled Polarity transform and related inequalities
Shoni Gilboa, Alexander Segal, Boaz A. Slomka
In this paper we deal with generalizations of the Mahler volume product for log-concave functions. We show that the polarity transform can be rescaled so that the Mahl…
Non-constant ground configurations in the disordered ferromagnet
Michal Bassan, Shoni Gilboa, Ron Peled
The disordered ferromagnet is a disordered version of the ferromagnetic Ising model in which the coupling constants are non-negative quenched random. A ground configuration is an i…
Isobarycentric Inequalities
Shoni Gilboa, Pazit Haim-Kislev, Boaz Slomka
We prove the following isoperimetric type inequality: Given a finite absolutely continuous Borel measure on , halfspaces have maximal measure among all subsets with…
The maximal number of -term arithmetic progressions in finite sets in different geometries
Itai Benjamini, Shoni Gilboa
Green and Sisask showed that the maximal number of -term arithmetic progressions in -element sets of integers is ; it is easy to see that the same holds i…
Semi-random process without replacement
Shoni Gilboa, Dan Hefetz
Semi-random processes involve an adaptive decision-maker, whose goal is to achieve some pre-determined objective in an online randomized environment. We introduce and study a semi-…
Some combinatorial results on smooth permutations
Shoni Gilboa, Erez Lapid
We show that any smooth permutation is characterized by the set of transpositions and -cycles in the Bruhat interval , and that i…
On the local structure of oriented graphs -- a case study in flag algebras
Shoni Gilboa, Roman Glebov, Dan Hefetz +2
Let be an -vertex oriented graph. Let (respectively ) be the probability that a random set of vertices of spans a transitive triangle (respectively an i…
A probabilistic variant of Sperner's theorem and of maximal -cover free families
Noga Alon, Shoni Gilboa, Shay Gueron
A family of sets is called -\emph{cover free} if no set in the family is contained in the union of (or less) other sets in the family. A -cover free family is simply an a…
The Advantage of Truncated Permutations
Shoni Gilboa, Shay Gueron
Constructing a Pseudo Random Function (PRF) is a fundamental problem in cryptology. Such a construction, implemented by truncating the last bits of permutations of $\{0, 1\}^{n…
Distinguishing a truncated random permutation from a random function
Shoni Gilboa, Shay Gueron
An oracle chooses a function from the set of bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an -bit…
On degree anti-Ramsey numbers
Shoni Gilboa, Dan Hefetz
The degree anti-Ramsey number of a graph is the smallest integer for which there exists a graph with maximum degree at most such that any proper edge colo…
Chebyshev-type Quadratures for Doubling Weights
Shoni Gilboa, Ron Peled
A Chebyshev-type quadrature for a given weight function is a quadrature formula with equal weights. In this work we show that a method presented by Kane may be used to produce tigh…
How many queries are needed to distinguish a truncated random permutation from a random function?
Shoni Gilboa, Shay Gueron, Ben Morris
An oracle chooses a function from the set of bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an -bit…
Balanced permutations Even-Mansour ciphers
Shoni Gilboa, Shay Gueron, Mridul Nandi
The -rounds Even-Mansour block cipher is a generalization of the well known Even-Mansour block cipher to iterations. Attacks on this construction were described by Nikolić e…
A differential version of the Chebyshev-Markov-Stieltjes inequalities
Shoni Gilboa, Ron Peled
We show that a differential version of the classical Chebyshev-Markov-Stieltjes inequalities holds for a broad family of weight functions. Such a differential version appears to be…
On the Union of Arithmetic Progressions
Shoni Gilboa, Rom Pinchasi
We show that for every there is an absolute constant such that the following is true. The union of any arithmetic progressions, each of lengt…
Anti-Ramsey numbers of graphs with small connected components
Shoni Gilboa, Yehuda Roditty
The anti-Ramsey number, , for a graph and an integer , is defined to be the minimal integer such that in any edge-colouring of by at least c…
Anti-Ramsey numbers of small graphs
Arie Bialostocki, Shoni Gilboa, Yehuda Roditty
The anti-Ramsey number ), for a graph and an integer , is defined to be the minimal integer such that in any edge-colouring of by at least co…