English
Related papers

Related papers: Hyperplane Sections of Determinantal Varieties ove…

200 papers

We study over a number field, the iterates of automorphisms of the affine space. More precisely, we are interested in the periodic and non-periodic points; for the former the questions are similar to the ones about torsion points on abelian…

Number Theory · Mathematics 2009-09-29 Sandra Marcello

We give divisibility results for the (global) characteristic varieties of hypersurface complements expressed in terms of the local characteristic varieties at points along one of the irreducible components of the hypersurface. As an…

Algebraic Topology · Mathematics 2019-02-14 Yongqiang Liu , Laurentiu Maxim

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

Information Theory · Computer Science 2020-12-02 P. G. Boyvalenkov , K. V. Delchev , D. V. Zinoviev , V. A. Zinoviev

In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define…

Information Theory · Computer Science 2024-06-21 Umberto Martínez-Peñas , Rubén Rodríguez-Ballesteros

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

Discrete Mathematics · Computer Science 2025-06-17 Jamolidin K. Abdurakhmanov

Let ${\mathbb F}_q$ be a finite field of characteristic two and ${\mathbb F}_q(X_1,...,X_n)$ a rational function field. We use matrix methods to obtain explicit transcendental bases of the invariant subfields of orthogonal groups and…

Commutative Algebra · Mathematics 2007-05-23 Zhongming Tang , Zhe-xian Wan

The paper contains an exposition of recent as well as old enough results on determinantal random point fields. We start with some general theorems including the proofs of the necessary and sufficient condition for the existence of the…

Probability · Mathematics 2015-06-26 Alexander Soshnikov

In this note we study standard and good determinantal schemes. We show that there exist arithmetically Cohen-Macaulay schemes that are not standard determinantal, and whose general hyperplane section is good determinantal. We prove that if…

Commutative Algebra · Mathematics 2007-08-13 Elisa Gorla

We give upper bounds on the number of exceptional radial projections of arbitrary subsets of vector spaces over finite fields. Our bounds do not depend on the dimension of the ambient space. Let $\mathbb{F}_q^d$ be the $d$-dimensional…

Combinatorics · Mathematics 2025-12-01 Paige Bright , Ben Lund , Thang Pham

We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by…

Information Theory · Computer Science 2018-01-30 Sudhir R. Ghorpade , Prasant Singh

The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…

Information Theory · Computer Science 2019-09-04 Yuri I. Manin , Matilde Marcolli

We study the Fano scheme of $k$-planes contained in the hypersurface cut out by a generic sum of products of linear forms. In particular, we show that under certain hypotheses, linear subspaces of sufficiently high dimension must be…

Algebraic Geometry · Mathematics 2019-11-25 Nathan Ilten , Hendrik Süß

We consider the five-vertex model on a finite square lattice with fixed boundary conditions such that the configurations of the model are in a one-to-one correspondence with the boxed plane partitions (3D Young diagrams which fit into a box…

Mathematical Physics · Physics 2021-02-23 Ivan N. Burenev , Andrei G. Pronko

A projective linear code over $\mathbb{F}_q$ is called $\Delta$-divisible if all weights of its codewords are divisible by $\Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications…

Combinatorics · Mathematics 2019-12-24 Daniel Heinlein , Thomas Honold , Michael Kiermaier , Sascha Kurz , Alfred Wassermann

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

Combinatorics · Mathematics 2021-10-29 C P Anil Kumar

Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…

Information Theory · Computer Science 2025-02-19 Sascha Kurz

Let X be a smooth complex irreducible projective variety of dimension $n \geq 2$ and $H$ be an ample line bundle on $X$. In this paper, we construct families of $\mu_H$-stable vector bundles on $X$ having fixed determinant and rank $r$,…

Algebraic Geometry · Mathematics 2026-02-19 Sonia Brivio , Federico Fallucca , Filippo F. Favale

For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least…

Number Theory · Mathematics 2020-07-23 Jun Zhang , Daqing Wan

Let $\mathbb{F}_q^d$ be the $d$-dimensional vector space over the finite field with $q$ elements. For a subset $E\subseteq \mathbb{F}_q^d$ and a fixed nonzero $t\in \mathbb{F}_q$, let $\mathcal{H}_t(E)=\{h_y: y\in E\}$, where $h_y$ is the…

We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of…

Logic in Computer Science · Computer Science 2025-04-30 Thomas Feller , Tim S. Lyon , Piotr Ostropolski-Nalewaja , Sebastian Rudolph