Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Yeşim Demiroğlu Karabulut"'
Publikováno v:
Graphs and Combinatorics. 35:393-417
We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg–Sarkozy theorem on squares in sets of integers with po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::191b29f01998b53978053add669b3aec
https://doi.org/10.1007/s00373-018-2002-9
https://doi.org/10.1007/s00373-018-2002-9
Autor:
Yeşim Demiroğlu Karabulut
We use the unit-graphs and the special unit-digraphs on matrix rings to show that every n × n {n\times n} nonzero matrix over 𝔽 q {{\mathbb{F}}_{q}} can be written as a sum of two SL n {\operatorname{SL}_{n}} -matrices when n > 1 {n>1} . We compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a424cd69d64ed124d18cc26f5bbb974
https://resolver.caltech.edu/CaltechAUTHORS:20220518-560357700
https://resolver.caltech.edu/CaltechAUTHORS:20220518-560357700
Autor:
Yeşim Demiroğlu Karabulut
In this paper we obtain sharp results for Waring's problem over general finite rings, by using a combination of Artin-Wedderburn theory and Hensel's lemma and building on new proofs of analogous results over finite fields that are achieved using spec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83540a5c0e26abffebbb62adbe8add29