On an extension of the Frobenius^{\prime } theorem about p-nilpotency of a finite group

Suppose that \(G\) is a finite group and \(H\) is a subgroup of \(G\) . \(H\) is said to be \(s\) -quasinormally embedded in \(G\) if for each prime \(p\) dividing the order of \(H\) , a Sylow \(p\) -subgroup of \(H\) is also a Sylow \(p\) -subgroup of some \(s\) -quasinormal subgroup of \(G\) . We fix in every non-cyclic Sylow subgroup \(P\) of \(G\) some subgroup \(D\) satisfying \(1<|D|<|P|\) and study the \(p\) -nilpotency of \(G\) under the assumption that every subgroup \(H\) of \(P\) with \(|H|=|D|\) is \(s\) -quasinormally embedded in \(G\) . Some recent results and the Frobenius \(^{\prime }\) theorem are generalized.     

On weakly closed subgroups of finite groups

Suppose that \(G\) is a finite group and \(H\) , \(K\) are subgroups of \(G\) . We say that \(H\) is weakly closed in \(K\) with respect to \(G\) if, for any \(g \in G\) such that \(H^{g}\le K\) , we have \(H^{g}=H\) . In particular, when \(H\) is a subgroup of prime-power order and \(K\) is a Sylow subgroup containing it, \(H\) is simply said to be a weakly closed subgroup of \(G\) or weakly closed in \(G\) . In the paper, we investigate the structure of finite groups by means of weakly closed subgroups.     

Fully inert subgroups of free Abelian groups

A subgroup \(H\) of an Abelian group \(G\) is called fully inert if \((\phi H + H)/H\) is finite for every \(\phi \in \mathrm{End}(G)\) . Fully inert subgroups of free Abelian groups are characterized. It is proved that \(H\) is fully inert in the free group \(G\) if and only if it is commensurable with \(n G\) for some \(n \ge 0\) , that is, \((H + nG)/H\) and \((H + nG)/nG\) are both finite. From this fact we derive a more structural characterization of fully inert subgroups \(H\) of free groups \(G\) , in terms of the Ulm–Kaplansky invariants of \(G/H\) and the Hill–Megibben invariants of the exact sequence \(0 \rightarrow H \rightarrow G \rightarrow G/H \rightarrow 0\) .     

On the commuting probability and supersolvability of finite groups

For a finite group \(G\) , let \(d(G)\) denote the probability that a randomly chosen pair of elements of \(G\) commute. We prove that if \(d(G)>1/s\) for some integer \(s>1\) and \(G\) splits over an abelian normal nontrivial subgroup \(N\) , then \(G\) has a nontrivial conjugacy class inside \(N\) of size at most \(s-1\) . We also extend two results of Barry, MacHale, and Ní Shé on the commuting probability in connection with supersolvability of finite groups. In particular, we prove that if \(d(G)>5/16\) then either \(G\) is supersolvable, or \(G\) isoclinic to \(A_4\) , or \(G/\mathbf{Z}(G)\) is isoclinic to \(A_4\) .     

Characterization of ellipses as uniformly dense sets with respect to a family of convex bodies

Let \(K\subset \mathbb R ^N\) be a convex body containing the origin. A measurable set \(G\subset \mathbb R ^N\) with positive Lebesgue measure is said to be uniformly \(K\) -dense if, for any fixed \(r>0\) , the measure of \(G\cap (x+r K)\) is constant when \(x\) varies on the boundary of \(G\) (here, \(x+r K\) denotes a translation of a dilation of \(K\) ). We first prove that \(G\) must always be strictly convex and at least \(C^{1,1}\) -regular; also, if \(K\) is centrally symmetric, \(K\) must be strictly convex, \(C^{1,1}\) -regular and such that \(K=G-G\) up to homotheties; this implies in turn that \(G\) must be \(C^{2,1}\) -regular. Then for \(N=2\) , we prove that \(G\) is uniformly \(K\) -dense if and only if \(K\) and \(G\) are homothetic to the same ellipse. This result was already proven by Amar et al. in 2008 . However, our proof removes their regularity assumptions on \(K\) and \(G\) , and more importantly, it is susceptible to be generalized to higher dimension since, by the use of Minkowski’s inequality and an affine inequality, avoids the delicate computations of the higher-order terms in the Taylor expansion near \(r=0\) for the measure of \(G\cap (x+r\,K)\) (needed in 2008).     

