On the Set of Element Orders of a Finite Group

ＦｏｒａｎｙｇｒｏｕｐＧ，ｄｅｎｏｔｅｂｙπｅ（Ｇ）ｔｈｅｓｅｔｏｆａｌｅｌｅｍｅｎｔｏｒｄｅｒｓｏｆＧ．Ｇｉｖｅｎａｆｉｎｉｔｅ（ｒｅｓｐ．ｉｎｆｉｎｉｔｅ）ｇｒｏｕｐＧ，ｌｅｔｈ（πｅ（Ｇ））ｂｅｔｈｅｎｕｍｂｅｒｏｆｉｓｏｍｏｒｐｈｉｓｍｃｌａ...     

The Ordered Group of Invertible Ideals of a Prüfer Domain of Finite Character

Abstract

Let D be a Prüfer domain, and denote by ± b?(D) the multiplicative group of all invertible fractional ideals of D, ordered by A ≤ B if and only if A ? B. Denote by G _i the value group of the valuation associated with the valuation ring D _{M i} , where {M _i } _i∈I is the collection of all maximal ideals of D. In this note we prove that the natural map from ± b?(D) into ± b∏ _i∈I G _i is an isomorphism onto the cardinal sum ± b? _i∈I G _i if and only if D is h-local. As a corollary, the group of divisibility of an h-local Bézout domain is isomorphic to ± b? _i∈I G _i , the notation being as above.     

On Strongly Π-Permutable Subgroups of a Finite Group

Siberian Mathematical Journal - Let σ = {σi | i ∈ I} be some partition of the set of all primes ℙ,let ∅ ≠ Π ⊆ σ, and let G be a finite group. A set...     

Spaces with a σ-Point Finite Base

本文纠正了Ｈａｎａｉ等用开紧连续映射刻画具有σ－点有限基的空间的一个错误，定义了诱导开的弱紧连续映射建立度量空间与具有σ－点有限基空间的映射联系．     

On an Empty Convex Partition of a Finite Set in the Plane

ＯｎａｎＥｍｐｔｙＣｏｎｖｅｘＰａｒｔｉｔｉｏｎｏｆａＦｉｎｉｔｅＳｅｔｉｎｔｈｅＰｌａｎｅＸｕＣｈａｎｇｑｉｎｇ（徐常青）ＭＲ（１９９１）ＳｕｂｊｅｃｔＣｌａｓｉｆｉｃａｔｉｏｎ：０５Ａ１８；５２Ｃ１０（Ｄｅｐｔ．ｏｆＭａｔｈｅｍａｔｉｃｓ，Ｈｅｎ...     

When the Sum is a Minimal Sufficient Statistics for the Parameter of a Discrete Distribution with Finite Values?

We prove three theorems for iid discrete randomvariables taking two values, three values, and k (3\leq k<\infty) valuesby using the technique of indicator function. Under some specifications of the probabilities, we prove that the sum is a minimal sufficient statistics for the unknown parameter of interest of the discrete random variable taking two values, three values, and k (3\leq k<\infty) values. For the dice example, a figure shows that the specifications of the six probabilities are between 0 and 1 and sum to 1, and a fair dice is possible.     

Traversing a Set of Points with a Minimum Number of Turns

Given a finite set of points S in ℝ ^d , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the minimum number of segments (links). We call this minimization problem the minimum link spanning path problem. This natural problem has appeared several times in the literature under different variants. The simplest one is that in which the allowed paths are axis-aligned. Let L(S) be the minimum number of links of an axis-aligned path for S, and let G _n ^d be an n×…×n grid in ℤ ^d . Kranakis et al. (Ars Comb. 38:177–192, 1994) showed that L(G _n ²)=2n−1 and and conjectured that, for all d≥3, We prove the conjecture for d=3 by showing the lower bound for L(G _n ³). For d=4, we prove that For general d, we give new estimates on L(G _n ^d ) that are very close to the conjectured value. The new lower bound of improves previous result by Collins and Moret (Inf. Process. Lett. 68:317–319, 1998), while the new upper bound of differs from the conjectured value only in the lower order terms. For arbitrary point sets, we include an exact bound on the minimum number of links needed in an axis-aligned path traversing any planar n-point set. We obtain similar tight estimates (within 1) in any number of dimensions d. For the general problem of traversing an arbitrary set of points in ℝ ^d with an axis-aligned spanning path having a minimum number of links, we present a constant ratio (depending on the dimension d) approximation algorithm. Work by A. Dumitrescu was partially supported by NSF CAREER grant CCF-0444188. Work by F. Hurtado was partially supported by projects MECMTM2006-01267 and Gen. Cat. 2005SGR00692. Work by P. Valtr was partially supported by the project 1M0545 of the Ministry of Education of the Czech Republic.     

