Chi Hoi Yip
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Chi Hoi Yip has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Shamil Asgarli
Santa Clara University
13 shared publications - Semin Yoo
Discrete Mathematics Group Institute for Basic Science Daejeon, South Korea
7 shared publications - Dragos Ghioca
University of British Columbia
6 shared publications - Sergey Goryainov
School of Mathematical Sciences, Hebei International Joint Research Center for Mathematics and Interdisciplinary Science, Hebei Key Laboratory of Computational Mathematics and Applications, Hebei Workstation for Foreign Academicians, Hebei Normal University, Shijiazhuang, People’s Republic of China
5 shared publications - Zixiang Xu
Extremal Combinatorics and Probability Group, Institute for Basic Science, Daejeon, South Korea
5 shared publications - Seoyoung Kim
Departement Mathematik und Informatik Universität Basel Basel Switzerland
4 shared publications
Latest Publications
- Open Access
- 25 October 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (10)
Blocking sets from a union of plane curves
Motivated by a question of Erdős on blocking sets in a projective plane that intersect every line only a few times, several authors have used unions of algebraic curves to construct such sets in $$\mathbb {P}^2(\mathbb {F}_q)$$ . In this paper, we provide new constructions of blocking sets in $$\mathbb {P}^2(\mathbb {F}_q)$$ from unions of geometrically irreducible curves of a fixed degree d . We also establish lower bounds on the number of such curves required to form a blocking set. Our proofs combine tools from arithmetic geometry and combinatorics.- 25 October 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (10)
Open AccessBlocking sets from a union of plane curves
Motivated by a question of Erdős on blocking sets in a projective plane that intersect every line only a few times, several authors have used unions of algebraic curves to construct such sets in $$\mathbb {P}^2(\mathbb {F}_q)$$ . In this paper, we provide new constructions of blocking sets in $$\mathbb {P}^2(\mathbb {F}_q)$$ from unions of geometrically irreducible curves of a fixed degree d . We also establish lower bounds on the number of such curves required to form a blocking set. Our proofs combine tools from arithmetic geometry and combinatorics. - Open Access
- 16 June 2026
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- p. 1-8
AN ERDŐS–KO–RADO THEOREM FOR BINARY CODES
We study intersecting families of words from the Erdős–Ko–Rado perspective. When the alphabet size is $2$ 2 , a maximum intersecting family is not necessarily a star. However, we prove that every maximum $3$ 3 -wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least $3$ 3 : maximum intersecting families of words are exactly the stars.- 16 June 2026
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- p. 1-8
Open AccessAN ERDŐS–KO–RADO THEOREM FOR BINARY CODES
We study intersecting families of words from the Erdős–Ko–Rado perspective. When the alphabet size is $2$ 2 , a maximum intersecting family is not necessarily a star. However, we prove that every maximum $3$ 3 -wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least $3$ 3 : maximum intersecting families of words are exactly the stars. - Open Access
- 6 May 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 113 (5)
Entrywise transforms preserving matrix positivity and nonpositivity
We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers . Compared to the classical work on entrywise preservers by Schoenberg and others, we completely resolve this problem in the harder fixed‐dimensional setting, extending a similar recent classification of sign preservers obtained for matrices over finite fields. When the matrix dimension is fixed and at least , we show that the sign preservers are precisely the positive scalar multiples of the continuous automorphisms of the underlying field. This is in contrast to the case where the sign preservers are extensions of power functions. These results are built on our classification of entrywise positivity preservers over broader complex domains. Our results yield a complementary connection with recent work of Belton, Guillot, Khare, and Putinar on negativity‐preserving transforms. We also extend our sign preserver results to matrices with a structure of zeros, as studied by Guillot, Khare, and Rajaratnam for the entrywise positivity preserver problem. Finally, in the spirit of sign preservers, we address a natural extension to monotone maps, classically studied by Loewner and many others.
- 6 May 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 113 (5)
Open AccessEntrywise transforms preserving matrix positivity and nonpositivity
We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers . Compared to the classical work on entrywise preservers by Schoenberg and others, we completely resolve this problem in the harder fixed‐dimensional setting, extending a similar recent classification of sign preservers obtained for matrices over finite fields. When the matrix dimension is fixed and at least , we show that the sign preservers are precisely the positive scalar multiples of the continuous automorphisms of the underlying field. This is in contrast to the case where the sign preservers are extensions of power functions. These results are built on our classification of entrywise positivity preservers over broader complex domains. Our results yield a complementary connection with recent work of Belton, Guillot, Khare, and Putinar on negativity‐preserving transforms. We also extend our sign preserver results to matrices with a structure of zeros, as studied by Guillot, Khare, and Rajaratnam for the entrywise positivity preserver problem. Finally, in the spirit of sign preservers, we address a natural extension to monotone maps, classically studied by Loewner and many others.
- 26 April 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (5) , 101
Cliques in Paley graphs of square order and in Peisert graphs
- 26 April 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (5) , 101
Cliques in Paley graphs of square order and in Peisert graphs
- Open Access
- 16 April 2026
- Published by Wiley in Mathematika
- Vol. 72 (2)
f‐Diophantine sets over finite fields via quasi‐random hypergraphs from multivariate polynomials
We investigate ‐Diophantine sets over finite fields via new explicit constructions of families of quasi‐random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for constructing quasi‐random hypergraphs but also provides a unified framework for studying various hypergraphs arising from multivariate polynomials over finite fields, including Paley sum hypergraphs, and hypergraphs derived from Diophantine tuples and their generalizations. We derive an asymptotic formula for the number of ‐Diophantine ‐tuples, answering a question of Hammonds et al., and study some related questions for ‐Diophantine sets, extending and improving several recent works. We also sharpen a classical estimate of Chung and Graham on even partial octahedra in Paley sum hypergraphs.
- 16 April 2026
- Published by Wiley in Mathematika
- Vol. 72 (2)
Open Accessf‐Diophantine sets over finite fields via quasi‐random hypergraphs from multivariate polynomials
We investigate ‐Diophantine sets over finite fields via new explicit constructions of families of quasi‐random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for constructing quasi‐random hypergraphs but also provides a unified framework for studying various hypergraphs arising from multivariate polynomials over finite fields, including Paley sum hypergraphs, and hypergraphs derived from Diophantine tuples and their generalizations. We derive an asymptotic formula for the number of ‐Diophantine ‐tuples, answering a question of Hammonds et al., and study some related questions for ‐Diophantine sets, extending and improving several recent works. We also sharpen a classical estimate of Chung and Graham on even partial octahedra in Paley sum hypergraphs.
- Open Access
- 9 March 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 113 (3)
Diophantine tuples and product sets in shifted powers
Let and . A Diophantine tuple with property is a set of positive integers such that is a th power for all with . Such generalizations of classical Diophantine tuples have been studied extensively. In this paper, we prove several results related to robust versions of such Diophantine tuples and discuss their applications to product sets contained in a nontrivial shift of the set of all perfect powers or some of its special subsets. In particular, we substantially improve several results by Bérczes–Dujella–Hajdu–Luca, and Yip. We also prove several interesting conditional results. Our proofs are based on a novel combination of ideas from sieve methods, Diophantine approximation, and extremal graph theory.
- 9 March 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 113 (3)
Open AccessDiophantine tuples and product sets in shifted powers
Let and . A Diophantine tuple with property is a set of positive integers such that is a th power for all with . Such generalizations of classical Diophantine tuples have been studied extensively. In this paper, we prove several results related to robust versions of such Diophantine tuples and discuss their applications to product sets contained in a nontrivial shift of the set of all perfect powers or some of its special subsets. In particular, we substantially improve several results by Bérczes–Dujella–Hajdu–Luca, and Yip. We also prove several interesting conditional results. Our proofs are based on a novel combination of ideas from sieve methods, Diophantine approximation, and extremal graph theory.
- Open Access
- 18 February 2026
- Published by Springer Nature in Research in Number Theory
- Vol. 12 (1) , 16
Bipartite Diophantine tuples and their applications
This paper investigates bipartite variants of generalized Diophantine tuples and their applications. We generalize a result of Bugeaud–Dujella on a special family of bipartite Diophantine tuples and affirmatively resolve a related question posed by the second author. Additionally, we establish new connections between bipartite Diophantine tuples and several known variants of Diophantine tuples, including those introduced by Banks–Luca–Szalay and Kihel–Kihel.
- 18 February 2026
- Published by Springer Nature in Research in Number Theory
- Vol. 12 (1) , 16
Open AccessBipartite Diophantine tuples and their applications
This paper investigates bipartite variants of generalized Diophantine tuples and their applications. We generalize a result of Bugeaud–Dujella on a special family of bipartite Diophantine tuples and affirmatively resolve a related question posed by the second author. Additionally, we establish new connections between bipartite Diophantine tuples and several known variants of Diophantine tuples, including those introduced by Banks–Luca–Szalay and Kihel–Kihel.
- Open Access
Product representations of polynomials over finite fields
Erdős, Sárközy, and Sós studied the asymptotics of the maximum size of a subset of $\{1,2,\ldots, N\}$ such that it does not contain $k$ distinct elements whose product is a perfect square. More generally, Verstraëte proposed a conjecture regarding the asymptotic behavior of the same quantity with the set of perfect squares replaced by the value set of a polynomial in $\mathbb{Z}[x]$. In this paper, we study a finite field analogue of Verstraëte's conjecture.Open AccessProduct representations of polynomials over finite fields
Erdős, Sárközy, and Sós studied the asymptotics of the maximum size of a subset of $\{1,2,\ldots, N\}$ such that it does not contain $k$ distinct elements whose product is a perfect square. More generally, Verstraëte proposed a conjecture regarding the asymptotic behavior of the same quantity with the set of perfect squares replaced by the value set of a polynomial in $\mathbb{Z}[x]$. In this paper, we study a finite field analogue of Verstraëte's conjecture. - Open Access
- 19 January 2026
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 221
Van Lint–MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields, II
- 19 January 2026
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 221
Open AccessVan Lint–MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields, II
- Open Access
Paley-type matrices and $1$-factorizations of complete graphs
Ball, Ortega--Moreno, and Prodromou asked whether, for every odd prime $p$, one can find a $1$-factor of the complete graph $K_{p+1}$ with some arithmetic restrictions related to quadratic residues. This problem is motivated by $1$-factorizations that are compatible with the sign pattern of certain Paley-type matrices. Recently, Afifurrahman et al. made some partial progress. In this paper, we completely resolve the problem.Open AccessPaley-type matrices and $1$-factorizations of complete graphs
Ball, Ortega--Moreno, and Prodromou asked whether, for every odd prime $p$, one can find a $1$-factor of the complete graph $K_{p+1}$ with some arithmetic restrictions related to quadratic residues. This problem is motivated by $1$-factorizations that are compatible with the sign pattern of certain Paley-type matrices. Recently, Afifurrahman et al. made some partial progress. In this paper, we completely resolve the problem.