- Finite Group Theory Research
- graph theory and CDMA systems
- Coding theory and cryptography
- Advanced Algebra and Geometry
- Graph theory and applications
- Algebraic Geometry and Number Theory
- Matrix Theory and Algorithms
- Algebraic structures and combinatorial models
- Rings, Modules, and Algebras
- Synthesis of Tetrazole Derivatives
- Graph Labeling and Dimension Problems
- Optimal Experimental Design Methods
- Synthesis and Properties of Aromatic Compounds
- Statistical Methods and Bayesian Inference
- Chromatin Remodeling and Cancer
- Geometric and Algebraic Topology
- Agricultural Innovations and Practices
- VLSI and FPGA Design Techniques
- Polysaccharides Composition and Applications
- Material Science and Thermodynamics
- Botanical Research and Chemistry
- Analytic Number Theory Research
- Spectral Theory in Mathematical Physics
- Algorithms and Data Compression
- Advanced Numerical Analysis Techniques
Beijing University of Chemical Technology
2025
Iowa State University
2009-2022
The Ohio State University
1987-1991
Abstract We introduce the notion of a partial geometric difference family as variation on classical and generalization sets. study relationship between families both designs families, show that give rise to designs. construct several infinite using Galois rings cyclotomy fields. From these we generate list directed strongly regular graphs.
The distance matrix $\mathcal{D}(G)$ of a graph $G$ is the containing pairwise distances between vertices, and Laplacian $\mathcal{D}^L (G)=T(G)-\mathcal{D} (G)$, where $T(G)$ diagonal row sums $\mathcal{D}(G)$. Several general methods are established for producing $\mathcal{D}^L$-cospectral graphs that can be used to construct infinite families. Examples provided show various properties not preserved by $\mathcal{D}^L$-cospectrality, including examples strongly regular circulant graphs. It...
Abstract We revisit the existence and construction problems of balanced sampling plans excluding contiguous units, a class designs introduced studied by Hedayat, Rao, Stufken (1988a,b). A link between these partially incomplete block is established, Fisher-type inequality shown to hold. Special attention given those that attain equality in this inequality. Some new are obtained construction, while nonexistence considered for some other sets parameters. Keywords: association schemesbalanced...
Abstract In this paper, we show that partial geometric designs can be constructed from certain three‐class association schemes and ternary linear codes with dual distance three. particular, obtain a family of the introduced by Kageyama, Saha, Das in their article [“Reduction number associate classes hypercubic schemes,” Ann Inst Statist Math 30 (1978)]. We also give list directed strongly regular graphs arising obtained paper.
We give a full description of the algebraic structures Bose-Mesner algebra and Terwilliger wreath product one-class association schemes.
We use finite incident structures to construct new infinite families of directed strongly regular graphs with parameters \[(l(q-1)q^l,\ l(q-1)q^{l-1},\ (lq-l+1)q^{l-2},\ (l-1)(q-1)q^{l-2},\ (lq-l+1)q^{l-2})\] for integers $q$ and $l$ ($q, l\ge 2$), \[(lq^2(q-1),\ lq(q-1),\ lq-l+1,\ (l-1)(q-1),\ lq-l+1)\] all prime powers $l\in \{1, 2,..., q\}$. The given by these constructions have $(36, 12, 5, 2, 5)$, $(54, 18, 7, 4, 7)$, $(72, 24, 10, 10)$, $(96, 3, $(108, 36, 14, 8, 14)$ 15, 6, 15)$...