Csaba Sándor - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2023

Dense sumsets of Sidon sequencesSándor Z. Kiss, Csaba Sándor. ejc, 107:103600, 2023. [doi]

2022

Polynomial Schur's TheoremHong Liu, Péter Pál Pach, Csaba Sándor. combinatorica, 42(Supplement 2):1357-1384, December 2022. [doi]

2021

Generalized asymptotic Sidon basisSándor Z. Kiss, Csaba Sándor. DM, 344(2):112208, 2021. [doi]

2019

On the Structure of Sets Which Have Coinciding Representation FunctionsSándor Z. Kiss, Csaba Sándor. int, 19, 2019. [doi]

On minimal additive complements of integersSándor Z. Kiss, Csaba Sándor, Quan-Hui Yang. JCT, 162:344-353, 2019. [doi]

2018

On a Conjecture of Erdös about Sets without k Pairwise Coprime IntegersSándor Z. Kiss, Csaba Sándor, Quan-Hui Yang. siamdm, 32(4):2453-2466, 2018. [doi]

Multiplicative Bases and an Erdős ProblemPéter Pál Pach, Csaba Sándor. combinatorica, 38(5):1175-1203, 2018. [doi]

On some properties of representation functions related to the Erdős-Turán conjectureCsaba Sándor, Quan-Hui Yang. ejc, 71:222-228, 2018. [doi]

2017

Partitions of the set of nonnegative integers with the same representation functionsSándor Z. Kiss, Csaba Sándor. DM, 340(6):1154-1161, 2017. [doi]

An extension of Nathanson's Theorem on representation functionsEszter Rozgonyi, Csaba Sándor. combinatorica, 37(3):521-537, 2017. [doi]

2007

An upper bound for Hilbert cubesCsaba Sándor. JCT, 114(6):1157-1159, 2007. [doi]

2003

On the number of solutions of the Diophantine equationCsaba Sándor. pmh, 47(1-2):215-219, 2003. [doi]

2001

Range of bounded additive representation functionsCsaba Sándor. pmh, 42(1-2):169-177, 2001. [doi]

1999

Greedy algorithm, arithmetic progressions, subset sums and divisibilityPaul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy. DM, 200(1-3):119-135, 1999. [doi]

Sign in or sign up to see more results.

runs on WebDSL