Related papers: Linear codes arising from the point-hyperplane geo…

Synthetic algebraic geometry is a new approach to algebraic geometry. It consists in using homotopy type theory extended with three axioms, together with the interpretation of these in a higher version of the Zariski topos, in order to do…

We study the problem of finding generators for the fundamental group G of a space of the following sort: one removes a family of complex hyperplanes from n dimensional complex vector space, or n dimensional complex hyperbolic space, or the…

There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…

Pseudo-Riemannian metrics with Levi-Civita connection in the projective class of a given torsion free affine connection can be obtained from (and are equivalent to) the maximal rank solutions of a certain overdetermined projectively…

It is known that some good linear codes over a finite ring (R-linear codes) arise from interesting point constellations in certain projective geometries. For example, the expurgated Nordstrom-Robinson code, a nonlinear binary [14,6,6]-code…

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…

We prove that there is a randomized polynomial-time algorithm that given an edge-weighted graph $G$ excluding a fixed-minor $Q$ on $n$ vertices and an accuracy parameter $\varepsilon>0$, constructs an edge-weighted graph~$H$ and an…

We view all smooth metrics $g$ on a closed surface $\Sigma$ through their Nash isometric embeddings $f_g: (\Sigma,g) \rightarrow (\mathbb{S}^{\tilde{n}}, \tilde{g})$ into a standard sphere of large, but fixed, dimension $\tilde{n}$. We…

Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…

We study structures of embedded projective manifolds swept out by cubic varieties. We show if an embedded projective manifold is swept out by high-dimensional smooth cubic hypersurfaces, then it admits an extremal contraction which is a…

There has been recent interest in the study of shortest self-orthogonal embeddings of binary linear codes, since many such codes are optimal self-orthogonal codes. Several authors have studied the length of a shortest self-orthogonal…

We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of…

Projective metrics on vector spaces over finite fields, introduced by Gabidulin and Simonis in 1997, generalize classical metrics in coding theory like the Hamming metric, rank metric, and combinatorial metrics. While these specific metrics…

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

Let $Gr(d,n)$ be the Grassmannian of $d$-dimensional linear subspaces of an $n$-dimensional vector space $V$. A submanifold $X\subset Gr(d, n)$ gives rise to a differential system $\Sigma(X)$ that governs $d$-dimensional submanifolds of $V$…

The Grassmannian is an important object in Algebraic Geometry. One of the many techniques used to study the Grassmannian is to build a vector space from its points in the projective embedding and study the properties of the resulting linear…

$\lambda$-self-expanders $\Sigma$ in $\mathbb{R}^{n+1}$ are the solutions of the isoperimetric problem with respect to the same weighted area form as in the study of the self-expanders. In this paper, we mainly extend the results on…

The projective general linear group $\mathrm{PGL}_2(\mathrm{GF}(2^m))$ acts as a $3$-transitive permutation group on the set of points of the projective line. The first objective of this paper is to prove that all linear codes over…

Let PG$(r, q)$ be the $r$-dimensional projective space over the finite field ${\rm GF}(q)$. A set $\cal X$ of points of PG$(r, q)$ is a cutting blocking set if for each hyperplane $\Pi$ of PG$(r, q)$ the set $\Pi \cap \cal X$ spans $\Pi$.…

We study generalizations of classical metric embedding results to the case of quasimetric spaces; that is, spaces that do not necessarily satisfy symmetry. Quasimetric spaces arise naturally from the shortest-path distances on directed…