Groups whose primary subgroups are normal sensitive

A subgroup \(H\) of a group \(G\) is said to be normal sensitive in \(G\) if for every normal subgroup \(N\) of \(H, N=H\cap N^{G}\) . In this paper we study locally finite groups whose \(p\) -subgroups are normal sensitive. We show the connection between these groups and groups in which Sylow permutability is transitive.     

Algebraic quotient modules and subgroup depth

In Kadison J Pure Appl Alg 218:367–380, (2014) it was shown that subgroup depth may be computed from the permutation module of the left or right cosets: this holds more generally for a Hopf subalgebra, from which we note in this paper that finite depth of a Hopf subalgebra \(R \subseteq H\) is equivalent to the \(H\) -module coalgebra \(Q = H/R^+H\) representing an algebraic element in the Green ring of \(H\) or \(R\) . This approach shows that subgroup depth and the subgroup depth of the corefree quotient lie in the same closed interval of length one. We also establish a previous claim that the problem of determining if \(R\) has finite depth in \(H\) is equivalent to determining if \(H\) has finite depth in its smash product \(Q^* \# H\) . A necessary condition is obtained for finite depth from stabilization of a descending chain of annihilator ideals of tensor powers of \(Q\) . As an application of these topics to a centerless finite group \(G\) , we prove that the minimum depth of its group \(\mathbb {C}\,\) -algebra in the Drinfeld double \(D(G)\) is an odd integer, which determines the least tensor power of the adjoint representation \(Q\) that is a faithful \(\mathbb {C}\,G\) -module.     

The V-filtration for tame unit F-crystals

Let \(X\) be a smooth variety over an algebraically closed field of characteristic \(p > 0, Z\) a smooth divisor, and \(j: U=X {\setminus } Z \rightarrow X\) the natural inclusion. We introduce in an axiomatic way the notion of a \(V\) -filtration on unit \(F\) -crystals and prove such axioms determine a unique filtration. It is shown that if \(\mathcal M \) is a tame unit \(F\) -crystal on \(U\) , then such a \(V\) -filtration along \(Z\) exists on \(j_*\mathcal M \) . The degree zero component of the associated graded module is proven to be the (unipotent) nearby cycles functor of Grothendieck and Deligne under the Emerton–Kisin Riemann–Hilbert correspondence. A few applications to \(\mathbb A ^1\) and gluing are then discussed.     

Approximation faible et principe de Hasse pour des espaces homogènes à stabilisateur fini résoluble

Let \(K\) be a global field and \(G\) a finite solvable \(K\) -group. Under certain hypotheses concerning the extension splitting \(G\) , we show that the homogeneous space \(V=G'/G\) with \(G'\) a semi-simple simply connected \(K\) -group has the weak approximation property. We use a more precise version of this result to prove the Hasse principle for homogeneous spaces \(X\) under a semi-simple simply connected \(K\) -group \(G'\) with finite solvable geometric stabilizer \({\bar{G}}\) , under certain hypotheses concerning the \(K\) -kernel (or \(K\) -lien) \(({\bar{G}},\kappa )\) defined by \(X\) .     

On extensions of completely simple semigroups by groups

An example of an extension of a completely simple semigroup \(U\) by a group \(H\) is given which cannot be embedded into the wreath product of \(U\) by \(H\) . On the other hand, every central extension of \(U\) by \(H\) is shown to be embeddable in the wreath product of \(U\) by \(H\) , and any extension of \(U\) by \(H\) is proved to be embeddable in a semidirect product of a completely simple semigroup \(V\) by \(H\) where the maximal subgroups of \(V\) are direct powers of those of \(U\) .     

On matching cover of graphs

A k-matching cover of a graph \(G\) is a union of \(k\) matchings of \(G\) which covers \(V(G)\) . The matching cover number of \(G\) , denoted by \(mc(G)\) , is the minimum number \(k\) such that \(G\) has a \(k\) -matching cover. A matching cover of \(G\) is optimal if it consists of \(mc(G)\) matchings of \(G\) . In this paper, we present an algorithm for finding an optimal matching cover of a graph on \(n\) vertices in \(O(n^3)\) time (if use a faster maximum matching algorithm, the time complexity can be reduced to \(O(nm)\) , where \(m=|E(G)|\) ), and give an upper bound on matching cover number of graphs. In particular, for trees, a linear-time algorithm is given, and as a by-product, the matching cover number of trees is determined.     

Selmer groups over {\mathbb {Z}}_p^d-extensions

Consider an abelian variety \(A\) defined over a global field \(K\) and let \(L/K\) be a \({\mathbb {Z}}_p^d\) -extension, unramified outside a finite set of places of \(K\) , with \({{\mathrm{Gal}}}(L/K)=\Gamma \) . Let \(\Lambda (\Gamma ):={\mathbb {Z}}_p[[\Gamma ]]\) denote the Iwasawa algebra. In this paper, we study how the characteristic ideal of the \(\Lambda (\Gamma )\) -module \(X_L\) , the dual \(p\) -primary Selmer group, varies when \(L/K\) is replaced by a strict intermediate \({\mathbb {Z}}_p^e\) -extension.     

Neighbour-transitive codes in Johnson graphs

The Johnson graph \(J(v,k)\) has, as vertices, the \(k\) -subsets of a \(v\) -set \(\mathcal {V}\) and as edges the pairs of \(k\) -subsets with intersection of size \(k-1\) . We introduce the notion of a neighbour-transitive code in \(J(v,k)\) . This is a proper vertex subset \(\Gamma \) such that the subgroup \(G\) of graph automorphisms leaving \(\Gamma \) invariant is transitive on both the set \(\Gamma \) of ‘codewords’ and also the set of ‘neighbours’ of \(\Gamma \) , which are the non-codewords joined by an edge to some codeword. We classify all examples where the group \(G\) is a subgroup of the symmetric group \(\mathrm{Sym}\,(\mathcal {V})\) and is intransitive or imprimitive on the underlying \(v\) -set \(\mathcal {V}\) . In the remaining case where \(G\le \mathrm{Sym}\,(\mathcal {V})\) and \(G\) is primitive on \(\mathcal {V}\) , we prove that, provided distinct codewords are at distance at least \(3\) , then \(G\) is \(2\) -transitive on \(\mathcal {V}\) . We examine many of the infinite families of finite \(2\) -transitive permutation groups and construct surprisingly rich families of examples of neighbour-transitive codes. A major unresolved case remains.     

Bounding the exponent of a verbal subgroup

We deal with the following conjecture. If \(w\) is a group word and \(G\) is a finite group in which any nilpotent subgroup generated by \(w\) -values has exponent dividing \(e\) , then the exponent of the verbal subgroup \(w(G)\) is bounded in terms of \(e\) and \(w\) only. We show that this is true in the case where \(w\) is either the \(n\text{ th }\) Engel word or the word \([x^n,y_1,y_2,\ldots ,y_k]\) (Theorem A). Further, we show that for any positive integer \(e\) there exists a number \(k=k(e)\) such that if \(w\) is a word and \(G\) is a finite group in which any nilpotent subgroup generated by products of \(k\) values of the word \(w\) has exponent dividing \(e\) , then the exponent of the verbal subgroup \(w(G)\) is bounded in terms of \(e\) and \(w\) only (Theorem B).     

Optimal mass transport and symmetric representations of their cost functions

We consider Monge–Kantorovich problems corresponding to general cost functions \(c(x,y)\) but with symmetry constraints on a Polish space \(X\times X\) . Such couplings naturally generate anti-symmetric Hamiltonians on \(X\times X\) that are \(c\) -convex with respect to one of the variables. In particular, if \(c\) is differentiable with respect to the first variable on an open subset \(X\) in \( \mathbb {R}^d\) , we show that for every probability measure \(\mu \) on \(X\) , there exists a symmetric probability measure \(\pi _0\) on \(X\times X\) with marginals \(\mu \) , and an anti-symmetric Hamiltonian \(H\) such that \(\nabla _2H(y, x)=\nabla _1c(x,y)\) for \( \pi _0\) -almost all \((x,y) \in X \times X.\) If \(\pi _0\) is supported on a graph \((x, Sx)\) , then \(S\) is necessarily a \(\mu \) -measure preserving involution (i.e., \(S^2=I\) ) and \(\nabla _2H(x, Sx)=\nabla _1c(Sx,x)\) for \(\mu \) -almost all \(x \in X.\) For monotone cost functions such as those given by \(c(x,y)=\langle x, u(y)\rangle \) or \(c(x,y)=-|x-u(y)|^2\) where \(u\) is a monotone operator, \(S\) is necessarily the identity yielding a classical result by Krause, namely that \(u(x)=\nabla _2H(x, x)\) where \(H\) is anti-symmetric and concave-convex.     

On a result of Moeglin and Waldspurger in residual characteristic 2

Let \(F\) be a \(p\) -adic field, \(\mathbf G\) a connected reductive group over \(F\) , and \(\pi \) an irreducible admissible representation of \(\mathbf G(F)\) . A result of Moeglin and Waldspurger states that, if the residual characteristic of \(F\) is different from \(2\) , then the ‘leading’ coefficients in the character expansion of \(\pi \) at the identity element of \(\mathbf G(F)\) give the dimensions of certain spaces of degenerate Whittaker forms. In this paper, we extend their result to residual characteristic 2. The outline of the proof is the same as in the original paper of Moeglin and Waldspurger, but certain constructions are modified to accommodate the case of even residual characteristic.     

Hyperreflexivity of bounded N-cocycle spaces of banach algebras

Let \(X\) and \(Y\) be Banach spaces, \(n\in \mathbb {N}\) , and \(B^n(X,Y)\) the space of bounded \(n\) -linear maps from \(X\times \ldots \times X\) ( \(n\) -times) into \(Y\) . The concept of hyperreflexivity has already been defined for subspaces of \(B(X,Y)\) , where \(X\) and \(Y\) are Banach spaces. We extend this concept to the subspaces of \(B^n(X,Y)\) , taking into account its \(n\) -linear structure. We then investigate when \(\mathcal {Z}^n(A,X)\) , the space of all bounded \(n\) -cocycles from a Banach algebra \(A\) into a Banach \(A\) -bimodule \(X\) , is hyperreflexive. Our approach is based on defining two notions related to a Banach algebra, namely the strong property \((\mathbb {B})\) and bounded local units, and then applying them to find uniform criterions under which \(\mathcal {Z}^n(A,X)\) is hyperreflexive. We also demonstrate that these criterions are satisfied in variety of examples including large classes of C \(^*\) -algebras and group algebras and thereby providing various examples of hyperreflexive \(n\) -cocyle spaces. One advantage of our approach is that not only we obtain the hyperreflexivity for bounded \(n\) -cocycle spaces in different cases but also our results generalize the earlier ones on the hyperreflexivity of bounded derivation spaces, i.e. when \(n=1\) , in the literature. Finally, we investigate the hereditary properties of the strong property \((\mathbb {B})\) and b.l.u. This allows us to come with more examples of bounded \(n\) -cocycle spaces which are hyperreflexive.     

A groupoid generalisation of Leavitt path algebras

Let \(G\) be a locally compact, Hausdorff, étale groupoid whose unit space is totally disconnected. We show that the collection \(A(G)\) of locally-constant, compactly supported complex-valued functions on \(G\) is a dense \(*\) -subalgebra of \(C_c(G)\) and that it is universal for algebraic representations of the collection of compact open bisections of \(G\) . We also show that if \(G\) is the groupoid associated to a row-finite graph or \(k\) -graph with no sources, then \(A(G)\) is isomorphic to the associated Leavitt path algebra or Kumjian–Pask algebra. We prove versions of the Cuntz–Krieger and graded uniqueness theorems for \(A(G)\) .     

Minimum total coloring of planar graph

Graph coloring is an important tool in the study of optimization, computer science, network design, e.g., file transferring in a computer network, pattern matching, computation of Hessians matrix and so on. In this paper, we consider one important coloring, vertex coloring of a total graph, which is familiar to us by the name of “total coloring”. Total coloring is a coloring of \(V\cup {E}\) such that no two adjacent or incident elements receive the same color. In other words, total chromatic number of \(G\) is the minimum number of disjoint vertex independent sets covering a total graph of \(G\) . Here, let \(G\) be a planar graph with \(\varDelta \ge 8\) . We proved that if for every vertex \(v\in V\) , there exists two integers \(i_{v},j_{v} \in \{3,4,5,6,7,8\}\) such that \(v\) is not incident with intersecting \(i_v\) -cycles and \(j_v\) -cycles, then the vertex chromatic number of total graph of \(G\) is \(\varDelta +1\) , i.e., the total chromatic number of \(G\) is \(\varDelta +1\) .