A characterization of $$A_{5}$$ by its Same-order type

Let G be a group. The same-order type of G may be defined to be the set of sizes of equivalence classes for the equivalence relation \(\thicksim \) on G defined by

$$\begin{aligned} \forall \ g, h \in G \ \ g\thicksim h \Longleftrightarrow |g|=|h|. \end{aligned}$$

Shen et al. (Monatsh Math 160:337–341,2010), showed that \(A_5\) is the only group with the same-order type \(\{1,15,20,24\}\). In this paper, among other things, we prove that a nonabelian simple group G has same-order type with just four members if and only if \(G\cong A_5\).

     

A group of continuous self-maps on a topological groupoid

The group of bisections of groupoids plays an important role in the study of Lie groupoids. In this paper another construction is introduced. Indeed, for a topological groupoid G, the set of all continuous self-maps f on G such that (x, f(x)) is a composable pair for every \(x\in G\), is denoted by \(S_G\). We show that \(S_G\) by a natural binary operation is a monoid. \(S_G(\alpha )\), the group of units in \(S_G\) precisely consists of those \(f\in S_G\) such that the map \(x\mapsto xf(x)\) is a bijection on G. Similar to the group of bisections, \(S_G(\alpha )\) acts on G from the right and on the space of continuous self-maps on G from the left. It is proved that \(S_G(\alpha )\) with the compact- open topology inherited from C(G, G) is a left topological group. For a compact Hausdorff groupoid G it is proved that the group of bisections of \(G^2\) is isomorphic to the group \(S_G(\alpha )\) and the group of transitive bisections of G, \(Bis_T(G)\), is embedded in \(S_G(\alpha )\), where \(G^2\) is the groupoid of all composable pairs.     

Fixed point compactifications

A fixed point compactification of a locally compact noncompact group G is a faithful semigroup compactification S such that \(ap=pa=p\) for all \(p\in S\setminus G\) and \(a\in G\). Since the right translations are continuous, the remainder of a fixed point compactification is a right zero semigroup. Among all fixed point compactifications of G there is a largest one, denoted \(\theta G\). We show that if G is \(\sigma \)-compact, then \(\theta G\setminus G\) contains a copy of \(\beta \omega \setminus \omega \). In contrast, if G is not \(\sigma \)-compact, then \(\theta G\) is the one-point compactification.     

The non-abelian tensor square of residually finite groups

