Searcharxiv⌕ Search

arXiv subjects

Chi Hoi Yip

Publications and source records attributed to Chi Hoi Yip.

At least 19 recordsLinked to original sources

A sharp inverse theorem for the quadratic large sieve

We prove that if $A\subseteq[N]$, $|A|\gg\sqrt N$, and $|A_p|\le p/2+O(1)$ for every prime $p\ll\log N$, then $A$ contains at least $\exp(c\sqrt{\log N}/\log\log N)$ elements in the image of a single integral quadratic $m\pm x^2$. A matching construction shows that this is optimal even when the quadratic may be chosen arbitrarily in $\mathbb{Z}[x]$.

math.NT↗

A resolution of the Erdős similarity problem in the large

We show that for every unbounded set $A\subset\mathbb R$ and every $0<\varepsilon<1$, there exists a closed set $S\subset\mathbb R$ that has measure at least $1-\varepsilon$ in every unit interval and contains no nontrivial affine copy of $A$. Moreover, $S$ can be chosen so that $|S\cap[x,x+1]|\to1$ as $|x|\to\infty$. This resolves the Erdős similarity problem in the large.

math.CA↗

The Erdős similarity problem for polynomials and analytic maps

In this paper, we study the Erdős similarity problem by replacing affine copies with images of polynomial maps or analytic maps. This is inspired by a connection between a partial converse of Szemerédi's theorem and the Erdős similarity problem and its variants, as well as a version of polynomial Szemerédi's theorem by Bergelson and Leibman. In particular, we strengthen several known results in the literature. We show that a large class of sequence are not polynomially universal in this sense. First, for sequences satisfying suitable gap hypotheses, an explicit Cantor-type witness is constructed. Second, for sets satisfying certain growth conditions, a random Cantor-type witness is constructed, extending work of Kolountzakis. This also extends certain results in recent work of Cuéllar-Iosevich-Kulkarni-Aravena-Yavicoli to the polynomial setting. Finally, we show for arbitrary sequences $A$ with zero as an accumulation point that the $(d+3)$-fold sumset $(d+3)A$ is not polynomially universal when restricted to polynomials of degree at most $d$; this complements classical work of Bourgain.

math.CA↗

Avoiding short progressions in Euclidean Ramsey theory II

Recently, Currier, Moore, and Yip developed a general framework for constructing colorings avoiding prescribed monochromatic arithmetic progressions in Euclidean Ramsey theory. Writing $\ell_m$ for an $m$-term arithmetic progression with unit spacing, they proved $\mathbb E^n\not\to(\ell_3,\ell_{20})$ and $\mathbb E^n\not\to(\ell_3,α\ell_{6889})$ for every $α>0$. We refine and simplify their framework, proving $\mathbb E^n\not\to(\ell_3,α\ell_{22})$ for every $α>0$. We further establish $\mathbb E^n\not\to(\ell_3,α\ell_{21})$ except possibly for four values of $α^2$, and $\mathbb E^n\not\to(\ell_3,α\ell_{17})$ for all but finitely many $α>0$. Our approach also recovers several earlier results and avoids some technical arguments used in previous works.

math.CO↗

Low-rank matrices with three prescribed off-diagonal values over $\mathbb{F}_p$

For every prime $p$ and every three-element set $L\subseteq\mathbb{F}_p$, we prove that, for every integer $n\geq1$, there exists a symmetric $n\times n$ matrix over $\mathbb{F}_p$ with zero diagonal, off-diagonal entries in $L$, and rank $O_{p,L}(n^{1/3})$. This answers a question of Bukh. When $0\notin L$, a standard polynomial argument shows that the exponent $1/3$ is optimal. The proof combines an incidence matrix factorization with a projective-plane construction controlling line-intersection numbers modulo $p$. A separate geometric construction in characteristic two yields better explicit constants in certain cases, and also gives integer lifts $L'$ of the prescribed sets $L$ and symmetric $L'$-matrices of rational rank $O_{p,L}(n^{1/3})$. When $0\notin L'$, this improves Bukh's general quadratic lower bound, giving matrices of order $Ω_{p,L}(r^3)$ and rational rank at most $r$.

math.NT↗

On generalized covering radii of binary primitive double-error-correcting BCH codes

The generalized covering radii (GCR) of linear codes are a fundamental higher-dimensional extension of the classical covering radius. While the second and third GCR of binary primitive double-error-correcting BCH codes, $\text{BCH}(2,m)$, were recently determined, their proofs relied on highly complex combinatorial arguments, and the behavior of the GCR hierarchy for larger orders $k$ has remained largely unexplored. In this paper, we introduce the Generalized Supercode Lemma, which lower-bounds the GCR of a code using the generalized Hamming weights of an appropriate supercode. Applying this lemma, we significantly streamline and simplify the proofs for the known lower bounds of $ρ_2(\text{BCH}(2,m))$ and $ρ_3(\text{BCH}(2,m))$, and we establish a new lower bound for $ρ_4(\text{BCH}(2,m))$. Furthermore, by combining combinatorial arguments with Weil-type exponential sum estimates, we investigate the GCR hierarchy for general $k$, proving that $2k \le ρ_k(\text{BCH}(2,m)) \le 2k+1$ whenever $m$ is sufficiently large compared to $k$.

