Vortices and Jacobian varieties

We investigate the geometry of the moduli space of N$N$ vortices on line bundles over a closed Riemann surface Σ$\Sigma$ of genus g>1$g>1$, in the little explored situation where 1≤N<g$1\le N<g$. In the regime where the area of the surface is just large enough to accommodate N$N$ vortices (which we call the dissolving limit), we describe the relation between the geometry of the moduli space and the complex geometry of the Jacobian variety of Σ$\Sigma$. For N=1$N=1$, we show that the metric on the moduli space converges to a natural Bergman metric on Σ$\Sigma$. When N>1$N>1$, the vortex metric typically degenerates as the dissolving limit is approached, the degeneration occurring precisely on the critical locus of the Abel–Jacobi map of Σ$\Sigma$ at degree N$N$. We describe consequences of this phenomenon from the point of view of multivortex dynamics.     

Derivation of invariant varieties of periodic points from singularity confinement in the case of Toda map

We have shown in [1] that the invariant varieties of periodic points (IVPP) of all periods of some higher dimensional rational maps can be derived, iteratively, from the singularity confinement (SC). We generalize this algorithm, in this paper, to apply to any birational map, which has more invariants than the half of the dimension.     

On images of affine spaces

We prove that every non-degenerate toric variety, every homogeneous space of a connected linear algebraic group without non-constant invertible regular functions, and every variety covered by affine spaces admit a surjective morphism from an affine space.     

The effect of variety seeking behaviour on optimal product positioning

In this paper we develop a stochastic (first order Markovian) consumer choice model that represents variety seeking behaviour and we investigate the practical implications of this model for optimal product positioning relative to a zero order model that does not incorporate variety seeking. We show that the optimal positioning implications of a variety seeking process is indeed different than those of a (no-variety-seeking) zero order process. Based on intuition, one might expect increased variety seeking to imply that firms should increase the distance between their products in an attribute space. In fact, we show that this effect does occur for relatively low share brands. But just the opposite effect holds for relatively high share brands. That is, variety seeking behaviour generates a desire to more differentiation among low share brands, and a desire for less differentiation among high share brands.     

Subtractive Categories

We introduce a notion of a subtractive category. It generalizes the notion of a pointed subtractive variety of universal algebras in the sense of A. Ursini. Subtractive categories are closely related to Mal’tsev and additive categories: (i) a category C with finite limits is a Mal’tsev category if and only if for every object X in C the category Pt(X)=((X,1_X)↓(C↓X)) of “points over X” is subtractive; (ii) a pointed category C with finite limits is additive if and only if C is subtractive and half-additive.Mathematics Subject Classifications (2000) 18C99, 18E05, 08B05.     

Betti Numbers of Toric Varieties and Eulerian Polynomials

It is well known that the Eulerian polynomials, which count permutations in S _n by their number of descents, give the h-polynomial/h-vector of the simple polytopes known as permutohedra, the convex hull of the S _n -orbit for a generic weight in the weight lattice of S _n . Therefore, the Eulerian polynomials give the Betti numbers for certain smooth toric varieties associated with the permutohedra.

In this article we derive recurrences for the h-vectors of a family of polytopes generalizing this. The simple polytopes we consider arise as the orbit of a nongeneric weight, namely, a weight fixed by only the simple reflections J = {s _n , s _n?1, s _n?2,…, s _n?k+2, s _n?k+1} for some k with respect to the A _n root lattice. Furthermore, they give rise to certain rationally smooth toric varieties X(J) that come naturally from the theory of algebraic monoids. Using effectively the theory of reductive algebraic monoids and the combinatorics of simple polytopes, we obtain a recurrence formula for the Poincaré polynomial of X(J) in terms of the Eulerian polynomials.     

Laurent polynomials and Eulerian numbers

Duistermaat and van der Kallen show that there is no nontrivial complex Laurent polynomial all of whose powers have a zero constant term. Inspired by this, Sturmfels poses two questions: Do the constant terms of a generic Laurent polynomial form a regular sequence? If so, then what is the degree of the associated zero-dimensional ideal? In this note, we prove that the Eulerian numbers provide the answer to the second question. The proof involves reinterpreting the problem in terms of toric geometry.     

Varieties with small discriminant variety

Let be a smooth complex projective variety, let be an ample and spanned line bundle on , defining a morphism and let be its discriminant locus, the variety parameterizing the singular elements of . We present two bounds on the dimension of and its main component relying on the geometry of . Classification results for triplets reaching the bounds as well as significant examples are provided.

     

Hyperidentities of some generalizations of lattices

In the paper we present bases and hyperbases of hyperidentities of some generalizations of the variety L of all lattices and the variety D of distributive lattices. We describe the form of hyperidentities of some varieties with two binary operations. Received January 22, 1997; accepted in final form January 7, 1998.     

Disjoint Paths in Decomposable Digraphs

The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1].