Let $G$ be a group and $\omega \left(G\right)$ be the set of element orders of $G$. Let $k\in \omega \left(G\right)$ and $m_k\left(G\right)$ be the number of elements of order $k$ in $G$. Let nse$\left(G\right)=\{m_k\left(G\right):k\in \omega \left(G\right)\}$. Assume $r$ is a prime number and let $G$ be a group such that nse$\left(G\right)=$ nse$\left(S_r\right)$, where $S_r$ is the symmetric group of degree $r$. In this paper we prove that $G\cong S_r$, if $r$ divides the order of $G$ and $r^2$ does not divide it. To get the conclusion we make use of some well-known results on the prime graphs of finite simple groups and their components.

Let $G$ be a finite group and let $\pi \left(G\right)=\{p_1,p_2,...,p_k\}$ be the set of prime divisors of $\left|G\right|$ for which $p_1<p_2<\cdots <p_k$. The Gruenberg-Kegel graph of $G$, denoted $GK\left(G\right)$, is defined as follows: its vertex set is $\pi \left(G\right)$ and two different vertices $p_i$ and $p_j$ are adjacent by an edge if and only if $G$ contains an element of order $p_i{p}_j$. The degree of a vertex $p_i$ in $\mathrm{GK}\left(G\right)$ is denoted by $d_G\left(p_i\right)$ and the $k$-tuple $D\left(G\right)=(d_G\left(p_1\right),d_G\left(p_2\right),...,d_G\left(p_k\right))$ is said to be the degree pattern of $G$. Moreover, if $\omega \subseteq \pi \left(G\right)$ is the vertex set of a connected component of $GK\left(G\right)$, then the largest $\omega$-number which divides $\left|G\right|$, is...

Let $G$ be a finite group. An element $g\in G$ is called a vanishing element if there exists an irreducible complex character $\chi$ of $G$ such that $\chi \left(g\right)=0$. Denote by $\mathrm{Vo}\left(G\right)$ the set of orders of vanishing elements of $G$. Ghasemabadi, Iranmanesh, Mavadatpour (2015), in their paper presented the following conjecture: Let $G$ be a finite group and $M$ a finite nonabelian simple group such that $\mathrm{Vo}\left(G\right)=\mathrm{Vo}\left(M\right)$ and $\left|G\right|=\left|M\right|$. Then $G\cong M$. We answer in affirmative this conjecture for $M=Sz\left(q\right)$, where $q=2^{2n+1}$ and either $q-1$, $q-\sqrt{2q}+1$ or $q+\sqrt{2q}+1$ is a prime number, and $M=F_4\left(q\right)$, where...

Let $G$ be a finite group. The main supergraph $𝒮\left(G\right)$ is a graph with vertex set $G$ in which two vertices $x$ and $y$ are adjacent if and only if $o\left(x\right)\mid o\left(y\right)$ or $o\left(y\right)\mid o\left(x\right)$. In this paper, we will show that $G{\cong }^2{G}_2\left(3^{2n+1}\right)$ if and only if $𝒮\left(G\right)\cong 𝒮{(}^2{G}_2\left(3^{2n+1}\right))$. As a main consequence of our result we conclude that Thompson’s problem is true for the small Ree group ${}^2{G}_2\left(3^{2n+1}\right)$.

Let $G$ be a finite group. The main supergraph $𝒮\left(G\right)$ is a graph with vertex set $G$ in which two vertices $x$ and $y$ are adjacent if and only if $o\left(x\right)\mid o\left(y\right)$ or $o\left(y\right)\mid o\left(x\right)$. In this paper, we will show that $G\cong Sz\left(q\right)$ if and only if $𝒮\left(G\right)\cong 𝒮\left(Sz\right(q\left)\right)$, where $q=2^{2m+1}\ge 8$.

Given an integer $n\ge 3$, let $u_1,...,u_n$ be pairwise coprime integers $\ge 2$, $𝒟$ a family of nonempty proper subsets of $\{1,...,n\}$ with “enough” elements, and $\epsilon$ a function $𝒟\to \{\pm 1\}$. Does there exist at least one prime $q$ such that $q$ divides ${\prod }_{i\in I}{u}_i-\epsilon \left(I\right)$ for some $I\in 𝒟$, but it does not divide $u_1\cdots u_n$? We answer this question in the positive when the $u_i$ are prime powers and $\epsilon$ and $𝒟$ are subjected to certain restrictions. We use the result to prove that, if ${\epsilon }_0\in \{\pm 1\}$ and $A$ is a set of three or more primes that contains all prime divisors of any...

