Related papers: A Point Counting Algorithm for Cyclic Covers of th…

We aim to solve the problem of data-driven collision-distance estimation given 3-dimensional (3D) geometries. Conventional algorithms suffer from low accuracy due to their reliance on limited representations, such as point clouds. In…

In this paper, we consider the counting function $E_P(y) = |P_{y} \cap Z^{n_x}|$ for a parametric polyhedron $P_{y} = \{x \in R^{n_x} \colon A x \leq b + B y\}$, where $y \in R^{n_y}$. We give a new representation of $E_P(y)$, called a…

We use the circle method to count $\mathbb{F}_q(t)$-rational points of bounded naive height on a quadric hypersurface $X\subseteq \mathbb{P}^{n-1}$ defined over $\mathbb{F}_q$, provided that $\mathrm{char}(\mathbb{F}_q)>2$ and $n\ge 3$.…

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…

We present an algorithm for the computation of period matrices and the Abel-Jacobi map of complex superelliptic curves given by an equation $y^m=f(x)$. It relies on rigorous numerical integration of differentials between Weierstrass points,…

We consider the problem of counting polynomial curves on analytic or definable subsets over the field ${\mathbb{C}}(\!(t)\!)$, as a function of the degree $r$. A result of this type could be expected by analogy with the classical…

We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…

We consider some variations on the classical method of Runge for effectively determining integral points on certain curves. We first prove a version of Runge's theorem valid for higher-dimensional varieties, generalizing a uniform version…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…

Let $R$ be a complete discrete valuation ring of mixed characteristic $(0,p)$ with field of fractions $K$ containing the $p$-th roots of unity. This paper is concerned with semi-stable models of $p$-cyclic covers of the projective line $C…

Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on…

In this paper we prove an explicit version of a function field analogue of a classical result of Odoni about norms in number fields in the case of a cyclic Galois extensions. In the particular case of a quadratic extension, we recover the…

The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the…

Problems that require the parameterization of closed contours arise frequently in computer vision applications. This article introduces a new curve parameterization algorithm that is able to fit a closed curve to a set of points while being…

We provide a simple and efficient algorithm for computing the Euclidean projection of a point onto the capped simplex---a simplex with an additional uniform bound on each coordinate---together with an elementary proof. Both the MATLAB and…

Let $X=\C^n$. In this paper we present an algorithm that computes the de Rham cohomology groups $H^i_{dR}(U,\C)$ where $U$ is the complement of an arbitrary Zariski-closed set $Y$ in $X$. Our algorithm is a merger of the algorithm given by…

Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…

We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…