“…The determination of the diameter of T G is thus a variant of Waring's problem over F q . The solution of the Waring problem for general (not necessarily commutative) finite rings was obtained by the second listed author in [4] in part by studying this graph and its spectrum.…”
Section: Introductionmentioning
confidence: 99%
“…Recall that the classical Furstenberg-Sárközy Theorem ( [7,13]) states that every set of integers with positive (natural) density contains two elements whose difference is a square. The spectral theorem applied to these power subgroups G = (F * q ) k graphs also yields ( [4]) a finite field generalization of the Furstenberg-Sárközy Theorem for all powers k ≥ 2: if E ⊆ F q satisfies |E| ≫ k √ q then there exists e, e ′ ∈ E, a ∈ F q with e − e ′ = a k . The question of determining the minimum number, say m, of units such that every element is a sum of m units is well known (see [14], for example).…”
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-Sárközy theorem on squares in sets of integers with positive density, and the study of triangles (also called 2-simplices) in finite fields. Among other results we show that if Fq is the finite field of odd order q, then every matrix in M at d (Fq), d ≥ 2 is the sum of a certain (finite) number of orthogonal matrices, this number depending only on d, the size of the matrix, and not on q, the size of the finite field or on the entries of the matrix.
“…The determination of the diameter of T G is thus a variant of Waring's problem over F q . The solution of the Waring problem for general (not necessarily commutative) finite rings was obtained by the second listed author in [4] in part by studying this graph and its spectrum.…”
Section: Introductionmentioning
confidence: 99%
“…Recall that the classical Furstenberg-Sárközy Theorem ( [7,13]) states that every set of integers with positive (natural) density contains two elements whose difference is a square. The spectral theorem applied to these power subgroups G = (F * q ) k graphs also yields ( [4]) a finite field generalization of the Furstenberg-Sárközy Theorem for all powers k ≥ 2: if E ⊆ F q satisfies |E| ≫ k √ q then there exists e, e ′ ∈ E, a ∈ F q with e − e ′ = a k . The question of determining the minimum number, say m, of units such that every element is a sum of m units is well known (see [14], for example).…”
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-Sárközy theorem on squares in sets of integers with positive density, and the study of triangles (also called 2-simplices) in finite fields. Among other results we show that if Fq is the finite field of odd order q, then every matrix in M at d (Fq), d ≥ 2 is the sum of a certain (finite) number of orthogonal matrices, this number depending only on d, the size of the matrix, and not on q, the size of the finite field or on the entries of the matrix.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.