Isomorphic Steiner symmetrization of p-convex sets

In this paper we show that given a \(p\) -convex set \(K \subset \mathbb{R }^n\) , there exist \(5n\) Steiner symmetrizations that transform it into an isomorphic Euclidean ball. That is, if \(|K| = |D_n| = \kappa _n\) , we may symmetrize it, using \(5n\) Steiner symmetrizations, into a set \(K'\) such that \(c_p D_n \subset K' \subset C_p D_n\) , where \(c_p\) and \(C_p\) are constants dependent on \(p\) only.     

Recognition of \text {PSL}(2,p) by order and some information on its character degrees where p is a prime

Let \(G\) be a finite group and \(\text {cd}(G)\) be the set of irreducible character degrees of \(G\) . In this paper we prove that if \(p\) is a prime number, then the simple group \(\text {PSL}(2,p)\) is uniquely determined by its order and some information about its character degrees. In fact we prove that if \(G\) is a finite group such that (i) \(|G|=|\text {PSL}(2,p)|\) , (ii) \(p\in \text {cd}(G)\) , (iii) \(\text {cd}(G)\) has an even integer, and (iv) there does not exist any element \(a\in \text {cd}(G)\) such that \(2p\mid a\) , then \(G\cong \text {PSL}(2,p)\) . As a consequence of our result we get that \(\text {PSL}(2,p)\) is uniquely determined by its order and the largest and the second largest character degrees.     

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).     

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\) .     

Tree metrics and edge-disjoint S-paths

Given an undirected graph \(G=(V,E)\) with a terminal set \(S \subseteq V\) , a weight function on terminal pairs, and an edge-cost \(a: E \rightarrow \mathbf{Z}_+\) , the \(\mu \) -weighted minimum-cost edge-disjoint \(S\) -paths problem ( \(\mu \) -CEDP) is to maximize \(\sum \nolimits _{P \in \mathcal{P}} \mu (s_P,t_P) - a(P)\) over all edge-disjoint sets \(\mathcal{P}\) of \(S\) -paths, where \(s_P,t_P\) denote the ends of \(P\) and \(a(P)\) is the sum of edge-cost \(a(e)\) over edges \(e\) in \(P\) . Our main result is a complete characterization of terminal weights \(\mu \) for which \(\mu \) -CEDP is tractable and admits a combinatorial min–max theorem. We prove that if \(\mu \) is a tree metric, then \(\mu \) -CEDP is solvable in polynomial time and has a combinatorial min–max formula, which extends Mader’s edge-disjoint \(S\) -paths theorem and its minimum-cost generalization by Karzanov. Our min–max theorem includes the dual half-integrality, which was earlier conjectured by Karzanov for a special case. We also prove that \(\mu \) -EDP, which is \(\mu \) -CEDP with \(a = 0\) , is NP-hard if \(\mu \) is not a truncated tree metric, where a truncated tree metric is a weight function represented as pairwise distances between balls in a tree. On the other hand, \(\mu \) -CEDP for a truncated tree metric \(\mu \) reduces to \(\mu '\) -CEDP for a tree metric \(\mu '\) . Thus our result is best possible unless P = NP. As an application, we obtain a good approximation algorithm for \(\mu \) -EDP with “near” tree metric \(\mu \) by utilizing results from the theory of low-distortion embedding.     

On conditional permutability and factorized groups

Two subgroups \(A\) and \(B\) of a group \(G\) are said to be totally completely conditionally permutable (tcc-permutable) if \(X\) permutes with \(Y^g\) for some \(g\in \langle X,Y\rangle \) , for all \(X \le A\) and all \(Y\le B\) . In this paper, we study finite products of tcc-permutable subgroups, focussing mainly on structural properties of such products. As an application, new achievements in the context of formation theory are obtained.     

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.     

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 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.     

Construction of relative difference sets and Hadamard groups

‘There exist normal \((2m,2,2m,m)\) relative difference sets and thus Hadamard groups of order \(4m\) for all \(m\) of the form $$\begin{aligned} m= x2^{a+t+u+w+\delta -\epsilon +1}6^b 9^c 10^d 22^e 26^f \prod _{i=1}^s p_i^{4a_i} \prod _{i=1}^t q_i^2 \prod _{i=1}^u \left( (r_i+1)/2)r_i^{v_i}\right) \prod _{i=1}^w s_i \end{aligned}$$ under the following conditions: \(a,b,c,d,e,f,s,t,u,w\) are nonnegative integers, \(a_1,\ldots ,a_r\) and \(v_1,\ldots ,v_u\) are positive integers, \(p_1,\ldots ,p_s\) are odd primes, \(q_1,\ldots ,q_t\) and \(r_1,\ldots ,r_u\) are prime powers with \(q_i\equiv 1\ (\mathrm{mod}\ 4)\) and \(r_i\equiv 1\ (\mathrm{mod}\ 4)\) for all \(i, s_1,\ldots ,s_w\) are integers with \(1\le s_i \le 33\) or \(s_i\in \{39,43\}\) for all \(i, x\) is a positive integer such that \(2x-1\) or \(4x-1\) is a prime power. Moreover, \(\delta =1\) if \(x>1\) and \(c+s>0, \delta =0\) otherwise, \(\epsilon =1\) if \(x=1, c+s=0\) , and \(t+u+w>0, \epsilon =0\) otherwise. We also obtain some necessary conditions for the existence of \((2m,2,2m,m)\) relative difference sets in partial semidirect products of \(\mathbb{Z }_4\) with abelian groups, and provide a table cases for which \(m\le 100\) and the existence of such relative difference sets is open.     

