Related papers: Counting points with Riemann-Roch formulas
We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also…
An algorithm is developed for efficiently constructing the Lorentz covariant effective three-point vertices of the decay of a particle into two daughter particles in which all the masses and spins of the three particles can be arbitrary.…
Despite extensive research on symmetric polynomial quadrature rules for triangles, as well as approaches to their calculation, few studies have focused on non-polynomial functions, particularly on their integration using symmetric triangle…
An optimal 3-point quadrature formula of closed type is derived. Various error inequalities are established. Applications in numerical integration are also given.
We introduce a new approach to obtaining pointwise estimates for solutions of elliptic boundary value problems when the operator being considered satisfies a certain type of weighted integral inequalities. The method is illustrated on…
We examine a wide class of stochastic approximation algorithms for solving (stochastic) nonlinear problems on Riemannian manifolds. Such algorithms arise naturally in the study of Riemannian optimization, game theory and optimal transport,…
We report on some advances made in the problem of singularities in general relativity. First is introduced the singular semi-Riemannian geometry for metrics which can change their signature (in particular be degenerate). The standard…
The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…
We establish elliptic regularity for nonlinear inhomogeneous Cauchy-Riemann equations under minimal assumptions, and give a counterexample in a borderline case. In some cases where the inhomogeneous term has a separable factorization, the…
In this paper, we discuss the uniqueness in an integral geometry problem in a strongly convex domain. Our problem is related to the problem of finding a Riemannian metric by the distances between all pairs of the boundary points. For the…
We present a package 'MixedMultiplicity' for computing mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over a field. This enables us to find mixed volumes of convex lattice polytopes…
The asymptotic formula of the number of integral points in non-compact symmetric homogeneous spaces of semi-simple simply connected algebraic groups is given by the average of the product of the number of local solutions twisted by the…
We consider the leapfrog algorithm by Noakes for computing geodesics on Riemannian manifolds. The main idea behind this algorithm is to subdivide the original endpoint geodesic problem into several local problems, for which the endpoint…
A numerical scheme is presented for solving the Helmholtz equation with Dirichlet or Neumann boundary conditions on piecewise smooth open curves, where the curves may have corners and multiple junctions. Existing integral equation methods…
The soft and collinear singularities of general scalar and tensor one-loop N-point integrals are worked out explicitly. As a result a simple explicit formula is given that expresses the singular part in terms of 3-point integrals. Apart…
We present algorithms for computing strongly singular and near-singular surface integrals over curved triangular patches, based on singularity subtraction, the continuation approach, and transplanted Gauss quadrature. We demonstrate the…
Using exact computer arithmetic, it is possible to determine the (exact) solution of a numerical model without rounding error. For such purposes, a corresponding system of equations should be exactly defined, either directly or by…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
The main purpose of this survey is to provide an introduction, algebro-topological in nature, to Hirzebuch-type inequalities for plane curve arrangements in the complex projective plane. These inequalities gain more and more interest due to…
We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…