Fitting Height and Character Degree Graphs

Given a group G, Γ(G) is the graph whose vertices are the primes that divide the degree of some irreducible character and two vertices p and q are joined by an edge if pq divides the degree of some irreducible character of G. By a definition of Lewis, a graph Γ has bounded Fitting height if the Fitting height of any solvable group G with Γ(G)=Γ is bounded (in terms of Γ). In this note, we prove that there exists a universal constant C such that if Γ has bounded Fitting height and Γ(G)=Γ then h(G)≤C. This solves a problem raised by Lewis. Research supported by the Spanish Ministerio de Educación y Ciencia, MTM2004-06067-C02-01 and MTM2004-04665, the FEDER and Programa Ramón y Cajal.     

On the triple jump of the set of atoms of a Boolean algebra

We prove the following result concerning the degree spectrum of the atom relation on a computable Boolean algebra. Let be a computable Boolean algebra with infinitely many atoms and be the Turing degree of the atom relation of . If is a c.e. degree such that , then there is a computable copy of where the atom relation has degree . In particular, for every c.e. degree , any computable Boolean algebra with infinitely many atoms has a computable copy where the atom relation has degree .

     

Post's Problem for Reducibilities of Bounded Complexity

In this paper we consider the we known method by E. Post of solving the problem of construction of recursively enumerable sets that have a degree intermediate between the degrees of recursive and complete sets with respect to a given reducibility. Post considered reducibilities ≤_m, ≤_btt, ≤_tt and ≤_T and solved the problem for al of them except ≤_T. Here we extend Post's original method of construction of incomplete sets onto two wide classes of sub‐Turing reducibilities what were studying in [1, 2].     

广义Lienard方程边值问题

By coincidence degree,the existence of solution to the boundary value problem of a generalized Liénard equation a(t)x＂+F(x,x′)x′+g(x)=e(t),x(0)=x(2π),x′(0)=x′(2π)is proved,where a∈C1[0,2π],a(t)>0(0≤t≤2π),a(0)=a(2π),F(x,y)=f(x)+α| y|β,α>0,β>0 are all constants,f∈C(R,R),e∈C[0,2π]. An example is given as an application.     

On a Conjecture of Kleene and Post

A proof is given that 0 ′ (the argest Turing degree containing a computably enumerable set) is definable in the structure of the degrees of unsolvability. This answers a long‐standing question of Kleene and Post, and has a number of corollaries including the definability of the jump operator.     

UNILATERAL EIGENVALUE PROBLEMS FOR NONLINEARLY ELASTIC PLATES： AN APPROACH VIA PSEUDO-MONOTONE OPERATORS

gi.TheTOpologicalDegreeforGeneralizedMonotoneOperatorsMonotoneoperatortheoryisoftenanefficienttoolforprovingtheexistenceofsolutionstononlinearProblems.Inparticular,thepseudo-monotoneoperatorsintroducedbyBrezis[2]areveryusefulforstudyingnonlinearellipticproblems.Weconsiderherethefollowingclassesofmappingsofgeneralizedmonotonetype.(QM)=theclassofquasi-mollotoneoperators,(S )=theclassofoperatorsoftype(S ),(PM)=theclassofpseudthmonotoneoperators,(LS)=theclassofLeray-Schauderoperators(compac…     

On the minimum degree,edge-connectivity and connectivity of power graphs of finite groups

In this paper, the minimum degree of power graphs of certain cyclic groups, abelian p-groups, dihedral groups and dicyclic groups are obtained. It is ascertained that the edge-connectivity and minimum degree of power graphs are equal, and consequently, the minimum disconnecting sets of power graphs of the aforementioned groups are determined. In order to investigate the equality of connectivity and minimum degree of power graphs, certain necessary conditions for finite groups and a necessary and su?cient condition for finite cyclic groups are obtained. Moreover, the equality is discussed for the power graphs of abelian p-groups, dihedral groups and dicyclic groups.     

The size of the giant high‐order component in random hypergraphs

The phase transition in the size of the giant component in random graphs is one of the most well‐studied phenomena in random graph theory. For hypergraphs, there are many possible generalizations of the notion of a connected component. We consider the following: two j‐sets (sets of j vertices) are j‐connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. A hypergraph is j‐connected if all j‐sets are pairwise j‐connected. In this paper, we determine the asymptotic size of the unique giant j‐connected component in random k‐uniform hypergraphs for any and .     

多值不确定型直觉模糊识别决策方法

基于模糊环境给出多值不确定型直觉模糊集的概念,定义了集合的交、并、包含等基本运算性质。通过刻画集合间的相似程度,提出八个新的相似度公式。最后将相似度应用于识别决策,说明公式的实用性和有效性。     

新型生物黏附性材料巯基壳聚糖的合成与表征

巯基聚合物利用二硫键的形成, 以共价键黏附于黏膜表面, 可以延长药物在黏膜上的滞留时间, 有利于药物分子的吸收. 本文合成了一种新型巯基聚合物——N-乙酰基-L-半胱氨酸-g-壳聚糖(CS-NAC), 并进行了表征, 同时对材料的溶胀度、黏附性和细胞毒性进行了测试. 结果表明, 这种巯基聚合物具有较高的巯基含量, 最高可达到589.3 μmol/g; 具有快速的溶胀性能; 黏附性显著增强, 黏附时间和黏附力分别是壳聚糖的30和3倍; 无明显的细胞毒性. 因此, CS-NAC是一种很有应用前景的生物黏附性材料.