Buscar
Mostrando ítems 1-10 de 22
El teorema de Szemerédi, consecuencias en la distribución de números primos y perspectivas
(Universidad Nacional de Ingeniería, 2018)
El teorema de Szemerédi, consecuencias en la distribución de números primos y perspectivas
(Universidad Nacional de Ingeniería, 2018)
Dinâmica, combinatória e ergodicidade
(Universidade Estadual Paulista (Unesp), 2017-08-30)
Neste trabalho estudamos vários resultados relacionados com sistemas dinâmicos, teoria dos números e combinatória. Em particular, provamos os teoremas de Van Der Waerden, Szemeredi, Koksma e Weyl.
Seminorms for multiple averages along polynomials and applications to joint ergodicity
(Hebrew Univ. Magnes, Israel, 2021)
Exploiting the recent work of Tao and Ziegler on the concatenation theorem on factors, we find explicit characteristic factors for multiple averages along polynomials on systems with commuting transformations, and use them ...
Regularity inheritance in pseudorandom graphs
(Wiley, 2020)
Advancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox, and Zhao. These inheritance lemmas also imply ...
Quantitative multiple recurrence for two and three transformations
(Hebrew University Magnes Press, 2018-06)
We provide various counter examples for quantitative multiple recurrence problems for systems with more than one transformation. We show that:There exists an ergodic system (X,X, mu,T (1), T (2)) with two commuting ...
Regularity inheritance in pseudorandom graphs
(John Wiley and Sons Ltd, 2020)
Advancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox, and Zhao. These inheritance lemmas also imply ...
The approximate loebl-komlos-sos conjecture and embedding trees in sparse graphs
(Amer Inst Mathematical Sciences, 2015)
Loebl, Komlos and Sos conjectured that every n-vertex graph G with at least n/2 vertices of degree at least k contains each tree T of order k + 1 as a subgraph. We give a sketch of a proof of the approximate version of ...