Enumerative geometry of elliptic curves on toric surfaces

We establish the equality of classical and tropical curve counts for elliptic curves on toric surfaces with fixed j-invariant, refining results of Mikhalkin and Nishinou–Siebert. As an application, we determine a formula for such counts on P² and all Hirzebruch surfaces. This formula relates the count of elliptic curves with the number of rational curves on the surface satisfying a small number of tangency conditions with the toric boundary. Furthermore, the combinatorial tropical multiplicities of Kerber and Markwig for counts in P² are derived and explained algebro-geometrically, using Berkovich geometry and logarithmic Gromov–Witten theory. As a consequence, a new proof of Pandharipande’s formula for counts of elliptic curves in P² with fixed j-invariant is obtained.     

Lattice geometry and pythagorean triangles

By drawing a Pythagorean triangle in a quadratic lattice and attaching a congruent lattice at the hypotenuse there will occur a Moiré effect with a new quadratic lattice of enlarged scale in the superposition. This new lattice is related to the parameterization of the Pythagorean triangle. A similar effect occurs with triangles with integer side lengths and an angle of 120° in a regular triangular lattice. We work with dot lattices on transparencies to visualize the optical effects.     

2-Colored triangles in edge-colored complete graphs, II

The largest number n = n(k) for which there exists a k-coloring of the edges of k_n with every triangle 2-colored is found to be n(k) = 2^r5^m, where k = 2m + r and r = 0 or 1, and all such colorings are given. We also prove the best possible result that a k-colored K_p satisfying 1 < k < 1 + √p contains at most k − 2 vertices not in a bichromatic triangle.     

Axiomatizations of Euclidean geometry in terms of points,equilateral triangles or squares, and incidence

Dimension-free Euclidean geometry over Euclidean ordered fields can be axiomatized in a two-sortedfirst-order language, with points and regular n-gons (with n = 3 or 4) as variables, and with a binary predicate standing for the incidence of a point and a regular n-gon as the only primitive notions.     

Spherical f-Tilings by Scalene Triangles and Isosceles Trapezoids, Ⅱ

The study of the dihedral f-tilings of the sphere S ² whose prototiles are a scalene triangle and an isosceles trapezoid was initiated in a previous work. In this paper we continue this classification presenting the study of all dihedral spherical f-tilings by scalene triangles and isosceles trapezoids in some cases of adjacency.     

On the foundations of polar geometry,II

One of the two Buekenhout-Shult theorems for polar spaces required a finite rank assumption. Here we get rid of that restriction. Similarly, the polar spaces of possibly infinite rank having some line of two points are classified.     

Applications of random sampling in computational geometry,II

We use random sampling for several new geometric algorithms. The algorithms are Las Vegas, and their expected bounds are with respect to the random behavior of the algorithms. These algorithms follow from new general results giving sharp bounds for the use of random subsets in geometric algorithms. These bounds show that random subsets can be used optimally for divide-and-conquer, and also give bounds for a simple, general technique for building geometric structures incrementally. One new algorithm reports all the intersecting pairs of a set of line segments in the plane, and requiresO(A+n logn) expected time, whereA is the number of intersecting pairs reported. The algorithm requiresO(n) space in the worst case. Another algorithm computes the convex hull ofn points inE ^d inO(n logn) expected time ford=3, andO(n ^[d/2]) expected time ford>3. The algorithm also gives fast expected times for random input points. Another algorithm computes the diameter of a set ofn points inE ³ inO(n logn) expected time, and on the way computes the intersection ofn unit balls inE ³. We show thatO(n logA) expected time suffices to compute the convex hull ofn points inE ³, whereA is the number of input points on the surface of the hull. Algorithms for halfspace range reporting are also given. In addition, we give asymptotically tight bounds for (k)-sets, which are certain halfspace partitions of point sets, and give a simple proof of Lee's bounds for high-order Voronoi diagrams.     

A Formal Calculus for the Enumerative System of Sequences—II. Applications

We apply the theory of sequence enumeration presented in Part I to a variety of problems. The problems have been classified according to the scheme given in Part I and include specializations to permutations for a number of bipartitions. Further extensions will be given in Part III.     

Enumerative properties of shifted-Dyck partitions

We study the enumerative properties of a new class of (skew) shifted partitions. This class arises in the computation of certain parabolic Kazhdan-Lusztig polynomials and is closely related to ballot sequences. As consequences of our results, we obtain new identities for the parabolic Kazhdan-Lusztig polynomials of Hermitian symmetric pairs and for the ordinary Kazhdan-Lusztig polynomials of certain Weyl groups.     

Matrix models, complex geometry, and integrable systems: II

We consider certain examples of applications of the general methods based on geometry and integrability of matrix models. These methods were described in the first part of this paper. In particular, we investigate the nonlinear differential equations satisfied by semiclassical tau functions. We also discuss a similar semiclassical geometric picture arising in the context of multidimensional supersymmetric gauge theories and the AdS/CFT correspondence. [This article was written at the request of the Editorial Board. It is based on several lectures presented at schools of mathematical physics and talks at the conference “Complex Geometry and String Theory” and the Polivanov memorial seminar.] __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 147, No. 3, pp. 399–449, June, 2006.     

Enumerative Properties of Rooted Circuit Maps

In 1966, Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar graphs share many interesting properties which are not satisfied by general 2-connected planar graphs. Circuit graphs have nice closure properties which make them easier to deal with than 3-connected planar graphs for studying some graph-theoretic properties. In this paper, we study some enumerative properties of circuit graphs. For enumeration purpose, we define rooted circuit maps and compare the number of rooted circuit maps with those of rooted 2-connected planar maps and rooted 3-connected planar maps.     

Enumerative Properties of Ferrers Graphs

We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when applicable, the chromatic polynomial and the chromatic symmetric function. We show that the linear coefficient of the chromatic polynomial is given by the excedance set statistic.     

Tilings of triangles

Let T be a non-equilateral triangle. We prove that the number of non-similar triangles Δ such that T can be dissected into triangles similar to Δ is at most 6. On the other hand, for infinitely many triangles T there are six non-similar triangles Δ such that T can be dissected into congruent triangles similar to Δ. For the equilateral triangle there are infinitely many such Δ. We also investigate the number of pieces in the dissections of the equilateral triangle into congruent triangles.     

Decision Analysis Using an Enumerative Approach

A computer based, enumerative approach to decision making in a practical environment is described for circumstances where many feasible alternative plans can be generated within given constraints. The method lies between simple techniques for evaluating a few alternative plans and very general techniques such as integer programming, and has advantages over both of these approaches in certain cases. Its main use is as a decision support system, providing management with a range of ranked alternatives. The technique is embodied in a computer program which is used to give an example of how the method may be applied in practice.