The spectrum of a finite group is the set element orders this group. main goal paper to survey results concerning recognition simple groups by spectrum, in particular, list all for which problem solved.

Let $$G=(V,E)$$ be a finite graph (here V and E denote the set of vertices edges G respectively) $$M_G$$ centered Hardy–Littlewood maximal operator defined there. We find optimal value $$\mathbf{{C}}_{G,p}$$ such that inequality $$\begin{aligned} \mathrm{Var\,}_{p}M_{G}f\le \mathbf{C}_{G,p}\mathrm{Var\,}_{p}f \end{aligned}$$ holds for every $$f:V\rightarrow {\mathbb {R}},$$ where $$\mathrm{Var\...

In this note we review a simple criterion, due to Ekedahl, for superspecial curves defined over finite fields.Using this we generalize and give some simple proofs for some well-known superspecial curves.

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 30 November 2020Accepted: 26 July 2021Published online: 18 2021Keywordscounting modulo 2, counting complexity, graph homomorphisms, parity complexity dichotomyAMS Subject Headings68Q17, 68Q25Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society...