相关论文: Bend, break and count

We give explicit formulas for the number of points on reductions of elliptic curves with complex multiplication by any imaginary quadratic field. We also find models for CM $\mathbf{Q}$-curves in certain cases. This generalizes earlier…

We show that if a family of complex varieties over a base B admits a section when restricted to a very general curve in B, then the family must contain a subfamily of rationally connected varieties dominating B. As an application, we deduce…

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…

This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number w such that any ball Q can be covered by w tiles (or curve sections) with total volume O(vol(Q)). Recursive tilings and…

For a smooth plane cubic $B$, we count curves $C$ of degree $d$ such that the normalizations of $C\backslash B$ are isomorphic to $\Bbb A^1$, for $d\leq7$ (for $d=7$ under some assumption). We also count plane rational quartic curves…

This paper is about one dimensional families of cyclic covers of the projective line in positive characteristic. For each such family, we study the mass formula for the number of non-ordinary curves in the family. We prove two equations for…

An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…

We study families of scrolls containing a given rational curve and families of rational curves contained in a fixed scroll via a stratification in terms of the degree of the induced map onto P^1 and we prove that there is no rational normal…

Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…

A novel family of integrable third order maps is presented. Each map possesses, by construction, a pair of rational invariants and a commuting map from the same class. The 3-dimensional invariant curve is parametrized, in general, by an…

A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…

We study moduli of coherent sheaves of some given degree and positive rank on a curve. We show that there is only one nonempty open condition on families of sheaves that yields a universally closed adequate moduli space, namely, the one…

We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of rational points on hyperelliptic curves defined over number fields. This offers advantages over descent based methods in that its correctness does…

We present some results about the number of rational points on a certain family of curves defined over a finite field. In a small number of cases the curves have more rational points than expected. Fibonacci numbers make an appearance, as…

We give a method of counting the number of curves with a given type of singularity in a suitably ample linear series on a smooth surface using punctual Hilbert schemes. The types of singulaties for which our methods suffice include the…

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

This note presents a formula for the enumerative invariants of arbitrary genus in toric surfaces. The formula computes the number of curves of a given genus through a collection of generic points in the surface. The answer is given in terms…

We give a simple recursive formula to obtain the general sum of the first $N$ natural numbers to the $r$th power. Our method allows one to obtain the general formula for the $(r+1)$th power once one knows the general formula for the $r$th…

Recurrence is a fundamental property of dynamical systems, which can be exploited to characterise the system's behaviour in phase space. A powerful tool for their visualisation and analysis called recurrence plot was introduced in the late…