On Diameters of Cayley Graphs over Special Linear Groups

Eitan Porat
{"title":"On Diameters of Cayley Graphs over Special Linear Groups","authors":"Eitan Porat","doi":"arxiv-2409.06929","DOIUrl":null,"url":null,"abstract":"We prove for the matrix group $G=\\mathrm{SL}_{n}\\left(\\mathbb{F}_{p}\\right)$\nthat there exist absolute constants $c\\in\\left(0,1\\right)$ and $C>0$ such that\nany symmetric generating set $A$, with $\\left|A\\right|\\geq\\left|G\\right|^{1-c}$\nhas covering number $\\leq\nC\\left(\\log\\left(\\frac{\\left|G\\right|}{\\left|A\\right|}\\right)\\right)^{2}.$ This\nresult is sharp up to the value of the constant $C>0$.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.06929","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We prove for the matrix group $G=\mathrm{SL}_{n}\left(\mathbb{F}_{p}\right)$ that there exist absolute constants $c\in\left(0,1\right)$ and $C>0$ such that any symmetric generating set $A$, with $\left|A\right|\geq\left|G\right|^{1-c}$ has covering number $\leq C\left(\log\left(\frac{\left|G\right|}{\left|A\right|}\right)\right)^{2}.$ This result is sharp up to the value of the constant $C>0$.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
论特殊线性群上 Cayley 图的直径
对于矩阵组 $G=\mathrm{SL}_{n}\left(\mathbb{F}_{p}\right)$,我们证明存在绝对常数 $c\in\left(0,1\right)$ 和 $C>0$,使得任何对称生成集 $A$、有$\left|A\right|\geq\left|G\right|^{1-c}$的覆盖数为$\leqC\left(\log\left(\frac{left|G\right|}{\left|A\right|}\right))^{2}。$ 这个结果在常数 $C>0$ 的值范围内都是尖锐的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A note on connectivity in directed graphs Proof of a conjecture on graph polytope Generalized Andrásfai--Erdős--Sós theorems for odd cycles The repetition threshold for ternary rich words Isomorphisms of bi-Cayley graphs on generalized quaternion groups
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1