arXiv subjects
Publications and source records attributed to Josef Schicho.
It is well known that every Del Pezzo surface of degree 5 defined over k is parametrizable over k. In this paper we give an efficient construction for parametrizing, as well as algorithms for constructing examples in every isomorphism class and for deciding equivalence.
Let $C$ be a non-hyperelliptic algebraic curve. It is known that its canonical image is the intersection of the quadrics that contain it, except when $C$ is trigonal (that is, it has a linear system of degree 3 and dimension 1) or isomorphic to a plane quintic (genus 6). In this context, we present a method to decide whether a given algebraic curve is trigonal, and in the affirmative case to compute a map from $C$ to the projective line whose fibers cut out the linear system.
Let C be a non-hyperelliptic algebraic curve of genus at least 3. Enriques and Babbage proved that its canonical image is the intersection of the quadrics that contain it, except when C is trigonal (that is, it has a linear system of degree 3 and dimension 1) or C is isomorphic to a plane quintic (genus 6). We present a method to decide whether a given algebraic curve is trigonal, and in the affirmative case to compute a map from C to the projective line whose fibers cut out the linear system. It is based on the Lie algebra method presented in Schicho (2006). Our algorithm is part of a larger effort to determine whether a given algebraic curve admits a radical parametrization.
First we solve the problem of finding minimal degree families on toric surfaces by reducing it to lattice geometry. Then we describe how to find minimal degree families on, more generally, rational complex projective surfaces.
We propose a combinatorial game on finite graphs, called Salmagundy, that is played by two protagonists, Dido and Mephisto. The game captures the logical structure of a proof of the resolution of singularities. In each round, the graph of the game is modified by the moves of the players. When it assumes a final configuration, Dido has won. Otherwise, the game goes on forever, and nobody wins. In particular, Mephisto cannot win himself, he can only prevent Dido from winning. We show that Dido always possesses a winning strategy, regardless of the initial shape of the graph and of the moves of Mephisto. This implies -- translating back to algebraic geometry -- that there is a choice of centers for the blowup of singular varieties in characteristic zero which eventually leads to their resolution. The algebra needed for this implication is elementary. The transcription from varieties to graphs and from blowups to modifications of the graph thus axiomatizes the proof of the resolution of singularities. In principle, the same logic could also work in positive characteristic, once an appropriate descent in dimension is settled.
Algebraic varieties which are locally isomorphic to open subsets of affine space will be called {\em plain}. Plain varieties are smooth and rational. The converse is true for curves and surfaces, and unknown in general. It is shown that plain varieties are stable under blowup in smooth centers.
In this paper, a new method to determine the complete set of dynamically balanced planar four-bar mechanims is presented. Using complex variables to model the kinematics of the mechanism, the dynamic balancing constraints are written as algebraic equations over complex variables and joint angular velocities. After elimination of the joint angular velocity variables, the problem is formulated as a problem of factorization of Laurent polynomials. Using toric polynomial division, necessary and sufficient conditions for dynamic balancing of planar four-bar mechanisms are derived.
Over a field of characteristic zero, it is clear that a polynomial of the form (X-a)^d has a non-trivial common factor with each of its d-1 first derivatives. The converse has been conjectured by Casas-Alvero. Up to now there have only been some computational verifications for small degrees d. In this paper the conjecture is proved in the case where the degree of the polynomial is a power of a prime number, or twice such a power. Moreover, for each positive characteristic p, we give an example of a polynomial of degree d which is not a dth power but which has a common factor with each of its first d-1 derivatives. This shows that the assumption of characteristic zero is essential for the converse statement to hold.
In this note we classify all triples (a,b,i) such that there is a convex lattice polygon P with area a, and b respectively i lattice points on the boundary respectively in the interior. The crucial lemma for the classification is the necessity of b \le 2 i + 7. We sketch three proofs of this fact: the original one by Scott, an elementary one, and one using algebraic geometry. As a refinement, we introduce an onion skin parameter l: how many nested polygons does P contain? and give sharper bounds.
For a Del Pezzo surface of degree 8 given over the rationals we decide whether there is a rational parametrization of the surface and construct one in the affirmative case. We define and use the Lie algebra of the surface to reach the aim. The algorithm has been implemented in Magma.
It is well-known that a Severi-Brauer surface has a rational point if and only if it is isomorphic to the projective plane. Given a Severi-Brauer surface, we study the problem to decide whether such an isomorphism to the projective plane, or such a rational point, does exist; and to construct such an isomorphism or such a point in the affirmative case. We give an algorithm using Lie algebra techniques. The algorithm has been implemented in Magma.
The parametric degree of a rational surface is the degree of the polynomials in the smallest possible proper parametrization. An example shows that the parametric degree is not a geometric but an arithmetic concept, in the sense that it depends on the choice of the ground field. In this paper, we introduce two geometrical invariants of a rational surface, namely level and keel. These two numbers govern the parametric degree in the sense that there exist linear upper and lower bounds.