cs.IT↗

Extensions of the Carlitz-McConnel and Blokhuis-Sziklai theorems for unions of cyclotomic classes

Let $p$ be a prime, let $q=p^n$, and let $D\subseteq \mathbb{F}_q^\ast$. A celebrated result of Carlitz and McConnel states that if $D$ is a proper subgroup of $\mathbb{F}_q^\ast$, and $f:\mathbb{F}_q\to\mathbb{F}_q$ is a function such that $(f(x)-f(y))/(x-y)\in D$ for all $x\neq y$, then $f$ must be of the form $f(x)=ax^{p^j}+b$. In this paper, we extend their result to the setting where $D$ is a union of cosets of a fixed subgroup of $\mathbb{F}_q^\ast$, under a mild assumption. In a similar spirit, we also investigate maximum cliques in related Cayley graphs over finite fields, strengthening several results of Blokhuis, Sziklai, and Asgarli and Yip.

math.NT↗

Multiplicative subgroups are not restricted sumsets

We determine exactly which proper multiplicative subgroups of a prime field can be represented as a restricted sumset of the form $A\mathbin{\widehat{+}} A=\{a+a':a,a'\in A,\ a\ne a'\}$. We prove that a proper multiplicative subgroup $H\le\mathbb F_p^*$ cannot satisfy $H=A\mathbin{\widehat{+}} A$ whenever $|H|\ge7$, and that this threshold is sharp. In fact, such a decomposition exists precisely when $|H|\in\{1,3,6\}$, and we classify all decompositions in these exceptional cases. This gives a sharp, complete resolution of the restricted-sumset analogue of the generalized Sárközy conjecture over prime fields. This significantly extends and refines previous results of Shkredov and Yip.

math.NT↗

Additive decompositions of multiplicative subgroups via differential identities

We develop a local-to-global differential framework for additive decomposition problems involving multiplicative subgroups of prime fields. Starting from Hanson--Petridis-type auxiliary polynomials, we use degree bounds, in the spirit of Stepanov's method, to lift local coefficient relations at their roots to global differential identities. This yields a unified treatment of \[ H=A+B,\qquad H\cup\{0\}=A-A,\qquad H=A\mathbin{\widehat{+}} A,\qquad H\cup\{0\}=A\mathbin{\widehat{+}} A, \] where $H$ is a proper multiplicative subgroup. This circle of problems is motivated by Sárközy's conjecture on the additive irreducibility of nonzero quadratic residues and its generalizations to multiplicative subgroups. Rudnev and Tyrrell recently classified all decompositions $H=A+B$, building on the approach introduced by Hanson--Petridis and further developed by Kalmynin. Our framework gives a new polynomial proof of the Rudnev--Tyrrell classification and substantially streamlines the existing proofs: it gives an independent proof of Kalmynin's equal-size theorem and reduces the classification to direct coefficient comparisons, avoiding the residue-theoretic input and more elaborate arithmetic analysis of earlier proofs. It also yields a streamlined proof of Kalmynin's resolution of a conjecture of Lev and Sonn on $H\cup\{0\}=A-A$. For the two restricted-sumset problems, we obtain complete classifications, substantially improving earlier results of Shkredov and Yip. We also establish some stability refinements.

math.NT↗

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

math.AG↗

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA↗

Majorization and additive tuples in $\mathbb{Z}_2^n$

Majorization is a fundamental tool for comparing how "spread out" the entries of two vectors are. Key majorization results were obtained for the integers by Hardy, Littlewood and Pólya and for $\mathbb{Z}_p$ by Lev. In this paper, we establish a powerful majorization theorem in $\mathbb{Z}_2^n$ that is an analogue of Lev's result in $\mathbb{Z}_p$. Our proof is based on a novel use of a compression argument that optimizes certain sums of additive representation counts. Our majorization theorem has several applications in additive combinatorics. We resolve the question: given subsets $A_1,\ldots,A_k\subseteq\mathbb{Z}_2^n$ of prescribed sizes, when is the function $r_k(A_1,\ldots,A_k)$, which counts the number of additive $k$-tuples in $A_1\times\cdots\times A_k$, maximized? We establish the corresponding minimization result and a characterization of all extremizers for $r_k(A,\ldots,A)$ when $k$ is odd. When $k=3$, this quantity is the number of Schur triples in $A$; as a special case, we recover a theorem of Samotij and Sudakov on Schur triples. We also obtain a convexity inequality and use it to prove an analogue of Pollard's theorem that strengthens and extends a well-known result of Bollobás and Leader in the $\mathbb{Z}_2^n$ setting.

math.CO↗

The Prouhet--Tarry--Escott problem for subsets with small doubling in integral domains

The Prouhet--Tarry--Escott (PTE) problem has many generalizations and has been studied in various algebraic domains. In this paper, we prove that finite subsets $S$ of integral domains with small additive doubling constant (but still a power of $|S|$) always contain solutions to Wright's generalization of the PTE problem: there are small subsets $A$ and $B$ of the same size such that $\sum_{a\in A} a^j=\sum_{b\in B} b^j$ for $1\le j\le k$, but not for $j=k+1$. More generally, our method gives simultaneous solutions for $m$ systems, with pairwise distinct $(k+1)$-th power sums. In contrast with the classical case $S\subseteq [N]$, where the problem has been studied by Wooley and others using Vinogradov's mean value theorem, our approach is based on polynomial identities and additive properties of $S$. We also discuss barriers to extending these results to broader settings.

math.NT↗

Paley-type matrices and $1$-factorizations of complete graphs

Ball, Ortega--Moreno, and Prodromou asked two questions about 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. These problems are motivated by two natural compatibility conditions between $1$-factorizations and the sign patterns of certain Paley-type matrices. Recently, Afifurrahman et al. made some partial progress on the second problem. In this paper, we completely resolve both problems. We prove that the first problem has a solution precisely when $p\equiv3\pmod4$, while the second problem has a solution for every odd prime $p$. We also solve a further problem of Ball et al. for cyclic groups of odd order, and more generally for all finite abelian groups of odd order.

math.CO↗

Asymptotic Bounds on Generalized Covering Radii of Binary Primitive BCH Codes

Fix integers $e\ge2$ and $r\ge1$. In this paper we study the $r$-th generalized covering radius $ρ_r\left(BCH(e,m)\right)$ of the binary primitive $e$-error-correcting BCH code $BCH(e,m)$. By using an algebraic-geometric reformulation of the covering problem together with an explicit Lang-Weil estimate, we prove that \[ρ_r\bigl(\BCH(e,m)\bigr)\le(r+1)e-1\] for all sufficiently large $m$. For $e\ge7$, this improves a recent result of Belinsky--Zabokritskiy. Our proof gives a substantially simpler geometric approach to this upper bound. In particular it implies that \[ρ_2\bigl(BCH(e,m)\bigr)=3e-1\] for all sufficiently large $m$. Previously it was only known that \[ρ_2\bigl(\BCH(e,m)\bigr) \in \left\{3e-1,3e\right\}\] for all sufficiently large $m$.

cs.IT↗

Intersecting families and nonvanishing multivariate polynomials over finite fields

Let $\mathcal{P}_{n,d}$ be the space of polynomials in $n$ variables over $\mathbb{F}_q$ of degree at most $d$. Two polynomials $f,g\in\mathcal{P}_{n,d}$ intersect if $f(\mathbf a)=g(\mathbf a)$ for some $\mathbf a\in\mathbb{F}_q^n$. A star consists of all polynomials $f\in\mathcal{P}_{n,d}$ satisfying $f(\mathbf a)=b$ for fixed $\mathbf a\in\mathbb{F}_q^n$ and $b\in\mathbb{F}_q$. We completely classify the maximum intersecting families in $\mathcal{P}_{n,d}$. When $n=1$ and $d\geq 2$, it was previously shown that all maximum intersecting families are stars. We prove that the same conclusion holds for all $n\geq 2$ and $d\geq 2$ when $q$ is odd. When $q$ is even, however, the situation is more subtle, and a new phenomenon emerges: for $q\geq 4$, maximum non-star examples exist precisely when $d\leq n$. Along the way, we prove two further results of independent interest. First, we determine the span of nonvanishing polynomials in $\mathcal{P}_{n,d}$. Second, we characterize all linear functionals $Ψ\colon\mathcal{P}_{n,d}\to\mathbb{F}_q$ whose kernels are disjoint from the set of nonvanishing polynomials. The first result plays a crucial role in the proof of our main result; the second is a Gleason--Kahane--Żelazko theorem for polynomials of bounded degree over finite fields.

math.NT↗

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.

math.CO↗

Two-Distance Sets over Finite Fields

We study two-distance sets in standard $d$-dimensional quadratic spaces over finite fields. In characteristic $3$, we construct sets attaining the full Larman--Rogers--Seidel bound, showing that Blokhuis' Euclidean bound $\binom{d+2}{2}$ need not hold over finite fields. We prove a rank-sensitive replacement which precisely measures the failure of positive definiteness. We also show that the Blokhuis bound $\binom{d+2}{2}$ is attained over a suitable finite field exactly for each $d\neq6$; in the exceptional dimension $d=6$, the exact maximum is $27$.

math.CO↗