Pentavalent symmetric graphs admitting transitive non-abelian characteristically simple groups

Let $\Gamma$ be a graph and let $G$ be a group of automorphisms of $\Gamma$. The graph $\Gamma$ is called $G$-normal if $G$ is normal in the automorphism group of $\Gamma$. Let $T$ be a finite non-abelian simple group and let $G=T^l$ with $l\ge 1$. In this paper we prove that if every connected pentavalent symmetric $T$-vertex-transitive graph is $T$-normal, then every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal. This result, among others, implies that every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal except $T$ is one of 57 simple groups. Furthermore, every connected pentavalent symmetric $G$-regular graph is $G$-normal except $T$ is one of 20 simple groups, and every connected pentavalent $G$-symmetric graph is $G$-normal except $T$ is one of 17 simple groups.     

pH Resistant Ratiometric Measurement of Nicotinamide Adenine Dinucleotide Levels by Time-resolved Fluorescence Spectroscopy

Circular permutation fluorescent protein is a novel method to construct biosensors. The ratio of two excitation channels is employed to quantitatively calibrate the level of analysts. SoNar is one of them, which can be used to monitor cellular NADH/NAD⁺ levels. However, the 490 nm excitation channel of these biosensors is sensitive to pH environments, which is negative in real applications. In this work, we demonstrated that the fractional intensity ratio extracted from time-resolved fluorescence spectroscopy could be used to quantify NADH levels with one excitation (420 nm) and one emission channels. The 420-nm excitation channel was pH resistant. Comparing to average lifetime, the fractional intensity ratio had a 3.2-fold dynamic range, which was much wider than average lifetimes.     

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.     

一类精细化Eulerian多项式的若干性质

最近,孙华定义了一类新的精细化Eulerian多项式,即$$A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)},\ \ n\ge 1,$$ 其中$S_n$表示$\{1,2,\ldots,n\}$上全体$n$阶排列的集合, odes$(\pi)$与edes$(\pi)$分别表示$S_n$中排列$\pi$的奇数位与偶数位上降位数的个数.本文利用经典的Eulerian多项式$A_n(q)$ 与Catalan 序列的生成函数$C(q)$,得到精细化Eulerian 多项式$A_n(p,q)$的指数型生成函数及$A_n(p,q)$的显示表达式.在一些特殊情形,本文建立了$A_n(p,q)$与$A_n(0,q)$或$A_n(p,0)$之间的联系,并利用Eulerian数表示多项式$A_n(0,q)$的系数.特别地,这些联系揭示了Euler数$E_n$与Eulerian数$A_{n,k}$之间的一种新的关系.     

具有遗传性疾病和性状的遗传位点分析

随着信息技术的进步和发展,现代生物学越来越多地将这些技术用于大规模生物数据的收集、分析、挖掘等过程.大量计算机技术,特别是统计方法被用来进行复杂疾病的分析.大量研究表明,人体的许多表型性状差异以及对药物和疾病的易感性等都可能与某些位点相关联,或和包含有多个位点的基因相关联.因此,定位与性状或疾病相关联的位点在染色体或基因中的位置,能帮助研究人员了解性状和一些疾病的遗传机理,也能使人们对致病位点加以干预,防止一些遗传病的发生.利用随机森林方法、Bootstrap重抽样、logistic回归等大数据分析方法,意在解决优化生物学位点关联性分析中单一致病位点识别、多位点相互作用和多性状位点关联性分析等子问题.     

Permutations via linear translators

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [9], we give in several cases the compositional inverse of these permutations. The connection with complete permutations is also utilized to provide further infinite classes of permutations. Moreover, we propose new tools to study permutations of the form $x\mapsto x+{(x^{p^m}-x+\delta )}^s$ and a few infinite classes of permutations of this form are proposed.