Doubly transitive 2‐factorizations

Let be a 2‐factorization of the complete graph K_v admitting an automorphism group G acting doubly transitively on the set of vertices. The vertex‐set V(K_v) can then be identified with the point‐set of AG(n, p) and each 2‐factor of is the union of p‐cycles which are obtained from a parallel class of lines of AG(n, p) in a suitable manner, the group G being a subgroup of A G L(n, p) in this case. The proof relies on the classification of 2‐(v, k, 1) designs admitting a doubly transitive automorphism group. The same conclusion holds even if G is only assumed to act doubly homogeneously. © 2006 Wiley Periodicals, Inc. J Combin Designs     

The Noether map II

Let be a faithful representation of a finite group . In this paper we proceed with the study of the image of the associated Noether map

In our 2005 paper it has been shown that the Noether map is surjective if is a projective -module. This paper deals with the converse. The converse is in general not true: we illustrate this with an example. However, for -groups (where is the characteristic of the ground field ) as well as for permutation representations of any group the surjectivity of the Noether map implies the projectivity of .

     

相干态直积空间中的置换算符

本文用相干态方法导出了相干态直积空间中的一类置换算符,给出了它们的正规序形式和显式形式,并讨论了置换算符的一些性质。     

Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms

Let T and T¹ be tournaments with n elements, E a basis for T, E′ a basis for T′, and k ≥ 3 an integer. The dual of T is the tournament T” of basis E defined by T(x, y) = T(y, x) for all x, y ε E. A hemimorphism from T onto T′ is an isomorphism from T onto T” or onto T. A k-hemimorphism from T onto T′ is a bijection f from E to E′ such that for any subset X of E of order k the restrictions T/X and T¹/f(X) are hemimorphic. The set of hemimorphisms of T onto itself has group structure, this group is called the group of hemimorphisms of T. In this work, we study the restrictions to n – 2 elements of a tournament with n elements. In particular, we prove: Let k ≥ 3 be an integer, T a tournament with n elements, where n ≥ k + 5. Then the following statements are equivalent: (i) All restrictions of T to subsets with n – 2 elements are k-hemimorphic. (ii) All restrictions of T to subsets with n – 2 elements are 3-hemimorphic. (iii) All restrictions of T to subsets with n – 2 elements are hemimorphic. (iv) All restrictions of T to subsets with n – 2 elements are isomorphic, (v) Either T is a strict total order, or the group of hemimorphisms of T is 2-homogeneous.     

On a Class of Recursively Enumerable Sets

We define a class of so-called ∑(n)-sets as a natural closure of recursively enumerable sets W_n under the relation “∈” and study its properties.     

构造一种与置换群成反同构的群

通过对中国古代一种游戏的讨论,建立了数学模型,从而构造了一种与置换群成反同构的互换群,得到一些有趣的结果     

O-2-transitive automorphism groups with abelian stabilizer of a point

It is proved that an o-2-transitive group of order automorphisms of a totally ordered set with Abelian stabilizer of a point is the permutation groupF={φ(a, b)‖a, bεP, a>0, (x)φ(a, b)=xa+b forxεP} of a totally ordered fieldP. Translated fromMatematicheskie Zametki, Vol. 65, No. 2, pp. 289–293, February, 1999.     

Decreased Resting-State Functional Complexity in Elderly with Subjective Cognitive Decline

Individuals with subjective cognitive decline (SCD) are at high risk of developing preclinical or clinical state of Alzheimer’s disease (AD). Resting state functional magnetic resonance imaging, which can indirectly reflect neuron activities by measuring the blood-oxygen-level-dependent (BOLD) signals, is promising in the early detection of SCD. This study aimed to explore whether the nonlinear complexity of BOLD signals can describe the subtle differences between SCD and normal aging, and uncover the underlying neuropsychological implications of these differences. In particular, we introduce amplitude-aware permutation entropy (AAPE) as the novel measure of brain entropy to characterize the complexity in BOLD signals in each brain region of the Brainnetome atlas. Our results demonstrate that AAPE can reflect the subtle differences between both groups, and the SCD group presented significantly decreased complexities in subregions of the superior temporal gyrus, the inferior parietal lobule, the postcentral gyrus, and the insular gyrus. Moreover, the results further reveal that lower complexity in SCD may correspond to poorer cognitive performance or even subtle cognitive impairment. Our findings demonstrated the effectiveness and sensitiveness of the novel brain entropy measured by AAPE, which may serve as the potential neuroimaging marker for exploring the subtle changes in SCD.     

Characterizing planarity using theta graphs

A theta graph is a homeomorph of K_2,3. In an embedded planar graph the local rotation at one degree-three vertex of a theta graph determines the local rotation at the other degree-three vertex. Using this observation, we give a characterization of planar graphs in terms of balance in an associated signed graph whose vertices are K_1,3 subgraphs and whose edges correspond to theta graphs. © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 17–20, 1998     

Estimating Phase Amplitude Coupling between Neural Oscillations Based on Permutation and Entropy

Cross-frequency phase–amplitude coupling (PAC) plays an important role in neuronal oscillations network, reflecting the interaction between the phase of low-frequency oscillation (LFO) and amplitude of the high-frequency oscillations (HFO). Thus, we applied four methods based on permutation analysis to measure PAC, including multiscale permutation mutual information (MPMI), permutation conditional mutual information (PCMI), symbolic joint entropy (SJE), and weighted-permutation mutual information (WPMI). To verify the ability of these four algorithms, a performance test including the effects of coupling strength, signal-to-noise ratios (SNRs), and data length was evaluated by using simulation data. It was shown that the performance of SJE was similar to that of other approaches when measuring PAC strength, but the computational efficiency of SJE was the highest among all these four methods. Moreover, SJE can also accurately identify the PAC frequency range under the interference of spike noise. All in all, the results demonstrate that SJE is better for evaluating PAC between neural oscillations.