After showing that the General Cayley\u2013Bacharach Conjecture formulated by D. Eisenbud, M. Green, and J. Harris (1996) [6] is equivalent to a conjecture about the region of uniformity of a zerodimensional complete intersection, we prove this Conjecture in a number of special cases. In particular, after splitting the conjecture into several intervals, we prove it for the first, the last and part of the penultimate interval. Moreover, we generalize the uniformityresults of J. Hansen (2003) [12] and L. Gold, J. Little, and H. Schenck (2005) [9] to level schemes and apply them to obtain bounds forthe minimal distance of generalized Reed\u2013Muller codes
In order to study circuit complexity classes within NC¹ in a uniform setting, we need a uniformity c...
We show that the uniform boundedness of the transcendental Brauer group of K3 surfaces and abelian v...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
AbstractHansen (Appl. Algebra Eng. Comm. Comput. 14 (2003) 175) uses cohomological methods to find a...
This work aims at presenting results on the length and dimension of codes defined over complete inte...
A rational distance set is a subset of the plane such that the distance between any two points is a ...
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric vari...
[EN] Using the general notion of distance function introduced in an earlier paper, a construction of...
We obtain several classes of completely regular codes with different parameters, but identical inter...
Let Z denote a finite collection of points in projective n-space and let I denote the homogeneous id...
AbstractThe Exact Geometric Computing approach requires a zero test for numbers which are built up u...
AbstractLet Z denote a finite collection of reduced points in projective n-space and let I denote th...
We obtain several classes of completely regular codes with different parameters, but identical inter...
For zero-dimensional complete intersections with homogeneous ideal generators of equal degrees over ...
Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the addi...
In order to study circuit complexity classes within NC¹ in a uniform setting, we need a uniformity c...
We show that the uniform boundedness of the transcendental Brauer group of K3 surfaces and abelian v...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
AbstractHansen (Appl. Algebra Eng. Comm. Comput. 14 (2003) 175) uses cohomological methods to find a...
This work aims at presenting results on the length and dimension of codes defined over complete inte...
A rational distance set is a subset of the plane such that the distance between any two points is a ...
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric vari...
[EN] Using the general notion of distance function introduced in an earlier paper, a construction of...
We obtain several classes of completely regular codes with different parameters, but identical inter...
Let Z denote a finite collection of points in projective n-space and let I denote the homogeneous id...
AbstractThe Exact Geometric Computing approach requires a zero test for numbers which are built up u...
AbstractLet Z denote a finite collection of reduced points in projective n-space and let I denote th...
We obtain several classes of completely regular codes with different parameters, but identical inter...
For zero-dimensional complete intersections with homogeneous ideal generators of equal degrees over ...
Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the addi...
In order to study circuit complexity classes within NC¹ in a uniform setting, we need a uniformity c...
We show that the uniform boundedness of the transcendental Brauer group of K3 surfaces and abelian v...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...