On arithmetic combinatorics and finite groups

Nets Hawk Katz

Type: Article

Publication Date: 2005-01-01

Citations: 2

DOI: https://doi.org/10.1215/ijm/1258138305

Abstract

We demonstrate that a certain class of problems in linear arithmetic combinatorics is equivalent to a problem in the representation theory of finite groups which relates the sizes of various stabilizer groups.

Locations

Illinois Journal of Mathematics - View - PDF

Similar Works

Action	Title	Year	Authors
+	On the congruence problem for linear groups over arithmetic rings	1992	V. P. Platonov A. A. Sharomet
+	ON THE SIZE AND STRUCTURE OF FINITE LINEAR GROUPS	2013	Olga Weisfeiler
+	Arithmetical and structural problems in linear algebraic groups	1977	V. P. Platonov
+	On the Computational Complexity of the Theory of Abelian Groups.	1984	Libo Lo
+	Number Theory and Combinatorics	2011	Titu Andreescu Bogdan Enescu
+	Computational Complexity in Finite Groups	1991	László Babai
+ PDF Chat	On some computational problems in finite abelian groups	1997	Johannes Buchmann Michael J. Jacobson Edlyn Teske
+	Representation of finite groups: conjectures, reductions, and applications	2014	Pham Huu Tiep
+	On deciding finiteness of matrix groups	2009	A. S. Detinko Dane Flannery
+	On Linear Combinatorics II. Structure Theorems via Additive Number Theory	1998	György Elekes
+	Classification Problems for Finite Linear Groups	2013	Barry Hurley
+	Finite field models in arithmetic combinatorics -- twenty years on	2023	Sarah Peluse
+	Combinatorics and representations of finite groups	1993	Jørn B. Olsson
+	On the complexity of the identity problem for finitely defined groups	1969	M. K. Valiev
+	Computation with Linear Algebraic Groups	2017	Willem A. de Graaf
+	Lecture Notes on Algebraic Combinatorics	2012	Jeremy L. Martin
+ PDF Chat	Computational approaches to certain problems in the theory of finite groups	1980	Gregory Butler
+	On the relational complexity of a finite permutation group	2019	Nick Gill
+ PDF Chat	On the relational complexity of a finite permutation group	2015	Gregory Cherlin
+	Equivalence of polynomial conjectures in additive combinatorics	2010	Shachar Lovett

Works That Cite This (1)

Action	Title	Year	Authors
+	Erdős’s Unit Distance Problem	2016	Endre Szemerédi

Works Cited by This (6)

Action	Title	Year	Authors
+ PDF Chat	Recent work connected with the Kakeya problem	2003	Thomas Wolff
+ PDF Chat	New bounds for Kakeya problems	2002	N. Katz Terence Tao
+	On distinct sums and distinct distances	2003	Gábor Tardos
+	On the Dimension of Kakeya Sets and Related Maximal Inequalities	1999	Jean Bourgain
+ PDF Chat	Bounds on arithmetic projections, and applications to the Kakeya conjecture	1999	Nets Hawk Katz Terence Tao
+ PDF Chat	Distinct Distances in the Plane	2001	József Solymosi Cs. D. Tóth