Related papers: Coset bounds for algebraic geometric codes
A complex spherical code is a finite subset on the unit sphere in $\mathbb{C}^d$. A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed inner products. In this paper, we determine the irreducible…
We present a new criterion for the complex hyperbolicity of a non-compact quotient X of a bounded symmetric domain. For each p $\ge$ 1, this criterion gives a precise condition under which the subvarieties V $\subset$ X with dim V $\ge$ p…
In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a…
We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower…
We establish the existence of positive solutions to a general class of overdetermined semilinear elliptic boundary problems on suitable bounded open sets $\Omega\subset\mathbb{R}^n$. Specifically, for $n\leq 4$ and under mild technical…
We prove a complexity lower bound on deciding membership in a semialgebraic set for arithmetic networks in terms of the sum of Betti numbers with respect to "ordinary" (singular) homology. This result complements a similar lower bound by…
We show that the topological complexity of an aspherical space $X$ is bounded below by the cohomological dimension of the direct product $A\times B$, whenever $A$ and $B$ are subgroups of $\pi_1(X)$ whose conjugates intersect trivially. For…
A uniform bound of intersection multiplicities of curves and divisors on abelian varieties is proved by algebraic geometric methods. It extends and improves a result obtained by A. Buium with a different method based on Kolchin's…
The Hasse-Weil-Serre bound is improved for curves of low genera over finite fields with discriminant in {-3,-4,-7,-8,-11,-19} by studying optimal curves.
On a weighted projective surface $\mathbb{P}(a,b,c)$ with $\min(a,b,c)\leq 4$, we compute lower bounds for the {\em effective threshold} of an ample divisor, in other words, the highest multiplicity a section of the divisor can have at a…
The Geil-Matsumoto bound (GM bound) constrains the number of rational points on a curve over a finite field in terms of the Weierstrass semigroup of any of the points on the curve. For general numerical semigroups, the GM bound lacks a…
Let $H$ be a non trivial subgroup of index $d$ of a free group $G$ and $N$ the normal closure of $H$ in $G$. The coset organization in a subgroup $H$ of $G$ provides a group $P$ of permutation gates whose common eigenstates are either…
We give an algorithmic and lower-bound framework that facilitates the construction of subexponential algorithms and matching conditional complexity bounds. It can be applied to intersection graphs of similarly-sized fat objects, yielding…
We study the arithmetic self-intersection number of the dualizing sheaf on arithmetic surfaces with respect to morphisms of a particular kind. We obtain upper bounds for the arithmetic self-intersection number of the dualizing sheaf on…
We extend coded distributed computing over finite fields to allow the number of workers to be larger than the field size. We give codes that work for fully general matrix multiplication and show that in this case we serendipitously have…
We present new constructions of quasi-cyclic (QC) and generalized quasi-cyclic (GQC) codes from algebraic curves. Unlike previous approaches based on elliptic curves, our method applies to curves that are Kummer extensions of the rational…
We study lower bounds for the self-intersection of the canonical divisor of "canonical varieties" (i.e. varieties whose canonical linear system gives a birational map). We give some improvements for the known results in the case of surfaces…
The problems of determining the minimum-sized \emph{identifying}, \emph{locating-dominating} and \emph{open locating-dominating codes} of an input graph are special search problems that are challenging from both theoretical and…
We classify completely the intersections of the Hermitian curve with parabolas in the affine plane. To obtain our results we employ well-known algebraic methods for finite fields and geometric properties of the curve automorphisms. In…
We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.