← Latest papers
🔢 mathematics

An Exact Counting Formula for the Mutual Position of Two Plane Conics

This paper presents an exact counting formula for the number of points in P2(Fq)\mathbb{P}^2(\mathbb{F}_q) classified by their internal or external positions relative to two transversally intersecting smooth plane conics, refining previous asymptotic estimates by linking the counts to Frobenius traces of associated elliptic curves and the intersection properties of the conics and their duals.

Original authors: Tianhao Wang

Published 2026-08-25
📖 4 min read🧠 Deep dive

Original authors: Tianhao Wang

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the vast landscape of mathematics, there is a branch dedicated to counting things that exist within specific, finite worlds. Imagine a grid made of dots, but instead of stretching on forever, it stops and loops back on itself, creating a closed universe with a fixed number of points. In this finite world, drawn over a field of numbers where the count is an odd prime, mathematicians study shapes called conics. These are smooth, curved lines that look like circles, ellipses, or hyperbolas, but they exist within this limited grid. A key feature of these shapes is how other points in the grid relate to them. Some points sit outside the curve, and from their position, you can draw two distinct lines that just touch the curve without cutting through it. Other points sit inside, where any line you draw through them cuts the curve, and the lines that would just touch the curve exist only in a slightly larger, imaginary version of the grid. This distinction between being inside and outside is fundamental to understanding the geometry of these finite spaces.

For years, mathematicians have been interested in what happens when two of these curved shapes share the same space. Specifically, they wanted to know how many points in the grid are inside one curve but outside the other, or outside both, or inside both. Previous work had provided a rough guess for these numbers, suggesting that the count was roughly a quarter of the total points in the grid, with a margin of error that grew as the grid got larger. This estimate was good enough for a general idea, but it left a significant gap in precision. The question remained: could we find an exact number, not just an approximation, for how these points are distributed?

A recent paper by Tianhao Wang answers this question with a precise formula. The author developed a method to count exactly how many points in the grid fall into each of the four possible categories relative to two intersecting curves. The breakthrough relies on a clever geometric trick. Instead of trying to count every single point in the entire grid at once, the researcher looked at the problem through the lens of the lines that touch the first curve. Every point outside the first curve lies on exactly two of these touching lines. By focusing on these lines, the problem transforms from a two-dimensional counting task into a series of one-dimensional problems along each line.

The researcher found that the behavior of these lines as they cross the second curve is governed by two special, hidden shapes known as elliptic curves. These are not the same as the original curved lines; they are more complex mathematical objects that act as a kind of control mechanism for the counting process. The exact number of points in each category depends on a specific property of these two hidden shapes, known as their "trace," which measures how many points they contain in the finite grid. The final formula combines the total size of the grid, the number of times the two original curves cross each other, the number of times their "dual" versions cross, and the traces of these two hidden elliptic curves.

The result is a set of exact equations that replace the old, rough estimates. The new formula shows that the error in the previous guesses was larger than necessary. While earlier methods suggested the error could grow quite large as the grid expanded, this new exact count proves the error is much smaller, growing only linearly with the size of the grid rather than faster. This precision is achieved because the method isolates the problem to a specific family of lines, effectively stripping away the complexity that usually makes such counts difficult. The paper also notes that while this approach works beautifully for flat, two-dimensional curves, it becomes significantly harder to apply to shapes in higher dimensions, where the simple relationship between lines and points breaks down.

Ultimately, this work provides a complete and exact map of the mutual positions of two smooth curves in a finite plane. It moves the field from making educated guesses about the distribution of points to knowing the exact count with certainty. By linking the visible geometry of the curves to the hidden arithmetic of elliptic curves, the researcher has turned a problem of estimation into a problem of exact calculation, offering a clearer and more precise understanding of how these shapes interact in the finite world.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →