English
Related papers

Related papers: Hyperplane Sections of Determinantal Varieties ove…

200 papers

We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…

Combinatorics · Mathematics 2016-04-26 Peter Beelen , Sudhir R. Ghorpade , Sartaj Ul Hasan

We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…

Information Theory · Computer Science 2023-12-25 Peter Beelen , Trygve Johnsen , Prasant Singh

We consider the question of determining the maximum number of $\mathbb{F}_q$-rational points that can lie on a hypersurface of a given degree in a weighted projective space over the finite field $\mathbb{F}_q$, or in other words, the…

Algebraic Geometry · Mathematics 2018-01-30 Yves Aubry , Wouter Castryck , Sudhir R. Ghorpade , Gilles Lachaud , Michael E. O'Sullivan , Samrith Ram

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum…

Combinatorics · Mathematics 2018-10-10 Peter Beelen , Prasant Singh

In this note, we study linear determinantal representations of smooth plane cubics over finite fields. We give an explicit formula of linear determinantal representations corresponding to rational points. Using Schoof's formula, we count…

Algebraic Geometry · Mathematics 2016-04-22 Yasuhiro Ishitsuka

We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…

Number Theory · Mathematics 2016-05-24 Yasuhiro Ishitsuka

We sharpen to nearly optimal the known asymptotic and explicit bounds for the number of $\mathbb{F}_q$-rational points on a geometrically irreducible hypersurface over a (large) finite field. The proof involves a Bertini-type probabilistic…

Algebraic Geometry · Mathematics 2024-06-04 Kaloyan Slavov

The study of linear codes over a finite field of odd cardinality, derived from determinantal varieties obtained from symmetric matrices of bounded rank, was initiated in a recent paper by the authors. There, one found the minimum distance…

Algebraic Geometry · Mathematics 2024-12-10 Peter Beelen , Trygve Johnsen , Prasant Singh

The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…

Information Theory · Computer Science 2023-10-19 Chao Liu , Dabin Zheng , Wei Lu , Xiaoqiang Wang

We study higher order determinantal varieties obtained by considering generic $m\times n$ ($m \le n$) matrices over rings of the form $F[t]/(t^k)$, and for some fixed $r$, setting the coefficients of powers of $t$ of all $r \times r$ minors…

Algebraic Geometry · Mathematics 2007-05-23 Tomaz Kosir , B. A. Sethuraman

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Commutative Algebra · Mathematics 2023-09-18 Ada Boralevi , Jasper van Doornmalen , Jan Draisma , Michiel E. Hochstenbach , Bor Plestenjak

The parameters of the AG codes on general linear groups are found. The hyperplane sections having the minimum (or maximum) number of rational points are determined.

Information Theory · Computer Science 2023-03-09 Mahir Bilen Can

In this paper we prove Homological Projective Duality for crepant categorical resolutions of several classes of linear determinantal varieties. By this we mean varieties that are cut out by the minors of a given rank of a n x m matrix of…

Algebraic Geometry · Mathematics 2016-04-12 Marcello Bernardara , Michele Bolognesi , Daniele Faenzi

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…

Algebraic Geometry · Mathematics 2009-03-31 Sudhir R. Ghorpade , Arunkumar R. Patil , Harish K. Pillai

In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…

Information Theory · Computer Science 2022-07-18 Tim L. Alderson , Alessandro Neri

In this paper we obtain explicit estimates and existence results on the number of $\mathbb{F}_q$-rational solutions of certain systems defined by families of diagonal equations over finite fields. Our approach relies on the study of the…

Number Theory · Mathematics 2020-10-07 Mariana Pérez , Melina Privitelli

For a projective curve $C\subset\mathbf{P}^n$ defined over $\mathbf{F}_q$ we study the statistics of the $\mathbf{F}_q$-structure of a section of $C$ by a random hyperplane defined over $\mathbf{F}_q$ in the $q\to\infty$ limit. We obtain a…

Number Theory · Mathematics 2019-04-02 Alexei Entin

Can a smooth plane cubic be defined by the determinant of a square matrix with entries in linear forms in three variables? If we can, we say that it admits a linear determinantal representation. In this paper, we investigate linear…

Number Theory · Mathematics 2017-02-28 Yasuhiro Ishitsuka

In this article, we study permanental varieties, i.e. varieties defined by the vanishing of permanents of fixed size of a generic matrix. Permanents and their varieties play an important, and sometimes poorly understood, role in…

Algebraic Geometry · Mathematics 2024-12-05 Ada Boralevi , Enrico Carlini , Mateusz Michałek , Emanuele Ventura

We study the number of hamiltonian circuits, containing a fixed basis, and the number of hyperplanes, which do not contain a fixed basis in perfect matroid designs. Projective and affine finite geometries are considered as examples of such…

Combinatorics · Mathematics 2013-05-15 Wojciech Kordecki
‹ Prev 1 2 3 10 Next ›