1 citations · 3 across the 12 of their papers we have counts for
14 papers · 1 filter
Constructions of Large m-Distance Sets on Triangular Lattice
Li-Ren Bao, Wei-Hsuan Yu
An -distance set is a collection of points such that the distances between any two points have possible values. We use two different methods to construct large -distance…
Bounds on two-distance sets in Euclidean space and Unit Sphere
Wei-Chun Chen, Wei-Hsuan Yu
We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. W…
Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
Sihuang Hu, Hexiang Huang, Wei-Hsuan Yu
An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamm…
Sharing tea on a graph
J. Pascal Gollin, Kevin Hendrey, Hao Huang +6
Motivated by the analysis of consensus formation in the Deffuant model for social interaction, we consider the following procedure on a graph . Initially, there is one unit of t…
Stability for hyperplane covers
Shagnik Das, Valjakas Djaljapayan, Yen-chi Roger Lin +1
An almost -cover of the hypercube is a collection of hyperplanes that avoids the origin and covers every other vertex at least times. When is large wit…
On the two-distance embedding in real Euclidean space of coherent configuration of type (2,2;3)
Eiichi Bannai, Etsuko Bannai, Chin-Yen Lee +2
Finding the maximum cardinality of a -distance set in Euclidean space is a classical problem in geometry. Lisoněk in 1997 constructed a maximum -distance set in …