Related papers: Linear codes arising from the point-hyperplane geo…
We give one more proof of the first linear programming bound for binary codes, following the line of work initiated by Friedman and Tillich. The new argument is somewhat similar to previous proofs, but we believe it to be both simpler and…
In this paper, we study how simple linear projections of some projective varieties behave when the projection center runs through the ambient space. More precisely, let $X \subset \P^r$ be a projective variety satisfying Green-Lazarsfeld's…
In this paper we study the algebraic-geometry of any one-point code on the Hermitian curve. Moreover, we characterize the minimum-weight codewords of some of their dual codes and describe many their small-weight codewords.
We start from a new theory (discussed earlier) in which the arena for physics is not spacetime, but its straightforward extension-the so called Clifford space ($C$-space), a manifold of points, lines, areas, etc..; physical quantities are…
In this short survey we concern ourselves with minimal codes, a classical object in coding theory. We will explain the relation between minimal codes and various other mathematical domains, in particular with finite projective geometry.…
We present a unified method of construction of surfaces associated with Grassmannian sigma models, expressed in terms of an orthogonal projector. This description leads to compact formulae for structural equations of two-dimensional…
Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric…
We introduce a binary embedding framework, called Proximity Preserving Code (PPC), which learns similarity and dissimilarity between data points to create a compact and affinity-preserving binary code. This code can be used to apply fast…
A straight-line drawing $\Gamma$ of a graph $G=(V,E)$ is a drawing of $G$ in the Euclidean plane, where every vertex in $G$ is mapped to a distinct point, and every edge in $G$ is mapped to a straight line segment between their endpoints. A…
We prove a descriptive theorem on the extrinsic geometry of an embedded minimal surface of injectivity radius zero in a homogeneously regular Riemannian three-manifold, in a certain small intrinsic neighborhood of a point of almost-minimal…
This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with…
We study some graded geometric constructions appearing naturally in the context of gauge theories. Inspired by a known relation of gauging with equivariant cohomology we generalize the latter notion to the case of arbitrary Q-manifolds…
We study the two-dimensional twisted (0,2) sigma-model on various smooth complex flag manifolds G/B, and explore its relevance to the geometric Langlands program. We find that an equivalence - at the level of the holomorphic chiral algebra…
We investigate a fundamental vertex-deletion problem called (Induced) Subgraph Hitting: given a graph $G$ and a set $\mathcal{F}$ of forbidden graphs, the goal is to compute a minimum-sized set $S$ of vertices of $G$ such that $G-S$ does…
There exists a bijection between the configuration space of a linear pentapod and all points $(u,v,w,p_x,p_y,p_z)\in\mathbb{R}^{6}$ located on the singular quadric $\Gamma: u^2+v^2+w^2=1$, where $(u,v,w)$ determines the orientation of the…
Given a complex Hilbert space H, we study the differential geometry of the manifold M of all projections in V:=L(H). Using the algebraic structure of V, a torsionfree affine connection $\nabla$ (that is invariant under the group of…
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…
In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…
We study symplectic minimal resolutions of weighted projective planes $\mathbb{CP}(a,b,c)$ from the perspective of disconnected symplectic divisors with symplectic log Kodaira dimension $-\infty$. Building on the techniques developed in our…
We show that for any simple closed curve in the sphere at infinity of a Gromov hyperbolic 3-space with cocompact metric, there exist a properly embedded least area plane in the space spanning the given curve. This gives a positive answer to…