On arithmetic combinatorics and finite groups

Nets Hawk Katz

Source record

Source: Crossref

Published: Jan 1, 2005

DOI: 10.1215/ijm/1258138305

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.