Two bounds on the noncommuting graph

From MaRDI portal
Publication:317649

DOI10.1515/MATH-2015-0027zbMATH Open1346.05102arXiv1502.01287OpenAlexW3105664938MaRDI QIDQ317649FDOQ317649

S. Nardulli, Francesco Russo

Publication date: 4 October 2016

Published in: Open Mathematics (Search for Journal in Brave)

Abstract: ErdH{o}s introduced the noncommuting graph, in order to study the number of commuting elements in a finite group. Despite the use of combinatorial ideas, his methods involved several techniques of classical analysis. The interest for this graph is becoming relevant in the last years for various reasons. Here we deal with a numerical aspect, showing for the first time an isoperimetric inequality and an analytic condition in terms of Sobolev inequalities. This last result holds in the more general context of weighted locally finite graphs.


Full work available at URL: https://arxiv.org/abs/1502.01287




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Two bounds on the noncommuting graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q317649)