In this paper, we study minimal and maximal fixed point theorems and iterative technique for nonlinear operators in product spaces. As a corollary of our result, some coupled fixed point theorems are obtained, which g...In this paper, we study minimal and maximal fixed point theorems and iterative technique for nonlinear operators in product spaces. As a corollary of our result, some coupled fixed point theorems are obtained, which generalize the coupled fixed point theorems obtained by Guo Da-jun and Lankshmikantham[21 and the results obtained by Lan in [4], and [6].展开更多
Given a maximal subgroup M of a group G, a θ*-completion C of M is called an s*-completion if either C = G or there exists a subgroup D of G which is not a θ*-completion of M such that D contains C as a maximal subg...Given a maximal subgroup M of a group G, a θ*-completion C of M is called an s*-completion if either C = G or there exists a subgroup D of G which is not a θ*-completion of M such that D contains C as a maximal subgroup. In this paper, we obtain several results on s*-completions which imply G to be solvable or supersolvable.展开更多
In this paper, we investegate the intersection of a maximal intransitive subgroup with a maximal imprimitive subgroup. And, the structure of the second maximal intransitive subgroup of an alternating group is determined.
In this paper we study the subgroup structure of the semigroup Mn(Z+)of all n×n nonnegative integral matrices under multiplication.We prove that every maximal subgroup of Mn(Z+)containing an idempotent element of...In this paper we study the subgroup structure of the semigroup Mn(Z+)of all n×n nonnegative integral matrices under multiplication.We prove that every maximal subgroup of Mn(Z+)containing an idempotent element of rank r is isormorphic to Sr.展开更多
Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be ...Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.展开更多
Mutation (substitution, deletion, insertion, etc.) in nucleotide acid causes the maximal sequence lengths of exact match (MALE) between paralogous members from a duplicate event to become shorter during evolution. In ...Mutation (substitution, deletion, insertion, etc.) in nucleotide acid causes the maximal sequence lengths of exact match (MALE) between paralogous members from a duplicate event to become shorter during evolution. In this work, MALE changes between members of 26 gene families from four representative species (Arabidopsis thaliana, Oryza sativa, Mus mus- culus and Homo sapiens) were investigated. Comparative study of paralogous’ MALE and amino acid substitution rate (dA<0.5) indicated that a close relationship existed between them. The results suggested that MALE could be a sound evolutionary scale for the divergent time for paralogous genes during their early evolution. A reference table between MALE and divergent time for the four species was set up, which would be useful widely, for large-scale genome alignment and comparison. As an example, de- tection of large-scale duplication events of rice genome based on the table was illustrated.展开更多
We obtain a complete characterization of the structure of a finite group G in which every maximal subgroup is nilpotent or a TI-subgroup or has order p'for any fixed prime divisor p of|G|.Moreover,we show that the...We obtain a complete characterization of the structure of a finite group G in which every maximal subgroup is nilpotent or a TI-subgroup or has order p'for any fixed prime divisor p of|G|.Moreover,we show that there exists at most one prime divisor q of|G|such that G is neither q-nilpotent nor q-closed.展开更多
In 2006, Sanwong and Sullivan described the maximal congruences on the semigroup N consisting of all non-negative integers under standard multiplication, and on the semigroup T（X） consisting of all total transformat...In 2006, Sanwong and Sullivan described the maximal congruences on the semigroup N consisting of all non-negative integers under standard multiplication, and on the semigroup T（X） consisting of all total transformations of an infinite set X under composition. Here, we determine all maximal congruences on the semigroup Zn under multiplication modulo n. And, when Y lohtain in X, we do the same for the semigroup T（X, Y） consisting of all elements of T（X） whose range is contained in Y. We also characterise the minimal congruences on T（X. Y）.展开更多
This paper studies framings in Banach spaces, a concept raised by Casazza, Han and Larson, which is a natural generalization of traditional frames in Hilbert spaces and unconditional bases in Banach spaces. The minima...This paper studies framings in Banach spaces, a concept raised by Casazza, Han and Larson, which is a natural generalization of traditional frames in Hilbert spaces and unconditional bases in Banach spaces. The minimal unconditional bases and the maximal unconditional bases with respect to framings are introduced. Our main result states that, if （xi, fi） is a framing of a Banach space X, and （eimin） and （eimax） are the minimal unconditional basis and the maximal unconditional basis with respect to （xi, fi）, respectively, then for any unconditional basis （ei） associated with （xi, fi）, there are A,B 〉 0 such that A｜｜i=1∑∞aieimin｜｜≤｜｜i=1∑∞aiei｜｜≤B｜｜i=1∑∞aieimax｜｜ for all （ai） ∈ c00.It means that for any framing, the corresponding associated unconditional bases have common upper and lower bounds.展开更多
文摘In this paper, we study minimal and maximal fixed point theorems and iterative technique for nonlinear operators in product spaces. As a corollary of our result, some coupled fixed point theorems are obtained, which generalize the coupled fixed point theorems obtained by Guo Da-jun and Lankshmikantham[21 and the results obtained by Lan in [4], and [6].
文摘Given a maximal subgroup M of a group G, a θ*-completion C of M is called an s*-completion if either C = G or there exists a subgroup D of G which is not a θ*-completion of M such that D contains C as a maximal subgroup. In this paper, we obtain several results on s*-completions which imply G to be solvable or supersolvable.
文摘In this paper, we investegate the intersection of a maximal intransitive subgroup with a maximal imprimitive subgroup. And, the structure of the second maximal intransitive subgroup of an alternating group is determined.
基金National Natural Science Foundation of China(11861045,11701449)。
文摘In this paper we study the subgroup structure of the semigroup Mn(Z+)of all n×n nonnegative integral matrices under multiplication.We prove that every maximal subgroup of Mn(Z+)containing an idempotent element of rank r is isormorphic to Sr.
文摘Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 30270810, 90208022 and 30471067) and IBM Shared University Research (Life Science), China
文摘Mutation (substitution, deletion, insertion, etc.) in nucleotide acid causes the maximal sequence lengths of exact match (MALE) between paralogous members from a duplicate event to become shorter during evolution. In this work, MALE changes between members of 26 gene families from four representative species (Arabidopsis thaliana, Oryza sativa, Mus mus- culus and Homo sapiens) were investigated. Comparative study of paralogous’ MALE and amino acid substitution rate (dA<0.5) indicated that a close relationship existed between them. The results suggested that MALE could be a sound evolutionary scale for the divergent time for paralogous genes during their early evolution. A reference table between MALE and divergent time for the four species was set up, which would be useful widely, for large-scale genome alignment and comparison. As an example, de- tection of large-scale duplication events of rice genome based on the table was illustrated.
基金supported by Shandong Provincial Natural Science Foundation,Chin(ZR2017MA022 and ZR2020MA044)and NSFC(11761079).
文摘We obtain a complete characterization of the structure of a finite group G in which every maximal subgroup is nilpotent or a TI-subgroup or has order p'for any fixed prime divisor p of|G|.Moreover,we show that there exists at most one prime divisor q of|G|such that G is neither q-nilpotent nor q-closed.
文摘In 2006, Sanwong and Sullivan described the maximal congruences on the semigroup N consisting of all non-negative integers under standard multiplication, and on the semigroup T（X） consisting of all total transformations of an infinite set X under composition. Here, we determine all maximal congruences on the semigroup Zn under multiplication modulo n. And, when Y lohtain in X, we do the same for the semigroup T（X, Y） consisting of all elements of T（X） whose range is contained in Y. We also characterise the minimal congruences on T（X. Y）.
基金Supported by National Nature Science Foundation of China(Grant Nos.11001134,11126250 and 11201336)Fundamental Research Funds for the Central Universities and Tianjin Science and Technology Fund(Grant No.20100820)
文摘This paper studies framings in Banach spaces, a concept raised by Casazza, Han and Larson, which is a natural generalization of traditional frames in Hilbert spaces and unconditional bases in Banach spaces. The minimal unconditional bases and the maximal unconditional bases with respect to framings are introduced. Our main result states that, if （xi, fi） is a framing of a Banach space X, and （eimin） and （eimax） are the minimal unconditional basis and the maximal unconditional basis with respect to （xi, fi）, respectively, then for any unconditional basis （ei） associated with （xi, fi）, there are A,B 〉 0 such that A｜｜i=1∑∞aieimin｜｜≤｜｜i=1∑∞aiei｜｜≤B｜｜i=1∑∞aieimax｜｜ for all （ai） ∈ c00.It means that for any framing, the corresponding associated unconditional bases have common upper and lower bounds.
