Sung‐Yell Song

ORCID: 0000-0002-6404-5430
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • 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

10.1007/s10817-025-09718-9 article EN Journal of Automated Reasoning 2025-02-04

10.1016/j.ejc.2012.01.011 article EN publisher-specific-oa European Journal of Combinatorics 2012-02-27

10.1016/0097-3165(90)90029-v article EN publisher-specific-oa Journal of Combinatorial Theory Series A 1990-07-01

10.1016/0021-8693(90)90224-c article EN publisher-specific-oa Journal of Algebra 1990-03-01

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.

10.1002/jcd.21416 article EN Journal of Combinatorial Designs 2014-11-24

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...

10.13001/ela.2020.4941 article EN Electronic Journal of Linear Algebra 2020-06-08

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...

10.1080/03610929708831898 article EN Communication in Statistics- Theory and Methods 1997-01-01

10.1016/s0378-3758(98)00188-8 article EN Journal of Statistical Planning and Inference 1999-02-01

10.1006/eujc.1993.1043 article EN publisher-specific-oa European Journal of Combinatorics 1993-09-01

10.1016/s0378-3758(98)00064-0 article EN Journal of Statistical Planning and Inference 1998-09-01

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.

10.1002/jcd.21518 article EN Journal of Combinatorial Designs 2016-02-29

10.1007/s003730200049 article EN Graphs and Combinatorics 2002-10-01

10.1016/0097-3165(95)90077-2 article EN Journal of Combinatorial Theory Series A 1995-04-01

We give a full description of the algebraic structures Bose-Mesner algebra and Terwilliger wreath product one-class association schemes.

10.48550/arxiv.1008.2228 preprint EN other-oa arXiv (Cornell University) 2010-01-01

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)$...

10.48550/arxiv.1006.5395 preprint EN other-oa arXiv (Cornell University) 2010-01-01

10.1007/s10801-005-6278-5 article EN Journal of Algebraic Combinatorics 2005-01-01
Coming Soon ...