Related papers: Newton polygons and p-integral bases
We consider an analogue of Artin's primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of…
We explain how to encode an algebraic series by finite data and how to do effective arithmetic on the level of these encodings. The reasoning is based on the Newton-Puiseux algorithm and an effective equality test for algebraic series.…
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…
In many physical problems or applications one has to study functions that are invariant under the action of a symmetry group G and this is best done in the orbit space of G if one knows the equations and inequalities defining the orbit…
We use only addition and multiplication to construct the primitive roots of $p^{k+1}$ from the primitive roots of $p^{k}$, where $p$ is an odd prime and $k$ is at least 2.
We present an explicit basis for orders of arbitrary level N>1 in definite rational quaternion algebras. These orders have applications to computations of spaces of elliptic and quaternionic modular forms.
This paper concerns a class of orbital integrals in Lie algebras over p-adic fields. The values of these orbital integrals at the unit element in the Hecke algebra count points on varieties over finite fields. The construction, which is…
About global and local algebraic integrability of ovals. A contribution to clarify Newton results and relative comments on his work done by Arnol'd and Pourciau. A possibile application to air damper sections computation is offered, as…
This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…
We consider infinite parametric families of high degree number fields composed of quadratic fields with pure cubic, pure quartic, pure sextic fields and with the so called simplest cubic, simplest quartic fields. We explicitly describe an…
In this work, we present some new integration formulas for any order of accuracy as an application of the B-spline relations obtained in [1]. The resulting rules are defined as a perturbation of the trapezoidal integration method. We prove…
The concept of p-ordering for a prime p was introduced by Manjul Bhargava (in his PhD thesis) to develop a generalized factorial function over an arbitrary subset of integers. This notion of p-ordering provides a representation of…
We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.
In this note we shall introduce a simple, effective numerical method for solving partial differential equations for scalar and vector-valued data defined on surfaces. Even though we shall follow the traditional way to approximate the…
We investigate the distribution of $\alpha p$ modulo one in imaginary quadratic number fields $\mathbb{K}\subset\mathbb{C}$ with class number one, where $p$ is restricted to prime elements in the ring of integers $\mathcal{O} =…
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
In this paper we compute the first vertex of a generic Newton polygon in some special cases, and the corresponding Hasse polynomial. This allows us to show the nonexistence of $p$-cyclic coverings of the projective line in characteristic…
For prime $p\equiv-1\bmod d$ and $q$ a power of $p$, we obtain the slopes of the $q$-adic Newton polygons of $L$-functions of $x^d+ax^{d-1}\in \mathbb{F}_q[x]$ with respect to finite characters $\chi$ when $p$ is larger than an explicit…
In our recent paper we gave an efficient algorithm to calculate "small" solutions of relative Thue equations (where "small" means an upper bound of type $10^{500}$ for the sizes of solutions). Here we apply this algorithm to calculating…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…