SEShalom Eliahou
Shalom Eliahou
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Shalom Eliahou has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jean Fromentin
Université du Littoral Côte d’Opale
5 shared publications - Jean Fromentin
Univ. Littoral Côte d’Opale
4 shared publications - Vittoria Bonanzinga
DIIES, Univ. Mediterranea di Reggio Calabria, Reggio Calabria, Italy
4 shared publications - Daniel Marín-Aragón
Departamento de Matemáticas, Universidad de Cádiz, E-11510 Puerto Real, Cádiz, Spain
3 shared publications - Manuel Delgado
Universidade do Porto
3 shared publications - Alberto Vigneron-Tenorio
Departamento de Matemáticas/INDESS (Instituto Universitario para el Desarrollo Social Sostenible), Universidad de Cádiz, E-11406 Jerez de la Frontera, Cádiz, Spain
2 shared publications
Latest Publications
- 12 June 2026
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 64 (1)
An update on modular Hadamard matrices
- 12 June 2026
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 64 (1)
An update on modular Hadamard matrices
- 28 October 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (3) , 1-30
On the Gotzmann threshold of monomials
- 28 October 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (3) , 1-30
On the Gotzmann threshold of monomials
- 20 May 2025
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mathematique
- Vol. 363 (G4) , 329-336
The number system in rational base and the problemThe representation of numbers in rational base was introduced in 2008 by Akiyama, Frougny & Sakarovitch, with a special focus on the case . Unnoticed since then, natural questions related to representations in that specific base turn out to intimately involve the Collatz function. Our purpose in this note is to expose these links and motivate further research into them.- 20 May 2025
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mathematique
- Vol. 363 (G4) , 329-336
The number system in rational base and the problemThe representation of numbers in rational base was introduced in 2008 by Akiyama, Frougny & Sakarovitch, with a special focus on the case . Unnoticed since then, natural questions related to representations in that specific base turn out to intimately involve the Collatz function. Our purpose in this note is to expose these links and motivate further research into them.- Open Access
The number system in rational base 3/2 and the 3x + 1 problem
To appear in Comptes Rendus. Mathématique. Académie des Sciences, Paris
Open AccessThe number system in rational base 3/2 and the 3x + 1 problem
To appear in Comptes Rendus. Mathématique. Académie des Sciences, Paris
- Open AccessThe number system in rational base $3/2$ and the $3x+1$ problemThe representation of numbers in rational base $p/q$ was introduced in 2008 by Akiyama, Frougny & Sakarovitch, with a special focus on the case $p/q=3/2$. Unnoticed since then, natural questions related to representations in that specific base turn out to intimately involve the Collatz $3x+1$ function. Our purpose in this note is to expose these links and motivate further research into them.Open AccessThe number system in rational base $3/2$ and the $3x+1$ problemThe representation of numbers in rational base $p/q$ was introduced in 2008 by Akiyama, Frougny & Sakarovitch, with a special focus on the case $p/q=3/2$. Unnoticed since then, natural questions related to representations in that specific base turn out to intimately involve the Collatz $3x+1$ function. Our purpose in this note is to expose these links and motivate further research into them.
- 1 December 2024
- Published by Taylor & Francis in Communications in Algebra
- Vol. 53 (5) , 2025-2048
Divsets, numerical semigroups and Wilf’s conjecture
- 1 December 2024
- Published by Taylor & Francis in Communications in Algebra
- Vol. 53 (5) , 2025-2048
Divsets, numerical semigroups and Wilf’s conjecture
- 30 October 2024
- Published by Elsevier in Journal of Algebra
- Vol. 664, 150-163
A verification of Wilf's conjecture up to genus 100
- 30 October 2024
- Published by Elsevier in Journal of Algebra
- Vol. 664, 150-163
A verification of Wilf's conjecture up to genus 100
- Open Access
Divsets, numerical semigroups and Wilf's conjecture
Let $S \subseteq \N$ be a numerical semigroup with multiplicity $m = \min(S \setminus \{0\})$ and conductor $c=\max(\Z \setminus S)+1$. Let $P$ be the set of primitive elements, i.e. minimal generators, of $S$, and let $L$ be the set of elements of $S$ which are smaller than $c$. Wilf's conjecture (1978) states that the inequality $|P||L| \ge c$ must hold. The conjecture has been shown to hold in case $|P| \ge m/2$ by Sammartano in 2012, and subsequently in case $|P| \ge m/3$ by the author in 2020. The main result in this paper is that Wilf's conjecture holds in case $|P| \ge m/4$ if $m$ divides $c$. The proof uses \emph{divsets} $X$, i.e. finite divisor-closed sets of monomials, as abstract models of numerical semigroups, and proceeds with estimates of the vertex-maximal matching number of the associated graph $G(X)$.Open AccessDivsets, numerical semigroups and Wilf's conjecture
Let $S \subseteq \N$ be a numerical semigroup with multiplicity $m = \min(S \setminus \{0\})$ and conductor $c=\max(\Z \setminus S)+1$. Let $P$ be the set of primitive elements, i.e. minimal generators, of $S$, and let $L$ be the set of elements of $S$ which are smaller than $c$. Wilf's conjecture (1978) states that the inequality $|P||L| \ge c$ must hold. The conjecture has been shown to hold in case $|P| \ge m/2$ by Sammartano in 2012, and subsequently in case $|P| \ge m/3$ by the author in 2020. The main result in this paper is that Wilf's conjecture holds in case $|P| \ge m/4$ if $m$ divides $c$. The proof uses \emph{divsets} $X$, i.e. finite divisor-closed sets of monomials, as abstract models of numerical semigroups, and proceeds with estimates of the vertex-maximal matching number of the associated graph $G(X)$. - Open Access
ON THE GOTZMANN THRESHOLD OF MONOMIALS
Let $R_n=K[x_1,\dots,x_n]$ be the $n$-variable polynomial ring over a field $K$. Let $S_n$ denote the set of monomials in $R_n$. A monomial $u \in S_n$ is a \textit{Gotzmann monomial} if the Borel-stable monomial ideal $\langle u \rangle$ it generates in $R_n$ is a Gotzmann ideal. A longstanding open problem is to determine all Gotzmann monomials in $R_n$. Given $u_0 \in S_{n-1}$, its \textit{Gotzmann threshold} is the unique nonnegative integer $t_0=\tau_n(u_0)$ such that $u_0x_n^t$ is a Gotzmann monomial in $R_n$ if and only if $t \ge t_0$. Currently, the function $\tau_n$ is exactly known for $n \le 4$ only. We present here an efficient procedure to determine $\tau_n(u_0)$ for all $n$ and all $u_0 \in S_{n-1}$. As an application, in the critical case $u_0=x_2^d$, we determine $\tau_5(x_2^d)$ for all $d$ and we conjecture that for $n \ge 6$, $\tau_n(x_2^d)$ is a polynomial in $d$ of degree $2^{n-2}$ and dominant term equal to that of the $(n-2)$-iterated binomial coefficient$$\binom {\binom {\binom d2}2}{\stackrel{\cdots}2}.$$Open AccessON THE GOTZMANN THRESHOLD OF MONOMIALS
Let $R_n=K[x_1,\dots,x_n]$ be the $n$-variable polynomial ring over a field $K$. Let $S_n$ denote the set of monomials in $R_n$. A monomial $u \in S_n$ is a \textit{Gotzmann monomial} if the Borel-stable monomial ideal $\langle u \rangle$ it generates in $R_n$ is a Gotzmann ideal. A longstanding open problem is to determine all Gotzmann monomials in $R_n$. Given $u_0 \in S_{n-1}$, its \textit{Gotzmann threshold} is the unique nonnegative integer $t_0=\tau_n(u_0)$ such that $u_0x_n^t$ is a Gotzmann monomial in $R_n$ if and only if $t \ge t_0$. Currently, the function $\tau_n$ is exactly known for $n \le 4$ only. We present here an efficient procedure to determine $\tau_n(u_0)$ for all $n$ and all $u_0 \in S_{n-1}$. As an application, in the critical case $u_0=x_2^d$, we determine $\tau_5(x_2^d)$ for all $d$ and we conjecture that for $n \ge 6$, $\tau_n(x_2^d)$ is a polynomial in $d$ of degree $2^{n-2}$ and dominant term equal to that of the $(n-2)$-iterated binomial coefficient$$\binom {\binom {\binom d2}2}{\stackrel{\cdots}2}.$$ - Open Access
On the Gotzmann threshold of monomials
Let $R_n=K[x_1,\dots,x_n]$ be the $n$-variable polynomial ring over a field $K$. Let $S_n$ denote the set of monomials in $R_n$. A monomial $u \in S_n$ is a \textit{Gotzmann monomial} if the Borel-stable monomial ideal $\langle u \rangle$ it generates in $R_n$ is a Gotzmann ideal. A longstanding open problem is to determine all Gotzmann monomials in $R_n$. Given $u_0 \in S_{n-1}$, its \textit{Gotzmann threshold} is the unique nonnegative integer $t_0=τ_n(u_0)$ such that $u_0x_n^t$ is a Gotzmann monomial in $R_n$ if and only if $t \ge t_0$. Currently, the function $τ_n$ is exactly known for $n \le 4$ only. We present here an efficient procedure to determine $τ_n(u_0)$ for all $n$ and all $u_0 \in S_{n-1}$. As an application, in the critical case $u_0=x_2^d$, we determine $τ_5(x_2^d)$ for all $d$ and we conjecture that for $n \ge 6$, $τ_n(x_2^d)$ is a polynomial in $d$ of degree $2^{n-2}$ and dominant term equal to that of the $(n-2)$-iterated binomial coefficient $$ \binom {\binom {\binom d2}2}{\stackrel{\cdots}2}. $$Open AccessOn the Gotzmann threshold of monomials
Let $R_n=K[x_1,\dots,x_n]$ be the $n$-variable polynomial ring over a field $K$. Let $S_n$ denote the set of monomials in $R_n$. A monomial $u \in S_n$ is a \textit{Gotzmann monomial} if the Borel-stable monomial ideal $\langle u \rangle$ it generates in $R_n$ is a Gotzmann ideal. A longstanding open problem is to determine all Gotzmann monomials in $R_n$. Given $u_0 \in S_{n-1}$, its \textit{Gotzmann threshold} is the unique nonnegative integer $t_0=τ_n(u_0)$ such that $u_0x_n^t$ is a Gotzmann monomial in $R_n$ if and only if $t \ge t_0$. Currently, the function $τ_n$ is exactly known for $n \le 4$ only. We present here an efficient procedure to determine $τ_n(u_0)$ for all $n$ and all $u_0 \in S_{n-1}$. As an application, in the critical case $u_0=x_2^d$, we determine $τ_5(x_2^d)$ for all $d$ and we conjecture that for $n \ge 6$, $τ_n(x_2^d)$ is a polynomial in $d$ of degree $2^{n-2}$ and dominant term equal to that of the $(n-2)$-iterated binomial coefficient $$ \binom {\binom {\binom d2}2}{\stackrel{\cdots}2}. $$