🔢 mathematics

Functional codes arising from rank $n$ Hermitian varieties and hypersurfaces in low dimensions

This paper establishes an upper bound for the intersection of rank $n$ degenerate Hermitian varieties with hypersurfaces of degree at most $q$ to determine the parameters and characterize the minimum-distance hypersurfaces of the associated functional codes for dimensions $n=2, 3, 4$ .

Original authors: Subrata Manna

Published 2026-05-25

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Subrata Manna

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

Imagine you are a master architect working in a strange, high-dimensional universe called Finite Geometry. In this universe, everything is built on a grid made of a specific number of points (determined by a number $q$ ).

This paper is about designing a special kind of security system (called a "functional code") that relies on the shapes found in this universe. The author, Subrata Manna, is trying to figure out exactly how strong this security system is when the shapes involved are a specific type of "broken" or "degenerate" structure known as a Hermitian variety.

Here is the breakdown of the paper's journey, using simple analogies:

1. The Setting: The "Broken" Pyramid

In this paper, the main character is a shape called a Rank $n$ Hermitian Variety (denoted as $PUn-1$).

The Analogy: Imagine a perfect, smooth pyramid. Now, imagine you push the tip of the pyramid down until it touches the base, creating a "cone" shape where all the lines meet at a single point at the top (the vertex $P$ ).
The Problem: This cone shape is "degenerate." It's not a smooth, perfect object; it has a singular point where everything collapses. The paper studies what happens when you try to slice this cone with other shapes.

2. The Challenge: The "Slice" (Hypersurfaces)

To build the security code, you need to know how many points of this cone can be "hit" or "covered" by a slicing tool.

The Slicing Tool: This tool is a hypersurface (a multi-dimensional sheet) of a certain "degree" (think of degree as the complexity or "curviness" of the sheet).
The Goal: The author wants to find the maximum number of points where the cone and the slice overlap.
- Why? In coding theory, the "strength" of the code depends on how few points a slice can hit. If a slice hits too many points, the code is weak. If it hits very few, the code is strong. To know the strength, you must first know the worst-case scenario (the maximum overlap).

3. The Investigation: Counting the Overlaps

The paper acts like a detective solving a puzzle for different sizes of the universe (dimensions $n = 2, 3, 4$ ).

