Related papers: Functional codes arising from rank $n$ Hermitian v…

Given a smooth cubic hypersurface $X$ over a finite field of characteristic greater than 3 and two generic points on $X$, we use a function field analogue of the Hardy-Littlewood circle method to obtain an asymptotic formula for the number…

We determine the number of ${\mathbb{F}}_q$-rational points of hyperplane sections of classical determinantal varieties defined by the vanishing of minors of a fixed size of a generic matrix, and identify sections giving the maximum number…

We define a linear code $C_\eta(\delta_T,\delta_X)$ by evaluating polynomials of bidegree $(\delta_T,\delta_X)$ in the Cox ring on $\mathbb{F}_q$-rational points of the Hirzebruch surface of parameter $\eta$ on the finite field…

Using a two-dimensional version of the delta method, we establish an asymptotic formula for the number of rational points of bounded height on non-singular complete intersections of cubic and quadric hypersurfaces of dimension at least $23$…

We give an upper-bound for the $X$-rank of points with respect to a non-degenerate irreducible variety $X$ in the case that sub-generic $X$-rank points generate a hypersurface. We give examples where this bound is sharp and it improves the…

Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual…

A function field over a finite field is called maximal if it achieves the Hasse-Weil bound. Finding possible genera that maximal function fields achieve has both theoretical interest and practical applications to coding theory and other…

We study permutation-invariant quantum codes in the symmetric subspace $\mathrm{Sym}^n(\mathbb{C}^q) $ of $n$ qudits of local dimension $q$. For every integer $q\geq 2$, we construct a permutation-invariant code with parameters…

Shape matching is a fundamental problem in computer graphics with many applications. Functional maps translate the point-wise shape-matching problem into its functional counterpart and have inspired numerous solutions over the last decade.…

Functionality ($\mathrm{fun}$) is a graph parameter that generalizes graph degeneracy defined by Alecu et al. [JCTB, 2021]. They research the relation of functionality to many other graphs parameters (tree-width, clique-width, VC-dimension,…

Existence of quantum low-density parity-check (LDPC) codes whose minimal distance scales linearly with the number of qubits is a major open problem in quantum information. Its practical interest stems from the need to protect information in…

Functional and linear-algebraic approaches to the Delsarte problem of upper bounds on codes are discussed. We show that Christoffel-Darboux kernels and Levenshtein polynomials related to them arise as stationary points of the moment…

Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one…

A smooth hypersurface over a finite field $\mathbb{F}_q$ is called Frobenius nonclassical if the image of every geometric point under the $q$-th Frobenius endomorphism remains in the unique hyperplane tangent to the point. In this paper, we…

Let $X$ be a curve of genus $g\geq 2$ over a number field $F$ of degree $d = [F:Q]$. The conjectural existence of a uniform bound $N(g,d)$ on the number $\#X(F)$ of $F$-rational points of $X$ is an outstanding open problem in arithmetic…

We prove some basic theorems concerning lemniscate configurations in an Euclidean space of dimension $ n \geq 3$. Lemniscates are defined as follows. Given m points $w_j $ in $\mathbb R^n$, consider the function $F(x)$ which is the product…

Building on work by Chabauty from 1941, Coleman proved in 1985 an explicit bound for the number of rational points of a curve $C$ of genus $g\ge 2$ defined over a number field $F$, with Jacobian of rank at most $g-1$. Namely, in the case…

Given any ${\bf{a}}: = \left( {a_1 ,a_2 , \ldots ,a_n } \right)$ and ${\bf{b}}: = \left( {b_1 ,b_2 , \ldots ,b_n } \right)$ in $\mathbb{R}^n$. The $\textbf{n}$-fold convex function defined on $\left[ {{\bf{a}},{\bf{b}}} \right]$,…

We study projective varieties $X \subset \mathbb{P}^r$ of dimension $n \geq 2$, of codimension $c \geq 3$ and of degree $d \geq c + 3$ that are of maximal sectional regularity, i.e. varieties for which the Castelnuovo-Mumford regularity…

We introduce the first example of algebraically constructed hierarchical quasi-cyclic codes. These codes are built from Reed-Solomon codes using a 1964 construction of superimposed codes by Kautz and Singleton. We show both the number of…