We investigate decomposition of codes and finite languages. A prime decomposition is a decomposition of a code or languages into a concatenation of nontrivial prime codes or languages. A code is prime if it cannot be ...We investigate decomposition of codes and finite languages. A prime decomposition is a decomposition of a code or languages into a concatenation of nontrivial prime codes or languages. A code is prime if it cannot be decomposed into at least two nontrivial codes as the same for the languages. In the paper, a linear time algorithm is designed, which finds the prime decomposition. If codes or finite languages are presented as given by its minimal deterministic automaton, then from the point of view of abstract algebra and graph theory, this automaton has special properties. The study was conducted using system for computational Discrete Algebra GAP. .展开更多
A lot of combinatorial objects have a natural bialgebra structure. In this paper, we prove that the vector space spanned by labeled simple graphs is a bialgebra with the conjunction product and the unshuffle coproduct...A lot of combinatorial objects have a natural bialgebra structure. In this paper, we prove that the vector space spanned by labeled simple graphs is a bialgebra with the conjunction product and the unshuffle coproduct. In fact, it is a Hopf algebra since it is graded connected. The main conclusions are that the vector space spanned by labeled simple graphs arising from the unshuffle coproduct is a Hopf algebra and that there is a Hopf homomorphism from permutations to label simple graphs.展开更多
In this paper the isomorphism theorem for tensor algebras over valued graphs is provedand some relations between algebraic properties of tensor algebras and geometric propertiesof valued graphs are investigated.
Let K〈X〉 = K（X1,..., Xn） be the free K-algebra on X = {X1,..., Xn} over a field K, which is equipped with a weight N-gradation （i.e., each Xi is assigned a positive degree）, and let G be a finite homogeneous GrS...Let K〈X〉 = K（X1,..., Xn） be the free K-algebra on X = {X1,..., Xn} over a field K, which is equipped with a weight N-gradation （i.e., each Xi is assigned a positive degree）, and let G be a finite homogeneous GrSbner basis for the ideal I = （G） of K（X） with respect to some monomial ordering 〈 on K（X）. It is shown that if the monomial algebra K（X）/（LM（6）） is semiprime, where LM（6） is the set of leading monomials of 6 with respect to 〈, then the N-graded algebra A ： K（X）/I is semiprimitive in the sense of Jacobson. In the case that G is a finite nonhomogeneous Gr6bner basis with respect to a graded monomial ordering 〈gr, and the N-filtration FA of the algebra A = K（X）/I induced by the N-grading filtration FK（X） of K（X） is considered, if the monomial algebra K（X）/（LM（6）） is semiprime, then it is shown that the associated N-graded algebra G（A） and the Rees algebra A of A determined by FA are all semiprimitive.展开更多
Let A be a row-finite k-graph without sources. We investigate the relationship between the complex Kumjian-Pask algebra KPc（A） and graph algebra C＊（A）. We identify situations in which the Kumjian-Pask algebra is ...Let A be a row-finite k-graph without sources. We investigate the relationship between the complex Kumjian-Pask algebra KPc（A） and graph algebra C＊（A）. We identify situations in which the Kumjian-Pask algebra is equal to the graph algebra, and the conditions in which the Kumjian-Pask algebra is finite-dimensional.展开更多
Based on the mathematic representation of loops of kinematic chains, this paper proposes the " ⊕ " operation of loops and its basic laws and establishes the basic theorem system of the loop algebra of kinem...Based on the mathematic representation of loops of kinematic chains, this paper proposes the " ⊕ " operation of loops and its basic laws and establishes the basic theorem system of the loop algebra of kinematic chains. Then the basis loop set and its determination conditions, and the ways to obtain the crucial perimeter topological graph are presented. Furthermore, the characteristic perimeter topo-logical graph and the characteristic adjacency matrix are also developed. The most important characteristic of this theory is that for a topological graph which is drawn or labeled in any way, both the resulting characteristic perimeter topological graph and the characteristic adjacency matrix obtained through this theory are unique, and each has one-to-one correspondence with its kinematic chain. This character-istic dramatically simplifies the isomorphism identification and establishes a theoretical basis for the numeralization of topological graphs, and paves the way for numeralization and computerization of the structural synthesis and mechanism design further. Finally, this paper also proposes a concise isomorphism identifica-tion method of kinematic chains based on the concept of characteristic adjacency matrix.展开更多
We prove that the spectrum of a Cayley graph over a finite group with a normal generating set S containing with every its element s all generators of the cyclic group(s)is integral.In particular,a Cayley graph of a 2-...We prove that the spectrum of a Cayley graph over a finite group with a normal generating set S containing with every its element s all generators of the cyclic group(s)is integral.In particular,a Cayley graph of a 2-group generated by a normal set of involutions is integral.We prove that a Cayley graph over the symmetric group of degree n no less than 2 generated by all transpositions is integral.We find the spectrum of a Cayley graph over the alternating group of degree n no less than 4 with a generating set of 3-cycles of the form(k i j)with fixed k,a s{-n+1,1-n+1,2^2-n+1,...,(n-1)2-n+1}.展开更多
文摘We investigate decomposition of codes and finite languages. A prime decomposition is a decomposition of a code or languages into a concatenation of nontrivial prime codes or languages. A code is prime if it cannot be decomposed into at least two nontrivial codes as the same for the languages. In the paper, a linear time algorithm is designed, which finds the prime decomposition. If codes or finite languages are presented as given by its minimal deterministic automaton, then from the point of view of abstract algebra and graph theory, this automaton has special properties. The study was conducted using system for computational Discrete Algebra GAP. .
文摘A lot of combinatorial objects have a natural bialgebra structure. In this paper, we prove that the vector space spanned by labeled simple graphs is a bialgebra with the conjunction product and the unshuffle coproduct. In fact, it is a Hopf algebra since it is graded connected. The main conclusions are that the vector space spanned by labeled simple graphs arising from the unshuffle coproduct is a Hopf algebra and that there is a Hopf homomorphism from permutations to label simple graphs.
基金Project supported by the National Natural Science Foundation of China.
文摘In this paper the isomorphism theorem for tensor algebras over valued graphs is provedand some relations between algebraic properties of tensor algebras and geometric propertiesof valued graphs are investigated.
基金Project supported by the National Natural Science Foundation of China （10971044）.
文摘Let K〈X〉 = K（X1,..., Xn） be the free K-algebra on X = {X1,..., Xn} over a field K, which is equipped with a weight N-gradation （i.e., each Xi is assigned a positive degree）, and let G be a finite homogeneous GrSbner basis for the ideal I = （G） of K（X） with respect to some monomial ordering 〈 on K（X）. It is shown that if the monomial algebra K（X）/（LM（6）） is semiprime, where LM（6） is the set of leading monomials of 6 with respect to 〈, then the N-graded algebra A ： K（X）/I is semiprimitive in the sense of Jacobson. In the case that G is a finite nonhomogeneous Gr6bner basis with respect to a graded monomial ordering 〈gr, and the N-filtration FA of the algebra A = K（X）/I induced by the N-grading filtration FK（X） of K（X） is considered, if the monomial algebra K（X）/（LM（6）） is semiprime, then it is shown that the associated N-graded algebra G（A） and the Rees algebra A of A determined by FA are all semiprimitive.
基金Supported by Universitas Pendidikan Indonesia(Indonesia University of Education) Research Grant-Hibah Dosen Peneliti(Grant No.558/UN.40.8/LT/2012)
文摘Let A be a row-finite k-graph without sources. We investigate the relationship between the complex Kumjian-Pask algebra KPc（A） and graph algebra C＊（A）. We identify situations in which the Kumjian-Pask algebra is equal to the graph algebra, and the conditions in which the Kumjian-Pask algebra is finite-dimensional.
基金Supported by the National Natural Science Foundation of China (Grant No. 50575197)
文摘Based on the mathematic representation of loops of kinematic chains, this paper proposes the " ⊕ " operation of loops and its basic laws and establishes the basic theorem system of the loop algebra of kinematic chains. Then the basis loop set and its determination conditions, and the ways to obtain the crucial perimeter topological graph are presented. Furthermore, the characteristic perimeter topo-logical graph and the characteristic adjacency matrix are also developed. The most important characteristic of this theory is that for a topological graph which is drawn or labeled in any way, both the resulting characteristic perimeter topological graph and the characteristic adjacency matrix obtained through this theory are unique, and each has one-to-one correspondence with its kinematic chain. This character-istic dramatically simplifies the isomorphism identification and establishes a theoretical basis for the numeralization of topological graphs, and paves the way for numeralization and computerization of the structural synthesis and mechanism design further. Finally, this paper also proposes a concise isomorphism identifica-tion method of kinematic chains based on the concept of characteristic adjacency matrix.
基金The work was supported by the Program of Fundamental Scientific Research of the SB RAS N 1.5.1,project No.0314-2019-0016.
文摘We prove that the spectrum of a Cayley graph over a finite group with a normal generating set S containing with every its element s all generators of the cyclic group(s)is integral.In particular,a Cayley graph of a 2-group generated by a normal set of involutions is integral.We prove that a Cayley graph over the symmetric group of degree n no less than 2 generated by all transpositions is integral.We find the spectrum of a Cayley graph over the alternating group of degree n no less than 4 with a generating set of 3-cycles of the form(k i j)with fixed k,a s{-n+1,1-n+1,2^2-n+1,...,(n-1)2-n+1}.
