Related papers: A Division Algorithm Approach to $p$-Adic Sylveste…

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

Continued fractions have been generalized over the field of $p$-adic numbers, where it is still not known an analogue of the famous Lagrange's Theorem. In general, the periodicity of $p$-adic continued fractions is well studied and…

The mathematical basis of p-adic Higgs mechanism discussed in papers [email protected] 9410058-62 is considered in this paper. The basic properties of p-adic numbers, of their algebraic extensions and the so called canonical…

In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…

Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been…

It may be possible to extend the Grover search algorithm by taking a divide and conquer approach using auxiliary solutions to achieve an exponential speed-up.

We introduce Sieve-SDP, a simple facial reduction algorithm to preprocess semidefinite programs (SDPs). Sieve-SDP inspects the constraints of the problem to detect lack of strict feasibility, deletes redundant rows and columns, and reduces…

Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to…

Multidimensional continued fractions (MCFs) were introduced by Jacobi and Perron in order to obtain periodic representations for algebraic irrationals, as it is for continued fractions and quadratic irrationals. Since continued fractions…

Collective communications are ubiquitous in parallel applications. We present two new algorithms for performing a reduction. The operation associated with our reduction needs to be associative and commutative. The two algorithms are…

This survey paper, to appear in he proceedings of the Miami Winter School ``Geometric Methods in Algebra and Number Theory'', is concerned with extending classical results \`a la Ax-Kochen-Er{\v{s}}ov to $p$-adic integrals in a motivic…

In the paper, using the extended fermionic $p$-adic integral on $\mathbb{Z}_p$, the authors find some applications of the umbral calculus. From these applications, the authors derive some identities on the weighted Euler numbers and…

We prove that two infinite p-adic semi-algebraic sets are isomorphic (i.e. there exists a semi-algebraic bijection between them) if and only if they have the same dimension.

Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…

By means of a generalization of the S-expansion method we construct a procedure to obtain expanded higher-order Lie algebras. It is shown that the direct product between an Abelian semigroup S and a higher-order Lie algebra…

The purpose of this article is to newly define the $p$-adic polylogarithm as an equivariant class in the cohomology of a certain infinite disjoint union of algebraic tori associated to a totally real field. We will then express the special…

Numerical interpolation techniques are widely employed for calculating large rational functions in scattering amplitude computations. It has been observed in recent years that these rational functions greatly simplify upon partial…

We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…

Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those algorithms in the literature often obscures the essence of…

For a given point P in the group of K-rational points E(K) of an elliptic curve, we consider the sequence of values (F_1(P),F_2(P),F_3(P),...) of the division polynomials of E at P. If K is a finite field, we prove that the sequence is…