Related papers: Counting points with Riemann-Roch formulas
In this paper, we study the nonexpansive properties of metric resolvent, and present a convergence rate analysis for the associated fixed-point iterations (Banach-Picard and Krasnosel'skii-Mann types). Equipped with a variable metric, we…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
We obtain new complexity bounds for computing a triangular integral basis of a number field or a function field. We reach for function fields a softly linear cost with respect to the size of the output when the residual characteristic is…
The objective of this manuscript is to enquire for the solvability of a specific type of non-linear quadratic integral equations via the interesting notion of measure of non-compactness. Firstly, we inquire into couple of exciting fixed…
In this article we are interested for the numerical study of nonlinear eigenvalue problems. We begin with a review of theoretical results obtained by functional analysis methods, especially for the Schrodinger pencils. Some recall are given…
Existing algorithms for isolating real solutions of zero-dimensional polynomial systems do not compute the multiplicities of the solutions. In this paper, we define in a natural way the multiplicity of solutions of zero-dimensional…
We develop an analytic framework for Lefschetz fixed point theory and Morse theory for Hilbert complexes on stratified pseudomanifolds. We develop formulas for both global and local Lefschetz numbers and Morse, Poincar\'e polynomials as…
We calculate explicitly solutions to the Dirichlet and Neumann boundary value problems in the upper half plane, for a family of divergence form equations with non symmetric coefficients with a jump discontinuity. It is shown that the…
The inverse problem of special geometry (Seiberg-Witten geometry of 4d N=2 SCFT) asks for a recursive construction of all such geometries in rank $r$ by assembling together known lower-rank ``strata''. This leads to a program to…
We discuss the effective computation of geometric singularities of implicit ordinary differential equations over the real numbers using methods from logic. Via the Vessiot theory of differential equations, geometric singularities can be…
A finite projective plane, or more generally a finite linear space, has an associated incidence complex that gives rise to two natural algebras: the Stanley-Reisner ring $R/I_\Lambda$ and the inverse system algebra $R/I_\Delta$. We give a…
We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…
A three-dimensional Riemannian manifold has locally 6, 4, 3, 2, 1 or none independent Killing vectors. We present an explicit algorithm for computing dimension of the infinitesimal isometry algebra. It branches according to the values of…
In this work, we designed algorithms for the point in polygon problem based on the ray casting algorithm using equations from vector geometry. The algorithms were implemented using the python programming language. We tested the algorithm…
In this paper, we propose a numerical method of computing a Hadamard finite-part integral with a non-integral power singularity at an endpoint, that is, a finite part of a divergent integral as a limiting procedure. In the proposed method,…
We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
We consider a class of nonsmooth fractional programming problems with fixed-point constraints, where the numerator is convex and the denominator is concave. To solve this problem, we propose splitting algorithms that compute subgradient…
We construct invariants for any closed semipositive symplectic manifold which count rational curves satisfying tangency constraints to a local divisor. More generally, we introduce invariants involving multibranched local tangency…
The Bunch-Kaufman algorithm and Aasen's algorithm are two of the most widely used methods for solving symmetric indefinite linear systems, yet they both are known to suffer from occasional numerical instability due to potentially…