Related papers: Computing Hypercircles by Moving Hyperplanes
In previous work we determined automorphism groups of cyclic algebraic curves defined over fields of any odd characteristic. In this paper we determine parametric equations of families of curves for each automorphism group for such curves.
The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…
Demonstrating quantum advantage in machine learning tasks requires navigating a complex landscape of proposed models and algorithms. To bring clarity to this search, we introduce a framework that connects the structure of parametrized…
To harness the potential of noisy intermediate-scale quantum devices, it is paramount to find the best type of circuits to run hybrid quantum-classical algorithms. Key candidates are parametrized quantum circuits that can be effectively…
We provide an algebraic framework to compute smallest enclosing and smallest circumscribing cylinders of simplices in Euclidean space $\E^n$. Explicitly, the computation of a smallest enclosing cylinder in $\mathbb{E}^3$ is reduced to the…
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By…
For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…
We prove two formulae which express the Alexander polynomial $\Delta^C$ of several variables of a plane curve singularity $C$ in terms of the ring ${\cal O}_{C}$ of germs of analytic functions on the curve. One of them expresses $\Delta^C$…
Let C be a supersingular genus-2 curve over an algebraically closed field of characteristic 3. We show that if C is not isomorphic to the curve y^2 = x^5 + 1 then up to isomorphism there are exactly 20 degree-3 maps phi from C to the…
Let $G$ be a graph, $C$ a longest cycle in $G$ and $\overline{p}$, $\overline{c}$ the lengths of a longest path and a longest cycle in $G\backslash C$, respectively. Almost all lower bounds for the circumference base on a standard…
Computing a minimum path cover (MPC) of a directed acyclic graph (DAG) is a fundamental problem with a myriad of applications, including reachability. Although it is known how to solve the problem by a simple reduction to minimum flow,…
The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least…
In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…
We propose a method for calculating cohomology operations for finite simplicial complexes. Of course, there exist well--known methods for computing (co)homology groups, for example, the reduction algorithm consisting in reducing the…
A linear series on a curve C in $P^3$ is "primary" when it does not contain the series cut by planes. We provide a lower bound for the degree of these series, in terms of deg(C), g(C) and of the number $s = min{i: h^0(I_C(i))\neq 0}$; as a…
We study minimum degree conditions under which a graph $G$ contains $k$th powers of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of $G$ is large. This extends a result of Allen,…
We present recursive formulas which compute the recently defined "higher symplectic capacities" for all convex toric domains. In the special case of four-dimensional ellipsoids, we apply homological perturbation theory to the associated…
In the context of sparse principal component detection, we bring evidence towards the existence of a statistical price to pay for computational efficiency. We measure the performance of a test by the smallest signal strength that it can…
Given a smooth plane curve $\overline{C}$ of genus $g\geq 3$ over an algebraically closed field $\overline{k}$, a field $L\subseteq\overline{k}$ is said to be a \emph{plane model-field of definition for $\overline{C}$} if $L$ is a field of…
We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.