Related papers: Geometry of the Minimum Distance

Let $S$ be a polynomial ring over a field $K$, with a monomial order $\prec$, and let $I$ be an unmixed graded ideal of $S$. In this paper we study two functions associated to $I$: the minimum distance function $\delta_I$ and the footprint…

We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the…

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L (a)$ of…

The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value…

The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…

The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…

We study minimum degree conditions under which a graph $G$ contains $k$th powers of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of $G$ is large. This extends a result of Allen,…

The threshold-$k$ metric dimension ($\mathrm{Tmd}_k$) of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the graph, solely based on its distances from the sensors, when the…

In this paper we study the dual codes of a wide family of evaluation codes on norm-trace curves. We explicitly find out their minimum distance and give a lower bound for the number of their minimum-weight codewords. A general geometric…

We extend the construction of GAG codes to the case of evaluation codes. We estimate the minimum distance of these extended evaluation codes and we describe the connection to the one-point GAG codes.

In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…

This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes. We show that the minimum distance is multiplicative with respect to taking the product of polytopes, and behaves…

After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used…

Let $X$ be a finite set in the Euclidean space $\mathbb{R}^d$. If the squared distance between any two distinct points in $X$ is an odd integer, then the cardinality of $X$ is bounded above by $d+2$, as shown by Rosenfeld (1997) or Smith…

Let K be a non-archimedean field, and let f in K(z) be a rational function of degree d>1. If f has potentially good reduction, we give an upper bound, depending only on d, for the minimal degree of an extension L/K such that f is conjugate…

For an integer $k \ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G) \setminus S$ is at distance at most~$k$ from some vertex of $S$. The $k$-domination number,…

Given a metric pair $(X,A)$, i.e. a metric space $X$ and a distinguished closed set $A \subset X$, one may construct in a functorial way a pointed pseudometric space $\mathcal{D}_\infty(X,A)$ of persistence diagrams equipped with the…

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Let $\mathcal{A}$ be an abelian category. Denote by $\mathrm{D}^{b}(\mathcal{A})$ the bounded derived category of $\mathcal{A}$. In this paper, we investigate the lower bounds for the levels of objects in $\mathrm{D}^{b}(\mathcal{A})$ with…