Papers
Topics
Authors
Recent
Search
2000 character limit reached

The trivial lower bound for the girth of $S_n$

Published 29 Jun 2017 in math.GR and math.CO | (1706.09972v1)

Abstract: Consider the Cayley graph of $S_n$ generated by a random pair of elements $x,y$. Conjecturally, the girth of this graph is $\Omega(n \log n)$ with probability tending to $1$ as $n\to\infty$. We show that it is at least $\Omega(n{1/3})$.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Sean Eberhard 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up