Related papers: Counting points with Riemann-Roch formulas
We propose a method for computing upper bounds for the Heilbronn problem for triangles.
The number of rational points of a plane non-singular algebraic curve X defined over a finite field is computed, provided that the generic point of X is not an inflexion and that X is Frobenius non-classical with respect to conics.
This paper considers optimization problems on Riemannian manifolds and analyzes iteration-complexity for gradient and subgradient methods on manifolds with non-negative curvature. By using tools from the Riemannian convex analysis and…
This paper announces results on the behavior of some important algebraic and topological invariants --- Euler characteristic, arithmetic genus, and their intersection homology analogues; the signature, etc. --- and their associated…
We formulate a resolution of singularities algorithm for analyzing the zero sets of real-analytic functions in dimensions $\geq 3$. Rather than using the celebrated result of Hironaka, the algorithm is modeled on a more explicit and…
Using the language of Riordan arrays, we look at two related iterative processes on matrices and determine which matrices are invariant under these processes. In a special case, the invariant sequences that arise are conjectured to have…
We introduce a new class of finite dimensional gentle algebras, the surface algebras, which are constructed from an unpunctured Riemann surface with boundary and marked points by introducing cuts in internal triangles of an arbitrary…
A five-dimensional symmetry algebra consisting of Lie point symmetries is firstly computed for the nonlinear Schroedinger equation, which, together with a reflection invariance, generates two five-parameter solution groups. Three ansaetze…
This paper presents solutions to Einstein's equation -- and the numerical methods used to construct them -- that describe simple cosmological models on manifolds with compact non-orientable spatial slices. These solutions have been…
We present a new quadratic Chabauty method to compute the integral points on certain even degree hyperelliptic curves. Our approach relies on a nontrivial degree zero divisor supported at the two points at infinity to restrict the $p$-adic…
We herein propose a variant of the projected inexact Levenberg--Marquardt method (ILMM) for solving constrained nonsmooth equations. Since the orthogonal projection onto the feasible set may be computationally expensive, we propose a local…
We describe a strategy to solve differential equations for Feynman integrals by powers series expansions near singular points and to obtain high precision results for the corresponding master integrals. We consider Feynman integrals with…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…
In this article, we study a calibrated version of Reifenberg theorem "with holes". In particular we study sets that are suitably approximable at all points and scales by calibrated planes and show that, without any additional hypotheses on…
The systems of nonlinear Volterra integral equations of the first kind with jump discontinuous kernels are studied. The iterative numerical method for such nonlinear systems is proposed. Proposed method employs the modified…
We define a generalization of the winding number of a piecewise $C^1$ cycle in the complex plane which has a geometric meaning also for points which lie on the cycle. The computation of this winding number relies on the Cauchy principal…
The relaxation complexity rc(X) of the set of integer points X contained in a polyhedron is the minimal number of inequalities needed to formulate a linear optimization problem over X without using auxiliary variables. Besides its relevance…
One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…
We have developed a general Bayesian algorithm for determining the coordinates of points in a three-dimensional space. The algorithm takes as input a set of probabilistic constraints on the coordinates of the points, and an a priori…
We obtain an equivariant index theorem, or Lefschetz fixed-point formula, for isometries from complete Riemannian manifolds to themselves. The fixed-point set of such an isometry may be noncompact. We build on techniques developed by Roe.…