Let m, n be positive integers and p a prime. We denote by \(\nu (G)\) an extension of the non-abelian tensor square \(G \otimes G\) by \(G \times G\). We prove that if G is a residually finite group satisfying some non-trivial identity \(f \equiv ~1\) and for every \(x,y \in G\) there exists a p-power \(q=q(x,y)\) such that \([x,y^{\varphi }]^q = 1\), then the derived subgroup \(\nu (G)'\) is locally finite (Theorem A). Moreover, we show that if G is a residually finite group in which for every \(x,y \in G\) there exists a p-power \(q=q(x,y)\) dividing \(p^m\) such that \([x,y^{\varphi }]^q\) is left n-Engel, then the non-abelian tensor square \(G \otimes G\) is locally virtually nilpotent (Theorem B).     

Homomorphism reductions on Polish groups

In an earlier paper, we introduced the following pre-order on the subgroups of a given Polish group: if G is a Polish group and \(H,L \subseteq G\) are subgroups, we say H is homomorphism reducible to L iff there is a continuous group homomorphism \(\varphi : G \rightarrow G\) such that \(H = \varphi ^{-1} (L)\). We previously showed that there is a \(K_\sigma \) subgroup L of the countable power of any locally compact Polish group G such that every \(K_\sigma \) subgroup of \(G^\omega \) is homomorphism reducible to L. In the present work, we show that this fails in the countable power of the group of increasing homeomorphisms of the unit interval.     

Anti-Ramsey Numbers of Graphs with Small Connected Components

The anti-Ramsey number, AR(n, G), for a graph G and an integer \(n\ge |V(G)|\), is defined to be the minimal integer r such that in any edge-colouring of \(K_n\) by at least r colours there is a multicoloured copy of G, namely, a copy of G that each of its edges has a distinct colour. In this paper we determine, for large enough \(n,\, AR(n,L\cup tP_2)\) and \(AR(n,L\cup kP_3)\) for any large enough t and k, and a graph L satisfying some conditions. Consequently, we determine AR(n, G), for large enough n, where G is \(P_3\cup tP_2\) for any \(t\ge 3,\, P_4\cup tP_2\) and \(C_3\cup tP_2\) for any \(t\ge 2,\, kP_3\) for any \(k\ge 3,\, tP_2\cup kP_3\) for any \(t\ge 1,\, k\ge 2\), and \(P_{t+1}\cup kP_3\) for any \(t\ge 3,\, k\ge 1\). Furthermore, we obtain upper and lower bounds for AR(n, G), for large enough n, where G is \(P_{k+1}\cup tP_2\) and \(C_k\cup tP_2\) for any \(k\ge 4,\, t\ge 1\).     

Sets of minimal distances and characterizations of class groups of Krull monoids

Let H be a Krull monoid with finite class group G such that every class contains a prime divisor. Then every non-unit \(a \in H\) can be written as a finite product of atoms, say \(a=u_1 \cdot \ldots \cdot u_k\). The set \(\mathsf L (a)\) of all possible factorization lengths k is called the set of lengths of a. There is a constant \(M \in \mathbb N\) such that all sets of lengths are almost arithmetical multiprogressions with bound M and with difference \(d \in \Delta ^* (H)\), where \(\Delta ^* (H)\) denotes the set of minimal distances of H. We study the structure of \(\Delta ^* (H)\) and establish a characterization when \(\Delta ^*(H)\) is an interval. The system \(\mathcal L (H) = \{ \mathsf L (a) \mid a \in H \}\) of all sets of lengths depends only on the class group G, and a standing conjecture states that conversely the system \(\mathcal L (H)\) is characteristic for the class group. We confirm this conjecture (among others) if the class group is isomorphic to \(C_n^r\) with \(r,n \in \mathbb N\) and \(\Delta ^*(H)\) is not an interval.     

A method to find generators of a semi-simple Lie group via the topology of its flag manifolds

In this paper we continue to develop the topological method to get semigroup generators of semi-simple Lie groups. Consider a subset \(\Gamma \subset G\) that contains a semi-simple subgroup \(G_{1}\) of G. If one can show that \( \Gamma \) does not leave invariant a contractible subset on any flag manifold of G, then \(\Gamma \) generates G if \(\mathrm {Ad}\left( \Gamma \right) \) generates a Zariski dense subgroup of the algebraic group \(\mathrm {Ad}\left( G\right) \). The proof is reduced to check that some specific closed orbits of \(G_{1}\) in the flag manifolds of G are not trivial in the sense of algebraic topology. Here, we consider three different cases of semi-simple Lie groups G and subgroups \(G_{1}\subset G\).     

Upper Bounds for the Paired-Domination Numbers of Graphs

A set \(S\subseteq V\) is a paired-dominating set if every vertex in \(V{\setminus } S\) has at least one neighbor in S and the subgraph induced by S contains a perfect matching. The paired-domination number of a graph G, denoted by \(\gamma _{pr}(G)\), is the minimum cardinality of a paired-dominating set of G. A conjecture of Goddard and Henning says that if G is not the Petersen graph and is a connected graph of order n with minimum degree \(\delta (G)\ge 3\), then \(\gamma _{pr}(G)\le 4n/7\). In this paper, we confirm this conjecture for k-regular graphs with \(k\ge 4\).     

Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs

Given a connected simple graph \(G=(V(G),E(G))\), a set \(S\subseteq V(G)\) is said to be a 2-metric generator for G if and only if for any pair of different vertices \(u,v\in V(G)\), there exist at least two vertices \(w_1,w_2\in S\) such that \(d_G(u,w_i)\ne d_G(v,w_i)\), for every \(i\in \{1,2\}\), where \(d_G(x,y)\) is the length of a shortest path between x and y. The minimum cardinality of a 2-metric generator is the 2-metric dimension of G, denoted by \(\dim _2(G)\). The metric \(d_{G,2}: V(G)\times V(G)\longmapsto {\mathbb {N}}\cup \{0\}\) is defined as \(d_{G,2}(x,y)=\min \{d_G(x,y),2\}\). Now, a set \(S\subseteq V(G)\) is a 2-adjacency generator for G, if for every two vertices \(x,y\in V(G)\) there exist at least two vertices \(w_1,w_2\in S\), such that \(d_{G,2}(x,w_i)\ne d_{G,2}(y,w_i)\) for every \(i\in \{1,2\}\). The minimum cardinality of a 2-adjacency generator is the 2-adjacency dimension of G, denoted by \({\mathrm {adim}}_2(G)\). In this article, we obtain closed formulae for the 2-metric dimension of the lexicographic product \(G\circ H\) of two graphs G and H. Specifically, we show that \(\dim _2(G\circ H)=n\cdot {\mathrm {adim}}_2(H)+f(G,H),\) where \(f(G,H)\ge 0\), and determine all the possible values of f(G, H).     

Distance Magic Labeling in Complete 4-partite Graphs

Let G be a complete k-partite simple undirected graph with parts of sizes \(p_1\le p_2\cdots \le p_k\). Let \(P_j=\sum _{i=1}^jp_i\) for \(j=1,\ldots ,k\). It is conjectured that G has distance magic labeling if and only if \(\sum _{i=1}^{P_j} (n-i+1)\ge j{{n+1}\atopwithdelims (){2}}/k\) for all \(j=1,\ldots ,k\). The conjecture is proved for \(k=4\), extending earlier results for \(k=2,3\).     

On the density of images of the power maps in Lie groups

Let G be a connected Lie group. In this paper, we study the density of the images of individual power maps \(P_k:G\rightarrow G:g\mapsto g^k\). We give criteria for the density of \(P_k(G)\) in terms of regular elements, as well as Cartan subgroups. In fact, we prove that if \(\mathrm{Reg}(G)\) is the set of regular elements of G, then \(P_k(G)\cap \mathrm{Reg}(G)\) is closed in \(\mathrm{Reg}(G)\). On the other hand, the weak exponentiality of G turns out to be equivalent to the density of all the power maps \(P_k\). In linear Lie groups, weak exponentiality reduces to the density of \(P_2(G)\). We also prove that the density of the image of \(P_k\) for G implies the same for any connected full rank subgroup.     

2-Domination number of generalized Petersen graphs

Let \(G=(V,E)\) be a graph. A subset \(S\subseteq V\) is a k-dominating set of G if each vertex in \(V-S\) is adjacent to at least k vertices in S. The k-domination number of G is the cardinality of the smallest k-dominating set of G. In this paper, we shall prove that the 2-domination number of generalized Petersen graphs \(P(5k+1, 2)\) and \(P(5k+2, 2)\), for \(k>0\), is \(4k+2\) and \(4k+3\), respectively. This proves two conjectures due to Cheng (Ph.D. thesis, National Chiao Tung University, 2013). Moreover, we determine the exact 2-domination number of generalized Petersen graphs P(2k, k) and \(P(5k+4,3)\). Furthermore, we give a good lower and upper bounds on the 2-domination number of generalized Petersen graphs \(P(5k+1, 3), P(5k+2,3)\) and \(P(5k+3, 3).\)     

A characterization of the desarguesian and the Figueroa planes of order $$q^{3}$$

Let \(\Pi \) be a plane of order \(q^{3}\), \(q>2\), admitting \(G\cong PGL(3,q)\) as a collineation group. By Dempwolff (Geometriae Dedicata 18:101–112, 1985) the plane \(\Pi \) contains a G-invariant subplane \(\pi _{0}\) isomorphic to PG(2, q) on which G acts 2-transitively. In this paper it is shown that, if the homologies of \(\pi _{0}\) contained in G extend to \(\Pi \) then \(\Pi \) is either the desarguesian or the Figueroa plane.     

Packing Chromatic Number of Base-3 Sierpiński Graphs

The packing chromatic number \(\chi _{\rho }(G)\) of a graph G is the smallest integer k such that there exists a k-vertex coloring of G in which any two vertices receiving color i are at distance at least \(i+1\). Let \(S^n\) be the base-3 Sierpiński graph of dimension n. It is proved that \(\chi _{\rho }(S^1) = 3\), \(\chi _{\rho }(S^2) = 5\), \(\chi _{\rho }(S^3) = \chi _{\rho }(S^4) = 7\), and that \(8\le \chi _\rho (S^n) \le 9\) holds for any \(n\ge 5\).     

On $$\mathcal {}$$-subgroups of finite groups

Let G be a finite group. A subgroup H of G is s-permutable in G if H permutes with every Sylow subgroup of G. A subgroup H of G is called an \(\mathcal {SSH}\)-subgroup in G if G has an s-permutable subgroup K such that \(H^{sG} = HK\) and \(H^g \cap N_K (H) \leqslant H\), for all \(g \in G\), where \(H^{sG}\) is the intersection of all s-permutable subgroups of G containing H. We study the structure of finite groups under the assumption that the maximal or the minimal subgroups of Sylow subgroups of some normal subgroups of G are \(\mathcal {SSH}\)-subgroups in G. Several recent results from the literature are improved and generalized.     

On Star–Wheel Ramsey Numbers

For two given graphs \(G_1\) and \(G_2\), the Ramsey number \(R(G_1,G_2)\) is the least integer r such that for every graph G on r vertices, either G contains a \(G_1\) or \(\overline{G}\) contains a \(G_2\). In this note, we determined the Ramsey number \(R(K_{1,n},W_m)\) for even m with \(n+2\le m\le 2n-2\), where \(W_m\) is the wheel on \(m+1\) vertices, i.e., the graph obtained from a cycle \(C_m\) by adding a vertex v adjacent to all vertices of the \(C_m\).     

Finite groups with <Emphasis Type="Italic">SS</Emphasis>-supplement

Let G be a finite group. A subgroup H of G is said to be SS-quasinormal in G if there is a subgroup K such that \(G=HK\) and \(HS=SH\), for all \(S\in \) Syl(K), where Syl(K) denotes the collection of all Sylow subgroups of K. A subgroup H of G is said to be SS-supplemented in G if there is a subgroup K such that \(G=HK\) and \(H\cap K\) is SS-quasinormal in G. In this paper, we investigate the SS-supplemented subgroups and strengthen a result of Skiba which gives a positive answer to an open question of Shemetkov.     

Prime Power Indices in Factorised Groups

Let the group \(G=AB\) be the product of the subgroups A and B. We determine some structural properties of G when the p-elements in \(A\cup B\) have prime power indices in G, for some prime p. More generally, we also consider the case that all prime power order elements in \(A\cup B\) have prime power indices in G. In particular, when \(G=A=B\), we obtain as a consequence some known results.