Note on prehomogeneous vector spaces

Let \(V\) be a complex prehomogeneous vector space under the action of a linear algebraic group \(G\) . Assume the poset of orbit closures in the Zariski topology \(\{\overline{Gx}:x\in V\}\) coincides with a (partial) flag \(V_0=0<V_1<\dots <V_k=V\) in \(V\) . Then for any Borel subgroup \(B\) of \(G\) , the poset \(\{\overline{B x}:x\in V\}\) coincides with a full flag in \(V\) .     

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.     

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\) .     

Proper circulant weighing matrices of weight p^2

A circulant weighing matrix \(CW(v,n)\) is a circulant matrix \(M\) of order \(v\) with \(0,\pm 1\) entries such that \(MM^T=nI_v\) . In this paper, we study proper circulant matrices with \(n=p^2\) where \(p\) is an odd prime divisor of \(v\) . For \(p\ge 5\) , it turns out that to search for such circulant matrices leads us to two group ring equations and by studying these two equations, we manage to prove that no proper \(CW(pw,p^2)\) exists when \(p\equiv 3\pmod {4}\) or \(p=5\) .     

Covering of subspaces by subspaces

Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph \(\mathcal{G }_q(n,r)\) by subspaces from the Grassmann graph \(\mathcal{G }_q(n,k)\) , \(k \ge r\) , are discussed. The problem is of interest from four points of view: coding theory, combinatorial designs, \(q\) -analogs, and projective geometry. In particular we examine coverings based on lifted maximum rank distance codes, combined with spreads and a recursive construction. New constructions are given for \(q=2\) with \(r=2\) or \(r=3\) . We discuss the density for some of these coverings. Tables for the best known coverings, for \(q=2\) and \(5 \le n \le 10\) , are presented. We present some questions concerning possible constructions of new coverings of smaller size.     

Stationary and invariant densities and disintegration kernels

Let \(G\) be a locally compact topological group, acting measurably on some Borel spaces \(S\) and \(T\) , and consider some jointly stationary random measures \(\xi \) on \(S\times T\) and \(\eta \) on \(S\) such that \(\xi (\cdot \times T)\ll \eta \) a.s. Then there exists a stationary random kernel \(\zeta \) from \(S\) to \(T\) such that \(\xi =\eta \otimes \zeta \) a.s. This follows from the existence of an invariant kernel \(\varphi \) from \(S\times {\mathcal {M}}_{S\times T}\times {\mathcal {M}}_S\) to \(T\) such that \(\mu =\nu \otimes \varphi (\cdot ,\mu ,\nu )\) whenever \(\mu (\cdot \times T)\ll \nu \) . Also included are some related results on stationary integration, absolute continuity, and ergodic decomposition.     

Additive mappings satisfying algebraic conditions in rings

Let \(R\) be any \((n+1)!\) -torsion free ring and \(F,D: R\rightarrow R\) be additive mappings satisfying \(F(x^{n+1})=(\alpha (x))^nF(x)+\sum \nolimits _{i=1}^n (\alpha (x))^{n-i}(\beta (x))^iD(x)\) for all \(x\in R\) , where \(n\) is a fixed integer and \(\alpha \) , \(\beta \) are automorphisms of \(R\) . Then, \(D\) is Jordan left \((\alpha , \beta )\) -derivation and \(F\) is generalized Jordan left \((\alpha , \beta )\) -derivation on \(R\) and if additive mappings \(F\) and \(D\) satisfying \(F(x^{n+1})=F(x)(\alpha (x))^n+\sum \nolimits _{i=1}^n (\beta (x))^iD(x)(\alpha (x))^{n-i}\) for all \(x\in R\) . Then, \(D\) is Jordan \((\alpha , \beta )\) -derivation and \(F\) is generalized Jordan \((\alpha , \beta )\) -derivation on \(R\) . At last some immediate consequences of the above theorems have been given.     

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).     

The Cauchy–Riemann equations in the unit ball of l^{2}

We study the local exactness of the \(\overline{\partial }\) operator in the Hilbert space \(l^2\) for a particular class of \((0,1)\) -forms \(\omega \) of the type \(\omega (z) = \sum _i z_i\omega ^i(z) d\overline{z}_i\) , \(z = (z_i)\) in \(l^2\) . We suppose each function \(\omega ^i\) of class \(C^\infty \) in the closed unit ball of \(l^2\) , of the form \(\omega ^i(z) = \sum _k \omega ^i_k\left( z^k\right) \) , where \(\mathbf N = \bigcup I_k\) is a partition of \(\mathbf N\) , \((\) card \(I_k < +\infty )\) and \(z^k\) is the projection of \(z\) on \(\mathbf C^{I_k}\) . We establish sufficient conditions for exactness of \(\omega \) related to the expansion in Fourier series of the functions \(\omega ^i_k\) .