Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jeck Lim

dblp:362/4082 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Combinatorics and discrete mathematics · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics
algebraic combinatorics
1.012026
Evasive sets, twisted varieties, and container-clique trees · SODA 2026
Combinatorics and discrete mathematics
extremal combinatorics
1.012026
Evasive sets, twisted varieties, and container-clique trees · SODA 2026
Combinatorics and discrete mathematics
graph containers
1.012026
Evasive sets, twisted varieties, and container-clique trees · SODA 2026

Methods — techniques the papers use, named apart from their topics

container method · 1.0algebraic geometry · 1.0
YearPublicationVenuePosition
2026 Evasive sets, twisted varieties, and container-clique trees
abstract
In the affine space \(\mathbb{F}_q^n\) over the finite field of order \(q\), a point set \(S\) is said to be \((d,k,r)\)-evasive if the intersection between \(S\) and any variety, of dimension \(k\) and degree at most \(d\), has cardinality less than \(r\). As \(q\) tends to infinity, the size of a \((d,k,r)\)-evasive set in \(\mathbb{F}_q^n\) is at most \(O(q^{n-k})\) by a simple averaging argument. We exhibit the existence of such evasive sets of sizes at least \(\Omega(q^{n-k})\) for much smaller values of \(r\) than previously known constructions, and establish an enumerative upper bound \(2^{O(q^{n-k})}\) for the total number of such evasive sets. The existence result is based on our study of twisted varieties. In the projective space \(\mathbb{P}^n\) over an algebraically closed field, a variety \(V\) is said to be \(d\)-twisted if the intersection between \(V\) and any variety of dimension \(n-\dim(V)\) and degree at most \(d\) has dimension zero. We prove an upper bound on the smallest possible degree of twisted varieties which is best possible in a mild sense. The enumeration result includes a new technique for the container method which we believe is of independent interest. To illustrate the potential of this technique, we give a simpler proof of a result by Chen–Liu–Nie–Zeng that characterizes the maximum size of a collinear-triple-free subset in a random sampling of \(\mathbb{F}_q^2\) up to polylogarithmic factors.
Jeck Lim, Jiaxi Nie, Ji Zeng
SODA1
2023 Fixing a Hole
David Conlon, Jeck Lim
Discret. Comput. Geom.2