S. Eliahou

activity

20052025

most citedMonomial ideals with tiny squares

22 citations · 122 across the 24 of their papers we have counts for

collaborators

Showing 2019 · math.COShow all

3 papers · 2 filters

math.CO2019

An adaptive upper bound on the Ramsey numbers $R (3, \dots, 3)$

Shalom Eliahou

Since 2002, the best known upper bound on the Ramsey numbers R n (3) = R(3,. .. , 3) is R n (3) $\leq$ n!(e -- 1/6) + 1 for all n $\geq$ 4. It is based on the current estimate R 4 (3…

math.CO2019★ 15 cited

A graph-theoretic approach to Wilf's conjecture

Shalom Eliahou

Let S $\subseteq$ N be a numerical semigroup with multiplicity m = min(S \ {0}) and conductor c = max(N \ S) + 1. Let P be the set of primitive elements of S, and let L be the set…

math.CO2019

Some Results On The Flynn-Poonen-Schaefer Conjecture

Shalom Eliahou, Youssef Fares

For $c \in Q$ , consider the quadratic polynomial map $φ_{c} (x) = x^{2} - c$ . Flynn, Poonen and Schaefer conjectured in 1997 that no rational cycle of $φ_{c}$ under iteration has len…

An adaptive upper bound on the Ramsey numbers R(3,…,3)

A graph-theoretic approach to Wilf's conjecture

Some Results On The Flynn-Poonen-Schaefer Conjecture

An adaptive upper bound on the Ramsey numbers $R (3, \dots, 3)$