Dimension 2 (The Flat Plane):
The cone is just a bunch of lines meeting at a point. The author proves that if you draw a curve (the slice) on this plane, the maximum number of lines it can cross is predictable. It turns out the worst-case scenario is when your curve is just a bunch of straight lines all passing through the same spot.
Dimension 3 (The 3D Space):
Now the cone is a 3D object. The author asks: "If I slice this 3D cone with a curved surface, what is the most points I can hit?"
- The Discovery: The maximum happens when the slice is a "cone" itself, made of flat planes that all touch the original cone in a very specific way (like a fan of pages in a book all hinged at the same point). The author calculates the exact number of points for this worst-case scenario.
Dimension 4 (The 4D Space):
This gets even more complex. The author uses a famous mathematical "rule of thumb" (Sørensen's bound) to estimate the maximum overlap. They prove that for certain sizes, the worst-case slice is a collection of flat planes that are all "tangent" (touching gently) to the underlying shape, meeting at a common line.

4. The Result: Building the Code

Once the author knows the maximum number of points a slice can hit, they can build the Functional Code.

The Code's "Length": This is simply the total number of points on the cone.
The Code's "Dimension": This is how much information you can store.
The Code's "Minimum Distance" (The Strength): This is the most important part. It is calculated by taking the total points and subtracting the maximum overlap found in the previous steps.
- Simple Math: If the cone has 100 points, and the worst slice hits 80, the code's strength is 20. The paper calculates this exact "strength" for dimensions 2, 3, and 4.

5. The Big Picture

The paper doesn't just guess; it provides rigorous proofs.

It establishes a general upper bound (a safety ceiling) for how many points can be hit in any dimension.
It then solves the puzzle completely for dimensions 2, 3, and 4, telling us exactly what the "worst-case slices" look like.
It notes that for dimensions 5 and higher, the puzzle is still partially unsolved (a "conjecture" exists, but it hasn't been fully proven for all complex shapes).

Summary

In everyday terms, this paper is about measuring the vulnerability of a specific geometric shape (a cone-like structure in a finite world) when it is sliced by various tools. By finding the "worst-case" slice, the author determines exactly how robust a data-coding system built on this shape would be. The paper successfully solves this for small dimensions (2, 3, and 4), providing the exact formulas needed to design these codes.

Technical Summary: Functional Codes from Rank $n$ Hermitian Varieties

Problem Statement
The paper investigates the parameters of functional codes, denoted $C_d(X)$ , introduced by G. Lachaud, where the underlying variety $X$ is a rank $n$ degenerate Hermitian variety, specifically denoted as $PUn_{-1}$ , within the projective space $\mathbb{P}^n(\mathbb{F}_{q^2})$ . The study focuses on the case where the degree $d$ of the defining homogeneous polynomials satisfies $d \leq q$ . The primary challenge addressed is determining the length, dimension, and minimum distance of these codes. The minimum distance is intrinsically linked to the maximum number of $\mathbb{F}_{q^2}$ -rational points in the intersection of the degenerate Hermitian variety $PUn_{-1}$ with an $\mathbb{F}_{q^2}$ -hypersurface of degree $d$ . While the parameters for non-degenerate Hermitian varieties are well-established for specific degrees, the structure of codes arising from degenerate varieties (cones over non-degenerate bases) requires distinct analysis.

Methodology
The author employs a combination of algebraic geometry and combinatorial coding theory. The methodology proceeds through the following steps:

Geometric Decomposition: The degenerate Hermitian variety $PUn_{-1}$ is characterized as a cone with a vertex at an $\mathbb{F}_{q^2}$ -rational point $P$ and a base consisting of a non-degenerate Hermitian variety $Un_{-1}$ in a hyperplane.
Intersection Analysis: The core of the work involves deriving an upper bound for $|PUn_{-1} \cap V(F)(\mathbb{F}_{q^2})|$ , where $V(F)$ is a hypersurface of degree $d \leq q$ . The proof distinguishes cases based on whether the vertex $P$ lies on the hypersurface $V(F)$ and whether $V(F)$ contains hyperplanes passing through or avoiding $P$ .
Inductive and Case-Specific Characterization: For general $n$ $n$ , the problem is reduced to evaluating $M_{n-1}(d)$ $M_{n - 1} (d)$ , the maximum intersection size between a non-degenerate Hermitian variety $Un_{-1}$ $U n_{- 1}$ and a hypersurface of degree $d$ $d$ . The paper explicitly characterizes the hypersurfaces attaining these maximums for dimensions $n=2, 3, 4$ $n = 2, 3, 4$ .
- For $n=2$ and $n=3$ , the author utilizes Serre's inequality and specific geometric properties of lines and planes relative to Hermitian curves and surfaces.
- For $n=4$ , the analysis relies on Sørensen's bound for the intersection of surfaces and non-degenerate Hermitian surfaces in $\mathbb{P}^3$ , extending these results to the cone structure.
Code Parameter Derivation: Using the established intersection bounds, the author proves the injectivity of the evaluation map for $d \leq q$ (ensuring the dimension is the full space of polynomials) and calculates the minimum distance by subtracting the maximum intersection size from the total number of rational points on the variety.

Key Contributions and Results
The paper provides the following specific results:

General Upper Bound: An upper bound for the number of rational points in the intersection of $PUn_{-1}$ and a hypersurface of degree $d \leq q$ is established as:
$\max \left\{ |Un_{-1}(\mathbb{F}_{q^2})| + (d-1)(q+1)q^{2n-4}, \quad 1 + q^2 M_{n-1}(d) \right\}$
where $M_{n-1}(d)$ is the maximum intersection size for the non-degenerate base variety.
Characterization of Extremal Hypersurfaces:
- Case $n=2$ : The maximum intersection is $dq^2 + 1$ , attained if and only if the curve is a union of $d$ lines contained in the cone.
- Case $n=3$ : The maximum intersection is $1 + q^2d(q+1)$ . The paper characterizes the attaining surfaces as cones over curves $C$ such that $|C \cap Un_{-1}| = d(q+1)$ .
- Case $n=4$ : The maximum intersection is $1 + q^2(d(q^3 + q^2 - q) + q + 1)$ . The attaining threefolds are characterized as unions of lines passing through the vertex $P$ , specifically related to tangent planes of the base surface.
Code Parameters: The paper explicitly determines the parameters $[m, k, d_{min}]_{q^2}$ $[m, k, d_{min}]_{q^{2}}$ for the codes $C_d(PUn_{-1})$ $C_{d} (P U n_{- 1})$ for $n=2, 3, 4$ $n = 2, 3, 4$ :
- $n=2$ : $m = q^3 + q^2 + 1$ , $k = \binom{2+d}{d}$ , $d_{min} = q^3 - (d-1)q^2$ .
- $n=3$ : $m = q^5 + q^2 + 1$ , $k = \binom{3+d}{d}$ , $d_{min} = q^2(q^3 - dq - (d-1))$ .
- $n=4$ : $m = q^7 + q^5 + q^4 + q^2 + 1$ , $k = \binom{4+d}{d}$ , $d_{min} = q^7 - (d-1)q^3(q^2 + q - 1)$ .
Injectivity: It is proven that for $d \leq q$ , the evaluation map is injective, meaning the dimension of the code is exactly the dimension of the space of homogeneous polynomials of degree $d$ .

Significance
The paper contributes to the understanding of functional codes associated with degenerate algebraic varieties, a class less explored than their non-degenerate counterparts. By establishing precise bounds on rational point intersections and characterizing the geometric structures (hypersurfaces) that achieve these bounds in low dimensions ( $n=2,3,4$ ), the work fills a gap in the literature regarding the parameters of codes derived from rank $n$ Hermitian varieties. The results provide a complete description of the code parameters for these specific cases, linking the geometric properties of the intersection of cones and hypersurfaces directly to the error-correcting capabilities (minimum distance) of the resulting codes. The paper acknowledges that for $n \geq 5$ , the problem reduces to determining $M_{n-1}(d)$ , which remains an open problem for $d \geq 4$ , referencing existing conjectures (Conjecture 1) in the field.