Related papers: Computing Pretropisms for the Cyclic n-Roots Probl…
We present two effective tools for computing the positive tropicalization of algebraic varieties. First, we outline conditions under which the initial ideal can be used to compute the positive tropicalization, offering a real analogue to…
Cyclic curves, i.e. curves fixed by a cyclic collineation group, play a central role in the investigation of cyclic arcs in Desarguesian projective planes. In this paper, the genus of a cyclic curve arising from a cyclic k-arc of Singer…
To determine the global root number of an elliptic curve defined over a number field, one needs to understand all the local root numbers. These have been classified except at places above 2, and in this paper we attempt to complete the…
We present an algorithm for detecting basepoints of linear series of curves in the plane. Moreover, we give an algorithm for constructing a linear series of curves in the plane for given basepoints. The underlying method of these algorithms…
We propose a new method for the evaluation of intersection numbers for twisted meromorphic $n$-forms, through Stokes' theorem in $n$ dimensions. It is based on the solution of an $n$-th order partial differential equation and on the…
Cubic and quartic non-autonomous differential equations with continuous piecewise linear coefficients are considered. The main concern is to find the maximum possible multiplicity of periodic solutions. For many classes, we show that the…
In this article, we establish necessary and sufficient conditions for a polynomial of degree $n$ to have exactly $n$ real roots. A complete study of polynomials of degree five is carried out. The results are compared with those obtained…
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
For a set of curves, Ahn et al. introduced the notion of a middle curve and gave algorithms computing these with run time exponential in the number of curves. Here we study the computational complexity of this problem: we show that it is…
We study a general method of the field intersection problem of generic polynomials over an arbitrary field $k$ via formal Tschirnhausen transformation. In the case of solvable quintic, we give an explicit answer to the problem by using…
Let $C$ be a non-hyperelliptic algebraic curve. It is known that its canonical image is the intersection of the quadrics that contain it, except when $C$ is trigonal (that is, it has a linear system of degree 3 and dimension 1) or…
We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…
Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.
Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…
A numerical technique used to solve boundary value problems is modified to find periodic steady-state solutions of nonautonomous dynamical systems. The technique uses a matrix representation of the time derivative obtained through…
This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called…
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root.…
We consider the reduction of an elliptic curve defined over the rational numbers modulo primes in a given arithmetic progression and investigate how often the subgroup of rational points of this reduced curve is cyclic as a special case of…
We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…
The two subjects in the title are related via the specialization of symmetric polynomials at roots of unity. Let $f(z_1,\ldots,z_n)\in\mathbb{Z}[z_1,\ldots,z_n]$ be a symmetric polynomial with integer coefficients and let $\omega$ be a…