default search action
Shalom Eliahou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j29]Shalom Eliahou
, M. P. Revuelta:
The Schur degree of additive sets. Discret. Math. 344(5): 112332 (2021) - 2020
- [j28]Shalom Eliahou
A Graph-Theoretic Approach to Wilf's Conjecture. Electron. J. Comb. 27(2): 2 (2020) - [j27]Shalom Eliahou
Gapsets and numerical semigroups. J. Comb. Theory A 169 (2020)
2010 – 2019
- 2019
- [j26]Sukumar Das Adhikari, Luis Boza
Numerical semigroups of Szemerédi type. Discret. Appl. Math. 263: 8-13 (2019) - 2018
- [j25]Sukumar Das Adhikari, Luis Boza, Shalom Eliahou
Equation-regular sets and the Fox-Kleitman conjecture. Discret. Math. 341(2): 287-298 (2018) - [j24]Sukumar Das Adhikari, Luis Boza, Shalom Eliahou
On the degree of regularity of a certain quadratic Diophantine equation. Eur. J. Comb. 70: 50-60 (2018) - [j23]Shalom Eliahou
Are Monochromatic Pythagorean Triples Unavoidable under Morphic Colorings? Exp. Math. 27(4): 419-425 (2018) - 2017
- [j22]Sukumar Das Adhikari, Luis Boza, Shalom Eliahou
On the finiteness of some n-color Rado numbers. Discret. Math. 340(2): 39-45 (2017) - 2016
- [j21]Shalom Eliahou
Poonen's conjecture and Ramsey numbers. Discret. Appl. Math. 209: 102-106 (2016) - [j20]Sukumar Das Adhikari, Luis Boza, Shalom Eliahou
On the n-color Rado number for the equation x1+x2+ ...+xk+c =xk+1. Math. Comput. 85(300): 2047-2064 (2016) - [i1]Shalom Eliahou, Jean Fromentin, Virginie Marion-Poty, Denis Robilliard:
Are monochromatic Pythagorean triples avoidable? CoRR abs/1605.00859 (2016) - 2013
- [j19]Shalom Eliahou
Mutually describing multisets and integer partitions. Discret. Math. 313(4): 422-433 (2013) - [c1]Shalom Eliahou
Investigating Monte-Carlo Methods on the Weak Schur Problem. EvoCOP 2013: 191-201 - 2012
- [j18]Shalom Eliahou
Weak Schur numbers and the search for G.W. Walker's lost partitions. Comput. Math. Appl. 63(1): 175-182 (2012) - [j17]Jonathan Chappelon, Shalom Eliahou:
On the Problem of Molluzzo for the Modulus 4. Integers 12: A18 (2012) - 2011
- [j16]Shalom Eliahou
Two-Generator Numerical Semigroups and Fermat and Mersenne Numbers. SIAM J. Discret. Math. 25(2): 622-630 (2011) - 2010
- [j15]Shalom Eliahou
Minimal sumsets in finite solvable groups. Discret. Math. 310(3): 471-479 (2010)
2000 – 2009
- 2008
- [j14]Shalom Eliahou
Matchings in arbitrary groups. Adv. Appl. Math. 40(2): 219-224 (2008) - [j13]Maxime Augier, Shalom Eliahou
Parity-regular Steinhaus graphs. Math. Comput. 77(263): 1831-1839 (2008) - 2007
- [j12]Shalom Eliahou
Some extensions of the Cauchy-Davenport theorem. Electron. Notes Discret. Math. 28: 557-564 (2007) - 2006
- [j11]Shalom Eliahou
Sumsets in dihedral groups. Eur. J. Comb. 27(4): 617-628 (2006) - [j10]Shalom Eliahou
The small sumsets property for solvable finite groups. Eur. J. Comb. 27(7): 1102-1110 (2006) - 2005
- [j9]Shalom Eliahou
Foreword. Discret. Math. 302(1-3): 1-3 (2005) - [j8]Shalom Eliahou
A survey on modular Hadamard matrices. Discret. Math. 302(1-3): 85-106 (2005) - 2004
- [j7]Shalom Eliahou
On a Problem of Steinhaus Concerning Binary Sequences. Exp. Math. 13(2): 215-229 (2004) - 2002
- [j6]Shalom Eliahou
Three Moves on Signed Surface Triangulations. J. Comb. Theory B 84(1): 118-125 (2002) - [j5]Shalom Eliahou
Circulant 16-Modular Hadamard Matrices and Jacobi Sums. J. Comb. Theory A 100(1): 116-135 (2002) - 2001
- [j4]Shalom Eliahou
Restricted sums of sets of cardinality 1+p in a vector space over Fp. Discret. Math. 235(1-3): 199-213 (2001)
1990 – 1999
- 1999
- [j3]Shalom Eliahou
Signed Diagonal Flips and the Four Color Theorem. Eur. J. Comb. 20(7): 641-647 (1999) - 1993
- [j2]Shalom Eliahou
The 3x+1 problem: new lower bounds on nontrivial cycle lengths. Discret. Math. 118(1-3): 45-56 (1993) - 1990
- [j1]Shalom Eliahou
A new restriction on the lengths of golay complementary sequences. J. Comb. Theory A 55(1): 49-59 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: