Tomasz Schoen

Orcid: 0000-0002-9427-3127

According to our database1, Tomasz Schoen authored at least 23 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Note on the Theorem of Balog, Szemerédi, and Gowers.
Comb., June, 2024

2022
A note on bilinear exponential sums in prime fields.
Finite Fields Their Appl., 2022

2021
A Subexponential Upper Bound for van der Waerden Numbers $W(3, k)$.
Electron. J. Comb., 2021

A Diophantine Ramsey Theorem.
Comb., 2021

2019
An Upper Bound for Weak B<sub>k</sub>-Sets.
SIAM J. Discret. Math., 2019

2017
Tight bounds on additive Ramsey-type numbers.
J. Lond. Math. Soc., 2017

2016
A Remark on A+B and A-A for Compact Sets in Rn.
Integers, 2016

2015
New bounds in Balog-Szemerédi-Gowers theorem.
Comb., 2015

2013
Finding large co-Sidon subsets in sets with a given additive energy.
Eur. J. Comb., 2013

2011
On Sumsets of Convex Sets.
Comb. Probab. Comput., 2011

2007
Difference Covers.
Comb. Probab. Comput., 2007

2005
The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc.
Electron. J. Comb., 2005

2002
On the discrepancy of combinatorial rectangles.
Random Struct. Algorithms, 2002

2001
On a Problem of Erds and Sárközy.
J. Comb. Theory A, 2001

Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract).
Electron. Notes Discret. Math., 2001

Sum-Free Subsets of Right Cancellative Semigroups.
Eur. J. Comb., 2001

Coloring <i>t</i>-dimensional <i>m</i>-Boxes.
Discret. Math., 2001

On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation.
Proceedings of the Approximation, 2001

2000
A Note on the Number of (k, l)-Sum-Free Sets.
Electron. J. Comb., 2000

1999
On Sets of Natural Numbers Whose Sumset is Free of Squares.
J. Comb. Theory A, 1999

The Number of Monochromatic Schur Triples.
Eur. J. Comb., 1999

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.
Proceedings of the Randomization, 1999

1998
Independent finite sums in graphs defined on the natural numbers.
Discret. Math., 1998


  Loading...