Related papers: Bend, break and count
Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute…
Let $K$ be a local field of residue characteristic $p$. Let $C$ be a curve over $K$ whose minimal proper regular model has totally degenerate semi-stable reduction. Under certain hypotheses, we compute the prime-to-$p$ rational torsion…
We classify projective plane nonsingular curves admitting a 3-term presentation; they exist in any degree, generally constitute 5 birational families and are defined over rational numbers. The Belyi functions on all these curves are…
By considering mirror symmetry applied to conformal field theories corresponding to strings propagating in quintic hypersurfaces in projective 4-space, Candelas, de la Ossa, Green and Parkes calculated the ``number of rational curves on the…
We give an algorithm for calculating the splitting type of the normal bundle of any rational monomial curve. The algorithm is obtained by reducing the calculus to a combinatorial problem and then by solving this problem.
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
We find a recursive formula for the motivic Milnor fiber of an irreducible plane curve, using the notions of a truncation and derived curve. We then apply natural transformations to obtain a similar recursion for the Hodge-theoretic…
We construct the COpula Recursive Tree (CORT) estimator: a flexible, consistent, piecewise linear estimator of a copula, leveraging the patchwork copula formalization and various piecewise constant density estimators. While the patchwork…
The systems of complex analytic second order ordinary differential equations whose solutions close up to become rational curves (after analytic continuation) are characterized by the vanishing of an explicit differential invariant, and turn…
Let $K_i$ be a number field for all $i \in \mathbb{Z}_{> 0}$ and let $\mathcal{E}$ be a family of elliptic curves containing infinitely many members defined over $K_i$ for all $i$. Fix a rational prime $p$. We give sufficient conditions for…
We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset…
We describe a method to show a plane quartic over a number field has no rational points. The method can be adapted to show that a curve does not have divisors of degree 1 or 2 and can be generalized to arbitrary smooth projective curves.…
In this paper we develop the formalism of rational complex Bezier curves. This framework is a simple extension of the CAD paradigm, since it describes arc of curves in terms of control polygons and weights, which are extended to complex…
In this (mostly) survey article, we give a synopsis of a number of results relating to Brill--Noether theory on curves and metric graphs, together with some speculations about the behavior of one-dimensional linear series on a class of…
We construct genus one curves on base extensions of generic Severi--Brauer varieties of a given index and period which are versal objects for families of geometrically elliptic normal curves. We also compute the periods and indices of these…
In this paper, we construct rotating frames for curves, including plane curves, space curves and curves on surfaces. Hence, the behaviour of an arbitrary moving point on a curve can be seen as the composite of linear motion and rotation.…
We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.
We consider the problem of counting the number of varieties in a family over $\mathbb{Q}$ with a rational point. We obtain lower bounds for this counting problem for some families over $\mathbb{P}^1$, even if the Hasse principle fails. We…
The mainstream crowd counting methods regress density map and integrate it to obtain counting results. Since the density representation to one head accords to its adjacent distribution, it embeds the same category objects with variant…
This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…