Related papers: Two-Point Codes for the Generalized GK curve
In this paper we state two quantitative Sylvester-Gallai results for high degree curves. Moreover we give two constructions which show that these results are not trivial.
We construct families of locally recoverable codes with availability $t\geq 2$ using fiber products of curves, determine the exact minimum distance of many families, and prove a general theorem for minimum distance of such codes. The paper…
Given a graph pair $(G^1, G^2)$, graph edit distance (GED) is defined as the minimum number of edit operations converting $G^1$ to $G^2$. GED is a fundamental operation widely used in many applications, but its exact computation is NP-hard,…
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…
Let $\mathbb{K}$ be an algebraically closed field. In this paper, we consider the class of smooth plane curves of degree $n+1>3$ over $\mathbb{K}$, containing three points, $P_1,P_2,$ and $P_3$, such that $nP_1+P_2$, $nP_2+P_3$, and…
This note is devoted to the study of sets of finite perimeter over RCD$(K,N)$ metric measure spaces. Its aim is to complete the picture about the generalization of De Giorgi's theorem within this framework. Starting from the results of [2]…
A criterion for the existence of a birational embedding with two Galois points for quotient curves is presented. We apply our criterion to several curves, for example, some cyclic subcovers of the Giulietti-Korchmaros curve or of the curves…
We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that $2$-respects (cuts two edges of) a spanning tree $T$ of a graph $G$. This procedure can be used in place of the…
We study a number of multi-route cut problems: given a graph G=(V,E) and connectivity thresholds k_(u,v) on pairs of nodes, the goal is to find a minimum cost set of edges or vertices the removal of which reduces the connectivity between…
A vertex coloring of a graph $G$ is said to be a 2-distance coloring if any two vertices at distance at most $2$ from each other receive different colors, and the least number of colors for which $G$ admits a $2$-distance coloring is known…
In this paper we consider adjoint restriction estimates for space curves with respect to general measures and obtain optimal estimates when the curves satisfy a finite type condition. The argument here is new in that it doesn't rely on the…
We give an improved upper bound for the Gr\"unbaum--Hadwiger--Ramos problem: Let $d,n,k \in \mathbb{N}$ such that $d \geq 2^n(1+2^{k-1})$. Given $2^{n+1}$ masses on $\mathbb{R}^d$, there exist $k$ hyperplanes in $\mathbb{R}^d$ that…
This paper is concerned with the construction of algebraic geometric codes defined from Kummer extensions. It plays a significant role in the study of such codes to describe bases for the Riemann-Roch spaces associated with totally ramified…
We use a map to quantum error-correcting codes and a subspace projection to get lower bounds for minimal homological distances in a tensor product of two chain complexes of vector spaces over a finite field. Homology groups of such a…
Working over an algebraically closed field of arbitrary characteristic we study, for integers $N\geq 2$ and $g\geq 2$, the set of points of order dividing $N$ lying on an irreducible smooth proper curve of genus $g$ embedded in its jacobian…
This paper revisits the 2-approximation algorithm for $k$-MST presented by Garg in light of a recent paper of Paul et al.. In the $k$-MST problem, the goal is to return a tree spanning $k$ vertices of minimum total edge cost. Paul et al.…
In this article we use techniques from coding theory to derive upper bounds for the number of rational places of the function field of an algebraic curve defined over a finite field. The used techniques yield upper bounds if the…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
A 2-distance $k$-coloring of a graph $G$ is a proper $k$-coloring such that any two vertices at distance two or less get different colors. The 2-distance chromatic number of $G$ is the minimum $k$ such that $G$ has a 2-distance…
In this work we determine the so-called minimal generating set of the Weierstrass semigroup of certain $m$ points on curves $\mathcal{X}$ with plane model of the type $f(y) = g(x)$ over $\mathbb{F}_{q}$, where $f(T),g(T)\in…