A5083632263- Finite Group Theory Research
- graph theory and CDMA systems
- Coding theory and cryptography
- Graph Labeling and Dimension Problems
- Advanced Topics in Algebra
- Algebraic structures and combinatorial models
- Advanced Graph Theory Research
- Rings, Modules, and Algebras
- Graph theory and applications
Hebei GEO University
2021-2025
Hebei Normal University
2018-2019
Let [Formula: see text] be a finite undirected simple connected graph with vertex set and edge text]. A resolves two elements (vertices or edges) if subset of vertices in is called mixed metric generator for every distinct are resolved by some The minimum cardinality the dimension denoted In this paper, we study plane web convex polytope
Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. $\square_n$ the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$ based block-diagonalizing Terwilliger algebra and semidefinite programming.The technique this paper extension approach taken A. Schrijver \cite{s} study $A(H(n,2),d)$.
Let F denote an algebraically closed field, and let V a vector space over with finite positive dimension. By Leonard pair on we mean ordered of linear transformations A,A∗ such that, for each A,A∗, there exists basis respect to which the matrix representing that transformation is diagonal other irreducible tridiagonal. Assume dimension at least 4. In this paper, consider class pairs said be classical type consists four families: Racah type, Hahn dual-Hahn Krawtchouk type. . using...
Let F denote a field with characteristic not 2 and fix nonzero q∈F such that q2≠1. Uq(sl2) be the quantum enveloping algebra over let x,y±1,z its equitable generators. Denote by Uq∨ subalgebra of generated x,y−1,z. In this paper, we solve two open problems concerning Uq∨, respectively, which are proposed Bockting-Conrad Terwilliger.