Search arXivSearch

arXiv · 1606.03256

Combinatorial results implied by many zero divisors in a group ring

Abstract

It has been recently proved (by Croot, Lev and Pach and the subsequent work by Ellenberg and Gijswijt) that for a group $G=G_0^n$, where $G_0\ne \{1,-1\}^m$ is a fixed finite Abelian group and $n$ is large, any subset $A$ without 3-progressions (triples $x,y,z$ of different elements with $xy=z^2$) contains at most $|G|^{1-c}$ elements, where $c>0$ is a constant depending only on $G_0$. This is known to be false when $G$ is, say, large cyclic group. The aim of this note is to show that algebraic property which corresponds to this difference is the following: in the first case a group algebra $\mathbb{F}[G]$ over suitable field $\mathbb{F}$ contains a subspace $X$ with codimension at most $|X|^{1-c}$ such that $X^3=0$. We discuss which bounds are obtained for finite Abelian $p$-groups and for some matrix $p$-groups: Heisenberg group over $\mathbb{F}_p$ and the unitriangular group over $\mathbb{F}_p$. Also we show how the method works for further generalizations by Kleinberg--Sawin--Speyer and Ellenberg.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fedor Petrov. 2020-04-16. Combinatorial results implied by many zero divisors in a group ring. https://arxiv.org/abs/1606.03256

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO