Related papers: Automorphisms of odd dimensional $(2,2)$-complete …
We construct examples of simply connected nonalgebraic symplectic fourfolds with a prescribed number of nonintersecting symplectic curves with positive self-intersections.
In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given…
Any quasi-isometry of the complex of curves is bounded distance from a simplicial automorphism. As a consequence, the quasi-isometry type of the curve complex determines the homeomorphism type of the surface.
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…
We study intersections of exceptional curves on del Pezzo surfaces of degree 1, motivated by questions in arithmetic geometry. Outside characteristics 2 and 3, at most 10 exceptional curves can intersect in a point. We classify the…
We determine all complex hyperelliptic curves with many automorphisms and decide which of their jacobians have complex multiplication.
Let alpha be an automorphism of a hyperelliptic curve C of genus g, and let alpha' be the automorphism of P^1 induced by alpha. Let n be the order of alpha and let n' be the order of alpha'. We show that the triple (g,n,n') completely…
In this paper, we establish a second main theorem for holomorphic curve intersecting hypersurfaces in general position in projective space with level of truncation. As an application, we reduce the number hypersurfaces in uniqueness problem…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
We are concerned with polynomial involutions in characteristic two. In this note, we look for involutions among triangular automorphisms of the four-dimensional polynomial ring in characteristic two and obtain three types of such…
We study families of superelliptic curves with fixed automorphism groups. Such families are parametrized with invariants expressed in terms of the coefficients of the curves. Algebraic relations among such invariants determine the lattice…
We describe the groups of automorphisms of two generated free braided associative algebras with involutive diagonal braidings over a field of characteristic $\neq 2$. Depending on the form of the diagonal involutive braiding, five different…
The purpose of this paper is to show that for a complete intersection curve $C$ in projective space (other than a few stated exceptions), any morphism $f: C \to \mathbb{P}^r$ satisfying $\text{deg}\, f^*\mathcal{O}_{\mathbb{P}^r}(1)…
I give a new proof, in scheme-theoretic language, of Tate's old result on genus-change over nonperfect fields in characteristic p>0. Namely, for normal geometrically integral curves, the difference between arithmetic and geometric genus…
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…
Generically an almost complex structure has no symmetries at all, but there exist symmetric structures. In this paper we describe how to guarantee that the pseudogroup of local symmetries is small (finite-dimensional). It will be indicated…
We show that all the automorphisms of the symmetric product Sym^d(X), d>2g-2, of a smooth projective curve X of genus g>2 are induced by automorphisms of X.
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…
All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.