On the Characterization of the Core of a π-Prefrattini Subgroup of a Finite Soluble Group

Siberian Mathematical Journal - Let π be a set of primes and let H be a π-prefrattini subgroup of a finite soluble group G. We prove that there exist elements x, y, z ∈ G such that...     

A Comment on a Necessary and Sufficient Condition for Transitive Permutation Group by P.J.Cameron

P.J. Cameron had mentioned that "It can be shown that a permutation group is transitive if and only if its centralizer in the symmetric group is semiregular, and vice versa (Wielandt, page 9)."[1] The latter is true, i.e. G≤S_Ω is semiregular(?)Cs_Ω(G) is transitive. [cf. 2] But in the former statement fails, i.e. Cs_Ω(G) is semiregular(?)G≤S_Ω is transitive. In this note we give a series of the     

When is a Coxeter System Determined by its Coxeter Group?

A Coxeter system is a pair (W, S) where W is a group and whereS is a set of involutions in W such that W has a presentationof the form W=     

Corrigendum to: “Clifford Theory of a Finite Group that Contains a Defect 0 p-Block of a Normal Subgroup”

At some point, after publication, the author realized that the proof of [3 Harris, M. E. (2013). Clifford theory of a finite group that contains a defect 0 p-block of a normal subgroup. Comm. in Alg. 41:3509–3540.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar], Theorem 5.2] is incorrect. This proof incorrectly adapts the proof of [1 Broué, M. (1990). Isométries parfaites, types de blocs, cégories dérivees. Aérisque 181–182:61–92. [Google Scholar], Theorem 4.8] since [3 Harris, M. E. (2013). Clifford theory of a finite group that contains a defect 0 p-block of a normal subgroup. Comm. in Alg. 41:3509–3540.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar], (5.5)] is incorrect. Using the same proof outline, we correct the proof of [3 Harris, M. E. (2013). Clifford theory of a finite group that contains a defect 0 p-block of a normal subgroup. Comm. in Alg. 41:3509–3540.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar], Theorem 5.2].     

Smooth Functions Associated with Wavelet Sets on ℝ d , d≥1, and Frame Bound Gaps

The theme is to smooth characteristic functions of Parseval frame wavelet sets by convolution in order to obtain implementable, computationally viable, smooth wavelet frames. We introduce the following: a new method to improve frame bound estimation; a shrinking technique to construct frames; and a nascent theory concerning frame bound gaps. The phenomenon of a frame bound gap occurs when certain sequences of functions, converging in L ² to a Parseval frame wavelet, generate systems with frame bounds that are uniformly bounded away from 1. We prove that smoothing a Parseval frame wavelet set wavelet on the frequency domain by convolution with elements of an approximate identity produces a frame bound gap. Furthermore, the frame bound gap for such frame wavelets in L ²(? ^d ) increases and converges as d increases.     

Modeling a Halfspace with Tunnel using a Coupled Integral Transform Method – Finite Element Method Approach

Vibrations that are excited by moving trains inside a tunnel are regularly transmitted via the tunnel and the surrounding soil and often perceived at the surface. In order to assess the effects of the arising vibrations and to be able to model possible mitigation measures, a suitable model of the system is necessary. In this paper, a coupled approach is presented, where the emission system of an underground tunnel is modeled using the Finite Element Method while the transmission medium of the soil is described by Integral Transform Methods. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Finite p-groups with a minimal non-abelian subgroup of index p(Ⅱ)

We classify completely three-generator finite p-groups G such that Ф(G)≤Z(G)and|G′|≤p2.This paper is a part of the classification of finite p-groups with a minimal non-abelian subgroup of index p,and solve partly a problem proposed by Berkovich.     

Finite p-groups with a minimal non-abelian subgroup of index p(Ⅲ)

This paper finishes the classification of three-generator finite p-groups G such that Φ(G) Z(G).This paper is a part of classification of finite p-groups with a minimal non-abelian subgroup of index p, and partly solves a problem proposed by Berkovich(2008).