Related papers: Hyperplane Sections of Determinantal Varieties ove…
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…
In this short note, we will gives several remarks on rational points of varieties whose cotangent bundles are generated by global sections. For example, we will show that if the sheaf of differentials of a projective variety X over a number…
Let $\mathbb{F}_q$ be a finite field with $q=p^n$ elements. In this paper, we study the number of $\mathbb{F}_q$-rational points on the affine hypersurface $\mathcal X$ given by $a_1 x_1^{d_1}+\dots+a_s x_s^{d_s}=b$, where…
We prove that if a subset of a $d$-dimensional vector space over a finite field with $q$ elements has more than $q^{d-1}$ elements, then it determines all the possible directions. If a set has more than $q^k$ elements, it determines a…
In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…
We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…
The set of all subspaces of $\mathbb{F}_q^n$ is denoted by $\mathbb{P}_q(n)$. The subspace distance $d_S(X,Y) = \dim(X)+ \dim(Y) - 2\dim(X \cap Y)$ defined on $\mathbb{P}_q(n)$ turns it into a natural coding space for error correction in…
A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…
The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…
We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…
We study algebraic geometry linear codes defined by linear sections of the Grassmannian variety as codes associated to FFN$(1,q)$-projective varieties. As a consequence, we show that Schubert, Lagrangian-Grassmannian, and isotropic…
We give a complete conjectural formula for the number $e_r(d,m)$ of maximum possible ${\mathbb{F}}q$-rational points on a projective algebraic variety defined by $r$ linearly independent homogeneous polynomial equations of degree $d$ in…
Ballico proved that a smooth projective variety $X$ of degree $d$ over a finite field of $q$ elements admits a smooth hyperplane section if $q\geq d(d-1)^{\dim X}$. In this paper, we refine this criterion for higher codimensional linear…
We use three different methods to count the number of lines in the plane whose intersection with a fixed general quintic has fixed cross-ratios. We compare and contrast these methods, shedding light on some classical ideas which underly…
There are close relations between tripartite tensors with bounded geometric ranks and linear determinantal varieties with bounded codimensions. We study linear determinantal varieties with bounded codimensions, and prove upper bounds of the…
We study the cohomology of the generic determinantal varieties $M_{m,n}^s = \{ \varphi \in \mathbb C^{m\times n} : \mathrm{rank} \varphi <s \}$, their polar multiplicities, their sections $D_k \cap M_{m,n}^s$ by generic hyperplanes $D_k$ of…
This article studies the scheme structure of the jet schemes of determinantal varieties. We show that in general, these jet schemes are not irreducible. In the case of the determinantal variety $X$ of $r \times s$ matrices of rank at most…
We describe the Hilbert scheme components parametrizing lines and conics on the space of determinantal nets of conics, N. As an application, we use the quantum Lefschetz hyperplane principle to compute the instanton numbers of rational…
We revisit and extend the connections between $\mathbb{F}_{q^m}$-linear rank-metric codes and evasive $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We give a unifying framework in which we prove in an elementary way how the parameters…
The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\mathbb{F}_q$-linear rank-metric code over $\mathbb{F}_q^{m \times n}$ of rate $R =…