It is proved that real functions on $ℝ$ which can be represented as the difference of two semiconvex functions with a general modulus (or of two lower $C^1$-functions, or of two strongly paraconvex functions) coincide with semismooth functions on $ℝ$ (i.e. those locally Lipschitz functions on $ℝ$ for which $f_{+}^{\text{'}}\left(x\right)={lim}_{t\to x+}{f}_{+}^{\text{'}}\left(t\right)$ and $f_{-}^{\text{'}}\left(x\right)={lim}_{t\to x-}{f}_{-}^{\text{'}}\left(t\right)$ for each $x$). Further, for each modulus $\omega$, we characterize the class $DS{C}_{\omega }$ of functions on $ℝ$ which can be written as $f=g-h$, where $g$ and $h$ are semiconvex with modulus $C\omega$ (for some $C>0$) using a new...

Given a graph $G$, let $f\left(G\right)$ denote the maximum number of edges in a bipartite subgraph of $G$. Given a fixed graph $H$ and a positive integer $m$, let $f(m,H)$ denote the minimum possible cardinality of $f\left(G\right)$, as $G$ ranges over all graphs on $m$ edges that contain no copy of $H$. In this paper we prove that $f(m,{\theta }_{k,s})\ge \frac{1}{2}m+\Omega \left(m^{(2k+1)/(2k+2)}\right)$, which extends the results of N. Alon, M. Krivelevich, B. Sudakov. Write $K_k^{\text{'}}$ and $K_{t,s}^{\text{'}}$ for the subdivisions of $K_k$ and $K_{t,s}$. We show that $f(m,K_k^{\text{'}})\ge \frac{1}{2}m+\Omega \left(m^{(5k-8)/(6k-10)}\right)$ and $f(m,K_{t,s}^{\text{'}})\ge \frac{1}{2}m+\Omega \left(m^{(5t-1)/(6t-2)}\right)$, improving a result of Q. Zeng, J. Hou. We also give lower bounds on...

We consider the equation $$-y^{\text{'}}\left(x\right)+q\left(x\right)y(x-\varphi \left(x\right))=f\left(x\right),x\in ℝ,$$ where $\varphi$ and $q$ ($q\ge 1$) are positive continuous functions for all $x\in ℝ$ and $f\in C\left(ℝ\right)$. By a solution of the equation we mean any function $y$, continuously differentiable everywhere in $ℝ$, which satisfies the equation for all $x\in ℝ$. We show that under certain additional conditions on the functions $\varphi$ and $q$, the above equation has a unique solution $y$, satisfying the inequality $$\parallel y^{\text{'}}{\parallel }_{C\left(ℝ\right)}+{\parallel qy\parallel }_{C\left(ℝ\right)}\le c{\parallel f\parallel }_{C\left(ℝ\right)},$$ where the constant $c\in (0,\infty )$ does not depend on the choice of $f$.

Let $r(G_1,G_2)$ be the Ramsey number of the two graphs $G_1$ and $G_2$. For $n_1\ge n_2\ge 1$ let $S(n_1,n_2)$ be the double star given by $V\left(S(n_1,n_2)\right)=\{v_0,v_1,...,v_{n_1},w_0$, $w_1,...,w_{n_2}\}$ and $E\left(S(n_1,n_2)\right)=\{v_0{v}_1,...,v_0{v}_{n_1},v_0{w}_0,w_0{w}_1,...,w_0{w}_{n_2}\}$. We determine $r(K_{1,m-1},$ $S(n_1,n_2))$ under certain conditions. For $n\ge 6$ let $T_n^3=S(n-5,3)$, $T_n^{\text{'}\text{'}}=(V,E_2)$ and $T_n^{\text{'}\text{'}\text{'}}=(V,E_3)$, where $V=\{v_0,v_1,...,v_{n-1}\}$, $E_2=\{v_0{v}_1,...,v_0{v}_{n-4},v_1{v}_{n-3}$, $v_1{v}_{n-2},v_2{v}_{n-1}\}$ and $E_3=\{v_0{v}_1,...,v_0{v}_{n-4},v_1{v}_{n-3},$ $v_2{v}_{n-2},v_3{v}_{n-1}\}$. We also obtain explicit formulas for $r(K_{1,m-1},T_n)$, $r(T_m^{\text{'}},T_n)$ $(n\ge m+3)$, $r(T_n,T_n)$, $r(T_n^{\text{'}},T_n)$ and $r(P_n,T_n)$, where $T_n\in \{T_n^{\text{'}\text{'}},T_n^{\text{'}\text{'}\text{'}},T_n^3\}$, $P_n$ is the path on $n$ vertices and $T_n^{\text{'}}$ is the unique tree with $n$ vertices and maximal degree $n-2$.