we prove that the Connectivities of Minimal Cayley Coset Digraphs are their regular degrees. Connectivity of transitive digraphs and a combinatorial propertyof finite groups Ann., Discrete Math., 8 1980 61--64 ...we prove that the Connectivities of Minimal Cayley Coset Digraphs are their regular degrees. Connectivity of transitive digraphs and a combinatorial propertyof finite groups Ann., Discrete Math., 8 1980 61--64 Meng Jixiang and Huang Qiongxiang On the connectivity of Cayley digraphs, to appear Sabidussi, G. Vertex transitive graphs Monatsh. Math., 68 1969 426--438 Watkins, M. E. Connectivity of transitive graphs J. Combin. Theory, 8 1970 23--29 Zemor, G. On positive and negative atoms of Cayley digraphs Discrete Applied Math., 23 1989 193--195 Department of Mathematics,Xinjiang University,Urumpi 830046.APPLIED MATHEMATICS 3. Statement of Inexact Method Here we assume F to be continuousely differentiable. Inexact Newton method was first studied in the solution of smooth equations (see ). Now, such a technique has been widely used in optimizations, nonlinear complementarity problems and nonsmooth equations (see, and , etc.) In order to establish the related inexact methods,we introduce a nonlinear operator T(x): R n R n . Its components are defined as follows: (T(x)p) i=[HL(2:1,Z;2,Z] (x k+p k) i, if i∈(x k), H i(x k)+ min {(p k) i,F i(x k) Tp k}, if i∈(x k), F i(x k)+F i(x k) Tp k, i∈(x k).(3.1) Then, it is clear that the subproblem (2.5) turns to T(x k)p k=0.(3.2) In inexact algorithm, we determine p k in the followinginexact way ( see ). ‖T(x k)p k‖ υ k‖H(x k)‖,(3.3) where υ k is a given positive sequence. It is then obviously that (3.2),or equivalently (2.5), is a special case of (3.3) corresponding to υ k=0 . In particular, (3.3) can be used as a termination rule of the iterative process for solving (2.5). The following proposition shows the existence of λ k satisfying (2.4). Proposition 3.1. Let F be continuously differe ntiable. υ k is chosen so that υ k for some constant ∈(0,1). Then p k generated by (3.3) is a descent direction of θ at x k, and for some constant σ∈(0, min (1/2,1- holds θ(x k)-θ(x k+λ kp k) 2σλ kθ(x k)(3.4) for all sufficiently small λ k>0. Proof For simplification, we omit the lower subscripts k and denote (x k) i , H i(x k) , (BH(x k)p k) i , etc.by x i , H i , (BHp) i , etc. respectively. To estimate the directional derivative of θ at x k along p k , we divide it into three parts: D p k θ(x k)=H T(x k)BH(x k)p k=T 1+T 2+T 3,(3.5) where T 1=Σ i∈α k H i(BHp) i , T 2=Σ i∈β k H i(BHp) i , T 3=Σ i∈γ k H i(BHp) i . Consider i∈α k= k∪α -(x k) . In this case, we always have H i(BH(x)p) i=H i 2+H i(x i+p i) . If i∈ k , then H i(BHp) i -H i 2+|H i‖(T(x)p) i|. If i∈α -(x k) , then x i<0 . We have either x i+p i 0 , or x i+p i<0 . When x i+p i 0 , we get H i(BH(x)p) i -H i 2 .In the later case, x i+p i<0 , so H i(BH(x)p) i=-H i 2+|H i‖x i+p i|. Then, by elementary computation, we deduce that T 1 -Σi∈α kH i 2+Σ i∈α k|H i‖(T(x)p) i|.(3.6) Received March 1, 1995. 1991 MR Subject Classification: 05C25展开更多
A multi dimensional concatenation scheme for block codes is introduced, in which information symbols are interleaved and re encoded for more than once. It provides a convenient platform to design high performance co...A multi dimensional concatenation scheme for block codes is introduced, in which information symbols are interleaved and re encoded for more than once. It provides a convenient platform to design high performance codes with flexible interleaver size. Coset based MAP soft in/soft out decoding algorithms are presented for the F24 code. Simulation results show that the proposed coding scheme can achieve high coding gain with flexible interleaver length and very low decoding complexity.展开更多
This article considers One example is also given to take a the coset structure closer look at what of spin group via analyzing the expression of its representation. the coset and the subgroup are.
Let q be a prime power. By PL（Fq） the authors mean a projective line over the finite field Fq with the additional point ∞. In this article, the authors parametrize the conjugacy classes of nondegenerate homomorphis...Let q be a prime power. By PL（Fq） the authors mean a projective line over the finite field Fq with the additional point ∞. In this article, the authors parametrize the conjugacy classes of nondegenerate homomorphisms which represent actions of △（3, 3, k） = （u, v： u^3 = v^3 = （uv）^k = 1〉on PL（Fq）, where q ≡ ±1（modk）. Also, for various values of k, they find the conditions for the existence of coset diagrams depicting the permutation actions of △（3, 3, k） on PL（Fq）. The conditions are polynomials with integer coefficients and the diagrams are such that every vertex in them is fixed by （u^-v^-）^k. In this way, they get △（3, 3, k） as permutation groups on PL（Fq）.展开更多
Two new notions for the coset partition of dyadic additive groups are proposed,andtheir sufficient and necessary conditions are also given.On the basis of these works,the feasibilityproblem of implementing minority-lo...Two new notions for the coset partition of dyadic additive groups are proposed,andtheir sufficient and necessary conditions are also given.On the basis of these works,the feasibilityproblem of implementing minority-logic decoding algorithm for RM codes is solved.展开更多
The classical exchange algebra satisfied by the monodromy matrix of the nonlinear sigma model on a supercoset target withℤ2n grading is derived using a first−order Hamiltonian formulation and by adding to the Lax conn...The classical exchange algebra satisfied by the monodromy matrix of the nonlinear sigma model on a supercoset target withℤ2n grading is derived using a first−order Hamiltonian formulation and by adding to the Lax connection terms proportional to constraints.This enables us to show that the conserved charges of the theory are in involution.When n=2,our results coincide with the results given by Magro for the pure spinor description of AdS5×S5 string theory(when the ghost terms are omitted).展开更多
Based on the concepts of set value map and power group,the definitions of comove relation,coset group and comove group were given,their properties were discussed and meaningful results were obtained.
The palm vein authentication technology is extremely safe, accurate and reliable as it uses the vascular patterns contained within the body to confirm personal identification. The pattern of veins in the palm is compl...The palm vein authentication technology is extremely safe, accurate and reliable as it uses the vascular patterns contained within the body to confirm personal identification. The pattern of veins in the palm is complex and unique to each individual. Its non-contact function gives it a healthful advantage over other biometric technologies. This paper presents an algebraic method for personal authentication and identification using internal contactless palm vein images. We use MATLAB image processing toolbox to enhance the palm vein images and employ coset decomposition concept to store and identify the encoded palm vein feature vectors. Experimental evidence shows the validation and influence of the proposed approach.展开更多
We prove a general mirror duality theorem for a subalgebra U of a simple conformal vertex algebra A and its commutant V=ComA(U).Specifically,we assume that A≌■_(i∈I)U_(i)■V_(i) as a U■V-module,where the U-modules...We prove a general mirror duality theorem for a subalgebra U of a simple conformal vertex algebra A and its commutant V=ComA(U).Specifically,we assume that A≌■_(i∈I)U_(i)■V_(i) as a U■V-module,where the U-modules Uiare simple and distinct and are objects of a semisimple braided ribbon category of Umodules,and the V-modules Viare semisimple and contained in a(not necessarily rigid) braided tensor category of V-modules.We also assume U=ComA(V).Under these conditions,we construct a braid-reversed tensor equivalence τ:u_(A)→v_(A),where u_(A)is the semisimple category of U-modules with simple objects Ui,i∈I,and v_(A)is the category of V-modules whose objects are finite direct sums of Vi.In particular,the V-modules Viare simple and distinct,and v_(A)is a rigid tensor category.As an application,we find a rigid semisimple tensor subcategory of modules for the Virasoro algebra at central charge 13+6p+6p^(-1),p∈Z_(≥2), which is braided tensor equivalent to an abelian 3-cocycle twist of the category of finite-dimensional sl2-modules.Consequently,the Virasoro vertex operator algebra at central charge 13+6p+6p^(-1)is the PSL_(2)(C)-fixed-point subalgebra of a simple conformal vertex algebra w(-p),analogous to the realization of the Virasoro vertex operator algebra at central charge 13-6p-6p^(-1)as the PSL_(2)(C)-fixed-point subalgebra of the triplet algebra W(p).展开更多
In this paper, for the highest weight module V4 of sl（2,C） with the highest weight 4, we describe subalgebras Sβ（V4）＋ and Sγ（V4）＋ of the βγ-system coset S（V4）＋ by giving their generators. These eoset su...In this paper, for the highest weight module V4 of sl（2,C） with the highest weight 4, we describe subalgebras Sβ（V4）＋ and Sγ（V4）＋ of the βγ-system coset S（V4）＋ by giving their generators. These eoset subalgebras are interesting, new examples of strongly finitely generated vertex algebra.展开更多
We give an explicit description for a weight three generator of the coset vertex operator algebra C_L_(sln)(l,0)L_(sln)(1,0)(L_(sln)(l+1,0),for n≥2, l≥1. Furthermore, we prove that the nommutant C_L_(sl3)(l,0)L_(sl3...We give an explicit description for a weight three generator of the coset vertex operator algebra C_L_(sln)(l,0)L_(sln)(1,0)(L_(sln)(l+1,0),for n≥2, l≥1. Furthermore, we prove that the nommutant C_L_(sl3)(l,0)L_(sl3)(1,0)(L_(sl3)(l+1,0)) is isomorphic to the W-algebra W_(-3+(l+3)/(l+4))(sl_3), which confirms the conjecture for the sl_3 case that C_L_g(l,0)L_g(1,0)(L_g(l + 1,0)) is isomorphic to W_(-h+(l+h)/(l+h+1))(g) for simaly-laced Lie algebras g with its Coxeter number h for a positive integer l.展开更多
Difference systems of sets （DSS） are combinatorial configurations that arise in connection with code synchronization. This paper proposes a new method to construct DSSs, which uses known DSSs to partition some of th...Difference systems of sets （DSS） are combinatorial configurations that arise in connection with code synchronization. This paper proposes a new method to construct DSSs, which uses known DSSs to partition some of the cosets of Zv relative to subgroup of order k, where v = km is a composite number. As applications, we obtain some new optimal DSSs.展开更多
In this paper coset diagrams, propounded by Higman, are used to investigate the behavior of elements as words in orbits of the action of the Picard group F = PSL（2, Z[i]） on Q（i, √3）. Graphical interpretation of ...In this paper coset diagrams, propounded by Higman, are used to investigate the behavior of elements as words in orbits of the action of the Picard group F = PSL（2, Z[i]） on Q（i, √3）. Graphical interpretation of amalgamation of the components of F is also given. Some elements a＋b√3/c of Q（i, √3） and their conjugates a-b√3/c a c over Q（i） have different signs in the orbits of the biquadratic field Q（i, √3） when acted upon by F. Such real quadratic irrational numbers are called ambiguous numbers. It is shown that ambiguous numbers in these coset diagrams form a unique pattern. It is proved that there are a finite number of ambiguous numbers in an orbit Fa, and they form a closed path which is the only closed path in the orbit Гa. We also devise a procedure to obtain ambiguous numbers of the form a-b√3/c, where b is a positive integer.展开更多
The rapid advancement of data in web-based communication has created one of the biggest issues concerning the security of data carried over the internet from unauthorized access.To improve data security,modern cryptos...The rapid advancement of data in web-based communication has created one of the biggest issues concerning the security of data carried over the internet from unauthorized access.To improve data security,modern cryptosystems use substitution-boxes.Nowadays,data privacy has become a key concern for consumers who transfer sensitive data from one place to another.To address these problems,many companies rely on cryptographic techniques to secure data from illegal activities and assaults.Among these cryptographic approaches,AES is a well-known algorithm that transforms plain text into cipher text by employing substitution box(S-box).The S-box disguises the relationship between cipher text and the key to guard against cipher attacks.The security of a cipher using an S-box depends on the cryptographic strength of the respective S-box.Therefore,various researchers have employed different techniques to construct high order non-linear S-box.This paper provides a novel approach for evolving S-boxes using coset graphs for the action of the alternating group A5 over the finite field and the symmetric group S256.The motivation for this work is to study the symmetric group and coset graphs.The authors have performed various analyses against conventional security criteria such as nonlinearity,differential uniformity,linear probability,the bit independence criterion,and the strict avalanche criterion to determine its high cryptographic strength.To evaluate its image application performance,the proposed S-box is also used to encrypt digital images.The performance and comparison analyses show that the suggested S-box can secure data against cyber-attacks.展开更多
文摘we prove that the Connectivities of Minimal Cayley Coset Digraphs are their regular degrees. Connectivity of transitive digraphs and a combinatorial propertyof finite groups Ann., Discrete Math., 8 1980 61--64 Meng Jixiang and Huang Qiongxiang On the connectivity of Cayley digraphs, to appear Sabidussi, G. Vertex transitive graphs Monatsh. Math., 68 1969 426--438 Watkins, M. E. Connectivity of transitive graphs J. Combin. Theory, 8 1970 23--29 Zemor, G. On positive and negative atoms of Cayley digraphs Discrete Applied Math., 23 1989 193--195 Department of Mathematics,Xinjiang University,Urumpi 830046.APPLIED MATHEMATICS 3. Statement of Inexact Method Here we assume F to be continuousely differentiable. Inexact Newton method was first studied in the solution of smooth equations (see ). Now, such a technique has been widely used in optimizations, nonlinear complementarity problems and nonsmooth equations (see, and , etc.) In order to establish the related inexact methods,we introduce a nonlinear operator T(x): R n R n . Its components are defined as follows: (T(x)p) i=[HL(2:1,Z;2,Z] (x k+p k) i, if i∈(x k), H i(x k)+ min {(p k) i,F i(x k) Tp k}, if i∈(x k), F i(x k)+F i(x k) Tp k, i∈(x k).(3.1) Then, it is clear that the subproblem (2.5) turns to T(x k)p k=0.(3.2) In inexact algorithm, we determine p k in the followinginexact way ( see ). ‖T(x k)p k‖ υ k‖H(x k)‖,(3.3) where υ k is a given positive sequence. It is then obviously that (3.2),or equivalently (2.5), is a special case of (3.3) corresponding to υ k=0 . In particular, (3.3) can be used as a termination rule of the iterative process for solving (2.5). The following proposition shows the existence of λ k satisfying (2.4). Proposition 3.1. Let F be continuously differe ntiable. υ k is chosen so that υ k for some constant ∈(0,1). Then p k generated by (3.3) is a descent direction of θ at x k, and for some constant σ∈(0, min (1/2,1- holds θ(x k)-θ(x k+λ kp k) 2σλ kθ(x k)(3.4) for all sufficiently small λ k>0. Proof For simplification, we omit the lower subscripts k and denote (x k) i , H i(x k) , (BH(x k)p k) i , etc.by x i , H i , (BHp) i , etc. respectively. To estimate the directional derivative of θ at x k along p k , we divide it into three parts: D p k θ(x k)=H T(x k)BH(x k)p k=T 1+T 2+T 3,(3.5) where T 1=Σ i∈α k H i(BHp) i , T 2=Σ i∈β k H i(BHp) i , T 3=Σ i∈γ k H i(BHp) i . Consider i∈α k= k∪α -(x k) . In this case, we always have H i(BH(x)p) i=H i 2+H i(x i+p i) . If i∈ k , then H i(BHp) i -H i 2+|H i‖(T(x)p) i|. If i∈α -(x k) , then x i<0 . We have either x i+p i 0 , or x i+p i<0 . When x i+p i 0 , we get H i(BH(x)p) i -H i 2 .In the later case, x i+p i<0 , so H i(BH(x)p) i=-H i 2+|H i‖x i+p i|. Then, by elementary computation, we deduce that T 1 -Σi∈α kH i 2+Σ i∈α k|H i‖(T(x)p) i|.(3.6) Received March 1, 1995. 1991 MR Subject Classification: 05C25
文摘A multi dimensional concatenation scheme for block codes is introduced, in which information symbols are interleaved and re encoded for more than once. It provides a convenient platform to design high performance codes with flexible interleaver size. Coset based MAP soft in/soft out decoding algorithms are presented for the F24 code. Simulation results show that the proposed coding scheme can achieve high coding gain with flexible interleaver length and very low decoding complexity.
基金The project supported by National Key Basic Research Project of China under Grant No. 2004CB318000 and National Natural Science Foundation of China under Grant Nos. 10375038 and 90403018. The authors would like to express their thanks to Moningside Center, The Chinese Academy of Sciences. Part of the work was done when we were joining the Workshop on Mathematical Physics there.Acknowledgments We are deeply grateful to Profs. Qi-Keng Lu, Han-Ying Guo, and Shi-Kun Wang for their valuable discussions, which essentially stimulate us to write down this work.
文摘This article considers One example is also given to take a the coset structure closer look at what of spin group via analyzing the expression of its representation. the coset and the subgroup are.
文摘Let q be a prime power. By PL（Fq） the authors mean a projective line over the finite field Fq with the additional point ∞. In this article, the authors parametrize the conjugacy classes of nondegenerate homomorphisms which represent actions of △（3, 3, k） = （u, v： u^3 = v^3 = （uv）^k = 1〉on PL（Fq）, where q ≡ ±1（modk）. Also, for various values of k, they find the conditions for the existence of coset diagrams depicting the permutation actions of △（3, 3, k） on PL（Fq）. The conditions are polynomials with integer coefficients and the diagrams are such that every vertex in them is fixed by （u^-v^-）^k. In this way, they get △（3, 3, k） as permutation groups on PL（Fq）.
文摘Two new notions for the coset partition of dyadic additive groups are proposed,andtheir sufficient and necessary conditions are also given.On the basis of these works,the feasibilityproblem of implementing minority-logic decoding algorithm for RM codes is solved.
基金Supported by the National Natural Science Foundation of China under Grant Nos.11047179 and 10875060the Special Fund for Basic Scientific Research of Central Colleges+2 种基金Chang’an University,the Special Foundation for Basic Research Program of Chang’an Universitythe Open Fund of Key Laboratory for Special Area Highway Engineering(Ministry of Education),Chang’an University,under Grant No.CHD2009JC030Xi’an Shiyou University Science and Technology Foundation under Grant No.2010QN018.
文摘The classical exchange algebra satisfied by the monodromy matrix of the nonlinear sigma model on a supercoset target withℤ2n grading is derived using a first−order Hamiltonian formulation and by adding to the Lax connection terms proportional to constraints.This enables us to show that the conserved charges of the theory are in involution.When n=2,our results coincide with the results given by Magro for the pure spinor description of AdS5×S5 string theory(when the ghost terms are omitted).
文摘Based on the concepts of set value map and power group,the definitions of comove relation,coset group and comove group were given,their properties were discussed and meaningful results were obtained.
文摘The palm vein authentication technology is extremely safe, accurate and reliable as it uses the vascular patterns contained within the body to confirm personal identification. The pattern of veins in the palm is complex and unique to each individual. Its non-contact function gives it a healthful advantage over other biometric technologies. This paper presents an algebraic method for personal authentication and identification using internal contactless palm vein images. We use MATLAB image processing toolbox to enhance the palm vein images and employ coset decomposition concept to store and identify the encoded palm vein feature vectors. Experimental evidence shows the validation and influence of the proposed approach.
文摘We prove a general mirror duality theorem for a subalgebra U of a simple conformal vertex algebra A and its commutant V=ComA(U).Specifically,we assume that A≌■_(i∈I)U_(i)■V_(i) as a U■V-module,where the U-modules Uiare simple and distinct and are objects of a semisimple braided ribbon category of Umodules,and the V-modules Viare semisimple and contained in a(not necessarily rigid) braided tensor category of V-modules.We also assume U=ComA(V).Under these conditions,we construct a braid-reversed tensor equivalence τ:u_(A)→v_(A),where u_(A)is the semisimple category of U-modules with simple objects Ui,i∈I,and v_(A)is the category of V-modules whose objects are finite direct sums of Vi.In particular,the V-modules Viare simple and distinct,and v_(A)is a rigid tensor category.As an application,we find a rigid semisimple tensor subcategory of modules for the Virasoro algebra at central charge 13+6p+6p^(-1),p∈Z_(≥2), which is braided tensor equivalent to an abelian 3-cocycle twist of the category of finite-dimensional sl2-modules.Consequently,the Virasoro vertex operator algebra at central charge 13+6p+6p^(-1)is the PSL_(2)(C)-fixed-point subalgebra of a simple conformal vertex algebra w(-p),analogous to the realization of the Virasoro vertex operator algebra at central charge 13-6p-6p^(-1)as the PSL_(2)(C)-fixed-point subalgebra of the triplet algebra W(p).
基金Supported by National Natural Science Foundation of China (10971071)Provincial Foundation of Innovative Scholars of Henan
文摘In this paper, for the highest weight module V4 of sl（2,C） with the highest weight 4, we describe subalgebras Sβ（V4）＋ and Sγ（V4）＋ of the βγ-system coset S（V4）＋ by giving their generators. These eoset subalgebras are interesting, new examples of strongly finitely generated vertex algebra.
基金supported by Japan Society for the Promotion of Science Grants (Grant Nos. 25287004 and 26610006)National Natural Science Foundation of China (Grant Nos. 11371245 and 11531004)
文摘We give an explicit description for a weight three generator of the coset vertex operator algebra C_L_(sln)(l,0)L_(sln)(1,0)(L_(sln)(l+1,0),for n≥2, l≥1. Furthermore, we prove that the nommutant C_L_(sl3)(l,0)L_(sl3)(1,0)(L_(sl3)(l+1,0)) is isomorphic to the W-algebra W_(-3+(l+3)/(l+4))(sl_3), which confirms the conjecture for the sl_3 case that C_L_g(l,0)L_g(1,0)(L_g(l + 1,0)) is isomorphic to W_(-h+(l+h)/(l+h+1))(g) for simaly-laced Lie algebras g with its Coxeter number h for a positive integer l.
基金Supported by Natural Science Foundation of Hebei Province(Grant No.A2013205073)
文摘Difference systems of sets （DSS） are combinatorial configurations that arise in connection with code synchronization. This paper proposes a new method to construct DSSs, which uses known DSSs to partition some of the cosets of Zv relative to subgroup of order k, where v = km is a composite number. As applications, we obtain some new optimal DSSs.
文摘In this paper coset diagrams, propounded by Higman, are used to investigate the behavior of elements as words in orbits of the action of the Picard group F = PSL（2, Z[i]） on Q（i, √3）. Graphical interpretation of amalgamation of the components of F is also given. Some elements a＋b√3/c of Q（i, √3） and their conjugates a-b√3/c a c over Q（i） have different signs in the orbits of the biquadratic field Q（i, √3） when acted upon by F. Such real quadratic irrational numbers are called ambiguous numbers. It is shown that ambiguous numbers in these coset diagrams form a unique pattern. It is proved that there are a finite number of ambiguous numbers in an orbit Fa, and they form a closed path which is the only closed path in the orbit Гa. We also devise a procedure to obtain ambiguous numbers of the form a-b√3/c, where b is a positive integer.
文摘The rapid advancement of data in web-based communication has created one of the biggest issues concerning the security of data carried over the internet from unauthorized access.To improve data security,modern cryptosystems use substitution-boxes.Nowadays,data privacy has become a key concern for consumers who transfer sensitive data from one place to another.To address these problems,many companies rely on cryptographic techniques to secure data from illegal activities and assaults.Among these cryptographic approaches,AES is a well-known algorithm that transforms plain text into cipher text by employing substitution box(S-box).The S-box disguises the relationship between cipher text and the key to guard against cipher attacks.The security of a cipher using an S-box depends on the cryptographic strength of the respective S-box.Therefore,various researchers have employed different techniques to construct high order non-linear S-box.This paper provides a novel approach for evolving S-boxes using coset graphs for the action of the alternating group A5 over the finite field and the symmetric group S256.The motivation for this work is to study the symmetric group and coset graphs.The authors have performed various analyses against conventional security criteria such as nonlinearity,differential uniformity,linear probability,the bit independence criterion,and the strict avalanche criterion to determine its high cryptographic strength.To evaluate its image application performance,the proposed S-box is also used to encrypt digital images.The performance and comparison analyses show that the suggested S-box can secure data against cyber-attacks.
