Related papers: Counting points on surfaces in polynomial time

In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…

Traditional algorithms for stochastic optimization require projecting the solution at each iteration into a given domain to ensure its feasibility. When facing complex domains, such as positive semi-definite cones, the projection operation…

Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm…

We investigate the moments of the derivative, on the unit circle, of characteristic polynomials of random unitary matrices and use this to formulate a conjecture for the moments of the derivative of the Riemann zeta-function on the critical…

We give cohomological criteria for logarithmic good reduction of elliptic surfaces up to modification. Along the way, we prove several more general results about such surfaces in positive characteristic, as well as about log smooth…

To evaluate Riemann's zeta function is important for many investigations related to the area of number theory, and to have quickly converging series at hand in particular. We investigate a class of summation formulae and find, as a special…

Suppose $k,p\!\in\!\mathbb{N}$ with $p$ prime and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial with degree $d$ and all coefficients having absolute value less than $p^k$. We give a Las Vegas randomized algorithm that computes the…

Fix a number field k. We prove that if there is an algorithm for deciding whether a smooth projective geometrically integral k-variety has a k-point, then there is an algorithm for deciding whether an arbitrary k-variety has a k-point and…

A Hermite type formula is introduced and used to study the zeta function over the real and complex n-projective space. This approach allows to compute the residua at the poles and the value at the origin as well as the value of the…

In the present paper we give a simple mathematical foundation for describing the zeros of the Selberg zeta functions $Z_X$ for certain very symmetric infinite area surfaces $X$. For definiteness, we consider the case of three funneled…

The local topological zeta function is a rational function associated to a germ of a complex holomorphic function. This function can be computed from an embedded resolution of singularities of the germ. For nondegenerate functions it is…

A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…

In this paper, we prove the rationality of Igusa's local zeta functions of semiquasihomogeneous polynomials with coefficients in a non-archimedean local field K. The proof of this result is based on Igusa's stationary phase formula and some…

In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his…

The local zeta functions (also called Igusa's zeta functions) over p-adic fields are connected with the number of solutions of congruences and exponential sums mod p^{m}. These zeta functions are defined as integrals over open and compact…

Point containment queries on trimmed surfaces are fundamental to CAD modeling, solid geometry processing, and surface tessellation. Existing approaches such as ray casting and generalized winding numbers often face limitations in robustness…

Given $p$ polynomials of $n$ variables over a field $k$ of characteristic 0 and a point $a \in k^n$, we propose an algorithm computing the local Bernstein-Sato ideal at $a$. Moreover with the same algorithm we compute a constructible…

Recently, Kothari et al.\ gave an algorithm for testing the surface area of an arbitrary set $A \subset [0, 1]^n$. Specifically, they gave a randomized algorithm such that if $A$'s surface area is less than $S$ then the algorithm will…

We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…