Related papers: Improved Complexity Bounds for Counting Points on …

In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…

Consider a hyperelliptic curve of genus $g$ over a field $K$ of characteristic zero. After extending $K$ we can view it as a marked curve with its $2g+2$ Weierstrass points. We present an explicit algorithm to compute the stable reduction…

Let $\X$ be an irreducible, smooth, projective curve of genus $g \geq 2$ defined over the complex field $\C.$ Then there is a covering $\pi: \X \longrightarrow \P^1,$ where $\P^1$ denotes the projective line. The problem of expressing…

In arithmetic and algebraic geometry, superspecial (s.sp.\ for short) curves are one of the most important objects to be studied, with applications to cryptography and coding theory. If $g \geq 4$, it is not even known whether there exists…

We study the problem of \emph{local search} on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a vertex v for which f(v) is no more than f evaluated at any…

We present a progress on local computation algorithms for two coloring of $k$-uniform hypergraphs. We focus on instances that satisfy strengthened assumption of Local Lemma of the form $2^{1-\alpha k} (\Delta+1) e < 1$, where $\Delta$ is…

We study the fixed points of outer-totalistic cellular automata on sparse random regular graphs. These can be seen as constraint satisfaction problems, where each variable must adhere to the same local constraint, which depends solely on…

We construct isotrivial and non-isotrivial elliptic curves over $\mathbb{F}_q(t)$ with an arbitrarily large set of separable integral points. As an application of this construction, we prove that there are isotrivial log-general type…

We present an algorithm that, on input of a positive integer N together with its prime factorization, constructs a finite field F and an elliptic curve E over F for which E(F) has order N. Although it is unproved that this can be done for…

Over the past ten years, driven by large scale optimisation problems arising from machine learning, the development of stochastic optimisation methods have witnessed a tremendous growth. However, despite their popularity, the theoretical…

Coherent uncertainty quantification is a key strength of Bayesian methods. But modern algorithms for approximate Bayesian posterior inference often sacrifice accurate posterior uncertainty estimation in the pursuit of scalability. This work…

We study the sample complexity of differentially private optimization of quasi-concave functions. For a fixed input domain $\mathcal{X}$, Cohen et al. (STOC 2023) proved that any generic private optimizer for low sensitive quasi-concave…

We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the…

We apply some of the latest techniques from machine-learning to the arithmetic of hyperelliptic curves. More precisely we show that, with impressive accuracy and confidence (between 99 and 100 percent precision), and in very short time…

We describe an algorithm to count the number of rational points of an hyperelliptic curve defined over a finite field of odd characteristic which is based upon the computation of the action of the Frobenius morphism on a basis of the…

In this work we consider constructions of genus three curves $X$ such that $\mathrm{End}(\mathrm{Jac}(X)) \otimes Q$ contains the totally real cubic number field $Q(\zeta _ 7 + \overline{\zeta}_7)$. We construct explicit two-dimensional…

In this paper we present a polynomial time algorithm to compute the local zeta function Z(s,f) attached to a polynomial f(x) in Z[x] (in one variable, with splitting field Q) and a prime p. The algorithm reduces in polynomial time the…

A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…

We extend the traditional worst-case, minimax analysis of stochastic convex optimization by introducing a localized form of minimax complexity for individual functions. Our main result gives function-specific lower and upper bounds on the…

Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least…