default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVitaly Bergelson
Person information
- affiliation: Ohio State University, Department of Mathematics, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j16]Vitaly Bergelson, Rigoberto Zelada
:
Iterated differences sets, Diophantine approximations and applications. J. Comb. Theory A 184: 105520 (2021)- [j15]Vitaly Bergelson, Andrew Best, Alex Iosevich:
Sums of Powers in Large Finite Fields: A Mix of Methods. Am. Math. Mon. 128(8): 701-718 (2021) - 2020
- [j14]Vitaly Bergelson, Daniel Glasscock:
On the interplay between additive and multiplicative largeness and its combinatorial applications. J. Comb. Theory A 172: 105203 (2020)
2010 – 2019
- 2019
- [j13]Vitaly Bergelson, Joseph Vandehey:
A Hot Spot Proof of the Generalized Wall Theorem. Am. Math. Mon. 126(10): 876-890 (2019) - 2017
- [j12]Vitaly Bergelson, Donald Robertson, Pavel Zorin-Kranich:
Triangles in Cartesian Squares of Quasirandom Groups. Comb. Probab. Comput. 26(2): 161-182 (2017) - [j11]Vitaly Bergelson, John H. Johnson Jr., Joel Moreira:
New polynomial and multidimensional extensions of classical partition results. J. Comb. Theory A 147: 119-154 (2017) - 2013
- [p1]Vitaly Bergelson, Paul Erdös, Neil Hindman, Tomasz Luczak:
Dense Difference Sets and Their Combinatorial Structure. The Mathematics of Paul Erdős I 2013: 133-146
2000 – 2009
- 2006
- [j10]Mathias Beiglböck, Vitaly Bergelson, Neil Hindman, Dona Strauss:
Multiplicative structures in additively large sets. J. Comb. Theory A 113(7): 1219-1242 (2006) - 2001
- [j9]Vitaly Bergelson, Neil Hindman:
Partition Regular Structures Contained in Large Sets Are Abundant. J. Comb. Theory A 93(1): 18-36 (2001)
1990 – 1999
- 1999
- [j8]Vitaly Bergelson, Neil Hindman, Imre Leader:
Additive and Multiplicative Ramsey Theory in the Reals and the Rationals. J. Comb. Theory A 85(1): 41-68 (1999) - 1994
- [j7]Vitaly Bergelson, Neil Hindman:
On IP Sets and Central Sets. Comb. 14(3): 269-277 (1994) - [j6]Vitaly Bergelson, Walter A. Deuber, Neil Hindman, Hanno Lefmann:
Rado's Theorem for Commutative Rings. J. Comb. Theory A 66(1): 68-92 (1994) - 1993
- [j5]Vitaly Bergelson, Neil Hindman:
Additive and Multiplicative Ramsey Theorems in N-Some Elementary Results. Comb. Probab. Comput. 2: 221-241 (1993)
1980 – 1989
- 1989
- [j4]Vitaly Bergelson, Neil Hindman:
Ultrafilters and multidimensional Ramsey theorems. Comb. 9(1): 1-7 (1989) - 1988
- [j3]Vitaly Bergelson, Neil Hindman:
Density versions of two generalizations of Schur's theorem. J. Comb. Theory A 48(1): 32-38 (1988) - [j2]Vitaly Bergelson, Neil Hindman:
A combinatorially large cell of a partition of N. J. Comb. Theory A 48(1): 39-52 (1988) - 1986
- [j1]Vitaly Bergelson:
A density statement generalizing Schur's theorem. J. Comb. Theory A 43(2): 338-343 (1986)
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 2025-01-21 00:19 CET 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:
