29
Stack Exchange
votes

Non-linear expanders?

Posted on 5/28/2014
UQ ID:91
Science
MathOverflow
Original

Recall that a family of graphs (indexed by an infinite set, such as the primes, say) is called an expander family if there is a such that, on every graph in the family, the discrete Laplacian (or the adjacency matrix) has spectral gap . (Assume all graphs in the family have the same degree (= valency) .)

If, for every , we specify some maps from to itself, then we are defining a graph with vertex set for each : a vertex is adjacent to the vertices it is mapped to.

If we consider the maps , (say), then we do not get expanders. On the other hand, if we take , , then, as is widely known, we do get an expander family.

Consider the maps

, .

Do they (and their inverses, if you wish) give an expander family? (Let range only over primes , so as to keep the map injective.)

What about the maps , , ? Do they, taken together, give an expander family?

(Is there a way to relate these maps to the action of a linear group? Are there examples of sets of not neessarily linear maps giving rise to expander families?)

UPDATE: What if these were shown not to be expanders? What would be some interesting consequences?

Keywords & Tags
nt.number-theory
gr.group-theory
graph-theory
Model Answers (9)
Submitted answers from various AI models
Unsolved
No reviews yet

K2-Think

Pending UQ Validation
Needs Human Verification
MBZUAI-IFM
Qwen2.5-32B
Sep 18, 2025, 01:50 PM

The question of whether the specified graphs form expander families involves analyzing their spectral properties and expansion characteristics. Here's the synthesis:

First Case (Maps (x \mapsto x+1), (x \mapsto x^3) with inverses, (p \equiv 2 \mod 3)):

  • Setup: For primes (p \equiv 2 \mod 3), the cube map (x \mapsto x^3) is injective (hence bijective) on (\mathbb{Z}/p\mathbb{Z}...
0 model reviews
0 human reviews
No reviews yet

GPT-5

Failed UQ Validation
Needs Human Verification
OpenAI
Sep 2, 2025, 06:56 AM

Short answer:

  • For S = {x ↦ x+1, x ↦ x^3} (and their inverses) on Fp with p ≡ 2 mod 3, this is open. No known method currently proves a uniform spectral gap, and no counterexample is known.
  • Adding x ↦ 3x to the generating set does not put the problem in a known regime either; it is also open.

Some context and what is known

  1. What is special about x ↦ x+1, x ↦ x−1/x The classical example x ↦ ...
0 model reviews
0 human reviews
No reviews yet

o4 mini

Failed UQ Validation
Needs Human Verification
OpenAI
Aug 1, 2025, 12:00 AM

Here is a summary of what is known (and not known) about these “polynomial’’ expanders, and why the question runs head–on into amenability/Property (τ) issues.

  1. Setup. For each prime (p) we build a (d)–regular directed graph (\Gamma_p) on the vertex‐set (\F_p) by choosing a finite set of bijections [ f_1,\dots,f_d:\F_p;\to;\F_p ] and drawing oriented edges (x\to f_i(x)). One a...
0 model reviews
0 human reviews
No reviews yet

o3

UQ Validated
Failed Human Verification
OpenAI
Aug 1, 2025, 12:00 AM

At the moment nobody knows the answer – neither for

S₁ = { x ↦ x+1 , x ↦ x³ } (with the two inverse maps added so that the graph is 4–regular)

nor for

S₂ = { x ↦ x+1 , x ↦ 3x , x ↦ x³ } (again with the inverses added).

In other words, it is completely open whether the family of graphs G(p,S₁) (resp. G(p,S₂)) obtained from the prime fields...

0 model reviews
0 human reviews
No reviews yet

Claude 3.7 Sonnet

Failed UQ Validation
Needs Human Verification
Anthropic
Aug 1, 2025, 12:00 AM

Non-linear Expanders in Cayley Graphs

This question explores whether certain non-linear maps can generate expander families when used to define Cayley graphs over .

Background Context

In expander theory, we typically consider families of graphs with a bounded spectral gap between the largest and second-largest eigenvalues of their adjacency matrices. Fo...

0 model reviews
0 human reviews
No reviews yet

Gemini 2.5 Pro

Failed UQ Validation
Needs Human Verification
Google
Aug 1, 2025, 12:00 AM

This is an excellent and deep question that sits at the junction of several active research areas. The short answer is:

  • Yes, the maps and are strongly believed and essentially proven to generate an expander family.
  • The same is true for the larger set of maps.
  • The mechanism is different from the classical linear examples like and is related ...
0 model reviews
0 human reviews
No reviews yet

Claude Opus 4

Failed UQ Validation
Needs Human Verification
Anthropic
Aug 1, 2025, 12:00 AM

This is a fascinating question about whether certain non-linear maps can generate expander families. Let me break down what we know and what the challenges are.

Current State of Knowledge

The question of whether non-linear maps like (combined with affine maps) can generate expanders is open. This is part of a broader program to understand which algebraic structures can pro...

0 model reviews
0 human reviews
No reviews yet

DeepSeek R1

Failed UQ Validation
Needs Human Verification
DeepSeek
deepseek-ai/DeepSeek-R1
Aug 1, 2025, 12:00 AM
<think> We are considering families of graphs defined on the vertex set \(\mathbb{Z}/p\mathbb{Z}\) for primes \(p\) (with some congruence condition to ensure invertibility). The graphs are defined by connecting each vertex \(x\) to the images of \(x\) under a set of functions and their inverses (if included). The question is whether certain sets of functions yield expander families.

The specific ...

0 model reviews
0 human reviews
No reviews yet

o3 Pro

Failed UQ Validation
Needs Human Verification
OpenAI
Aug 1, 2025, 12:00 AM

Short answer
Nobody knows at present whether the graphs that you ask about are expanders.
The problem is regarded as one of the main open questions at the border‐line between additive–combinatorics, analytic number theory and the theory of expander graphs.


  1. What is known in the particular cases you mention? --------------...
0 model reviews
0 human reviews
Submit Your Model's Answer
Your submission will be validated by our LLM validator and then by human experts

You need to be logged in to submit an answer