Related papers: Addition via reduction algorithm on trigonal curve…
Proves that if a curve has totally split reduction and the corresponding skeleton (as a metric graph) is a chain of loops with generic edge lengths, then every divisor on the graph with imposed ramification at the rightmost vertex $p$ of…
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…
We rely on the framework of Morse sequences to enable the direct computation of gradient vector fields on simplicial complexes. A Morse sequence is a filtration from a subcomplex $L$ to a complex $K$ via elementary expansions and fillings,…
In this paper, we consider networks with topologies described by some connected undirected graph ${\mathcal{G}}=(V, E)$ and with some agents (fusion centers) equipped with processing power and local peer-to-peer communication, and…
We revisit the problem of resolution of singularities of toric curves by iterating Nash modification. We give a bound on the number of iterations required to obtain the resolution. We also introduce a different approach on counting…
Let E be an elliptic curve with additive reduction over the p-adic numbers, and let G be the group of p-adic points on E that have good reduction. This paper gives necessary and sufficient conditions for G to contain non-trivial p-torsion.
We propose the superiorization of incremental algorithms for tomographic image reconstruction. The resulting methods follow a better path in its way to finding the optimal solution for the maximum likelihood problem in the sense that they…
We present an algorithm to compute the Hodge ideals of $\mathbb{Q}$-divisors associated to any reduced effective divisor $D$. The computation of the Hodge ideals is based on an algorithm to compute parts of the $V$-filtration of Malgrange…
We develop in this article an algorithm that, given a projective curve $C$, computes a \textit{gonal map}, that is, a finite morphism from $C$ to the projective line of minimal degree. Our method is based on the computation of scrollar…
We formulate a conjecture on the behavior of the minimal free resolutions of sets of general points on arbitrary varieties embedded by complete linear series, in analogy with the well-known Minimal Resolution Conjecture for points in…
The widespread use of vector graphics creates a significant demand for vectorization methods. While recent learning-based techniques have shown their capability to create vector images of clear topology, filling these primitives with…
We consider a variation of the classical proximal-gradient algorithm for the iterative minimization of a cost function consisting of a sum of two terms, one smooth and the other prox-simple, and whose relative weight is determined by a…
One remaining problem of unitarity cut method for one-loop integral reduction is that tadpole coefficients can not be straightforward obtained through this way. In this paper, we reconsider the problem by applying differential operators…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjective and parametric optimization, computational geometry, and…
Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the \emph{rectangular braid diagram (RBD)} method is proposed to compute the braid monodromy of a completely reducible $n$-gonal curve,…
Computing offsets of curves on parametric surfaces is a fundamental yet challenging operation in computer aided design and manufacturing. Traditional analytical approaches suffer from time-consuming geodesic distance queries and complex…
The computation of first and second-order derivatives is a staple in many computing applications, ranging from machine learning to scientific computing. We propose an algorithm to automatically differentiate algorithms written in a subset…
We propose a new dataset distillation algorithm using reparameterization and convexification of implicit gradients (RCIG), that substantially improves the state-of-the-art. To this end, we first formulate dataset distillation as a bi-level…
In this note we introduce a new randomized algorithm for counting triangles in graphs. We show that under mild conditions, the estimate of our algorithm is strongly concentrated around the true number of triangles. Specifically, if $p \geq…