Related papers: Symbolic Computations of First Integrals for Polyn…
While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
Here we present an algorithm to find elementary first integrals of rational second order ordinary differential equations (SOODEs). In \cite{PS2}, we have presented the first algorithmic way to deal with SOODEs, introducing the basis for the…
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
We present a geometric algorithm for obtaining consistent solutions to systems of partial differential equations, mainly arising from singular covariant first-order classical field theories. This algorithm gives an intrinsic description of…
The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.
We study Riemannian metrics on 2-surfaces with integrable geodesic flows such that an additional first integral is high-degree polynomial in momenta. This problem reduces to searching for solutions to certain quasi-linear systems of PDEs…
In this paper we propose a direct and explicit realization of addition of divisors by means of an iterative reduction algorithm. Each iteration of the algorithm is the reduction of a degree $g+1$ divisor to a divisor of degree~$g$. Such an…
We introduce a refinement of the classical Liouville function to primes in arithmetic progressions. Using this, we discover new biases in the appearances of primes in a given arithmetic progression in the prime factorizations of integers.…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
Properties of partial integrals such as real and complex-valued polynomial, multiple polynomial, exponential, and conditional for ordinary differential systems are studied. The possibilities of constructing first integrals and last…
Given a non-zero polynomial $f$ in a polynomial ring $R$ with coefficients in a finite field of prime characteristic $p$, we present an algorithm to compute a differential operator $\delta$ which raises $1/f$ to its $p$th power. For some…
We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…
We study first-order ordinary differential equations such that the intrinsic Gauss curvature of the associated surface depends only on the independent variable: $\mathcal{K}(x,u)=\kappa(x)$, showing that this geometrically motivated class…
We exhibit a condition-based analysis of the adaptive subdivision algorithm due to Plantinga and Vegter. The first complexity analysis of the PV Algorithm is due to Burr, Gao and Tsigaridas who proved a $O\big(2^{\tau d^{4}\log d}\big)$…
We present two modified versions of the primal-dual splitting algorithm relying on forward-backward splitting proposed in \cite{vu} for solving monotone inclusion problems. Under strong monotonicity assumptions for some of the operators…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
The paper studies the complex 1-dimensional polynomial vector fields with real coefficients under topological orbital equivalence preserving the separatrices of the pole at infinity. The number of generic strata is determined, and a…
We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a…
All Darboux integrable difference equations on the quad-graph are described in the case of the equations that possess autonomous first-order integrals in one of the characteristics. A generalization of the discrete Liouville equation is…