Related papers: A fast algorithm for computing the characteristic …

We provide an algorithm for computing the Euler characteristic of the curves $S_p$ in the space of cubic polynomials, consisting of all polynomials with a periodic critical point of period $p$. The curves were introduced in [Milnor,…

We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…

This work is devoted to computing the centralizer $Z (L)$ of an ordinary differential operator (ODO) in the ring of differential operators. Non-trivial centralizers are known to be coordinate rings of spectral curves and contain the ring of…

We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…

We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from the…

Suppose that $\chi_\lambda$ and $\chi_\mu$ are distinct irreducible characters of the symmetric group $S_n$. We give an algorithm that, in time polynomial in $n$, constructs $\pi\in S_n$ such that $\chi_\lambda(\pi)$ is provably different…

Online linear programming (OLP) has gained significant attention from both researchers and practitioners due to its extensive applications, such as online auction, network revenue management, order fulfillment and advertising. Existing OLP…

We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system…

In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our second fundamental engine after polynomial matrix…

Sparse view computed tomography (CT) reconstruction poses a challenging ill-posed inverse problem, necessitating effective regularization techniques. In this letter, we employ $L_p$-norm ($0<p<1$) regularization to induce sparsity and…

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…

We propose a probabilistic variant of Brill-Noether's algorithm for computing a basis of the Riemann-Roch space $L(D)$ associated to a divisor $D$ on a projective nodal plane curve $\mathcal C$ over a sufficiently large perfect field $k$.…

We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note that the family of paddable languages apparently includes all…

We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.

An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…

Let $p\in\mathbb{Z}[x]$ be an arbitrary polynomial of degree $n$ with $k$ non-zero integer coefficients of absolute value less than $2^\tau$. In this paper, we answer the open question whether the real roots of $p$ can be computed with a…

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

In this paper, we get the sharp bound for $|G/O_p(G)|_p$ under the assumption that either $p^2 \nmid \chi(1)$ for all $\chi \in {\rm Irr}(G)$ or $p^2 \nmid \phi(1)$ for all $\phi \in {\rm IBr}_p(G)$. This would settle two conjectures raised…