Searcharxiv⌕ Search

arXiv subjects

Jean-Marc Sac-Épée

Publications and source records attributed to Jean-Marc Sac-Épée.

6 recordsLinked to original sources

A Priori and A Posteriori Error Estimates for a Crank Nicolson Type Scheme of an Elliptic Problem with Dynamical Boundary Conditions

In this article we claim that we are going to give a priori and a posteriori error estimates for a Crank Nicolson type scheme. The problem is discretized by the finite elements in space. The main result of this paper consists in establishing two types of error indicators, the first one linked to the time discretization and the second one to the space discretization.

math.NA↗

Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration

It is well known that the set of Mahler measures of single variable polynomial has limit points of which a list established by D. Boyd and M. Mossinghoff has been extended through approaches based on genetic algorithms. In this paper, we wish to further extend the list of known limit points by adapting a method of missing data restoration.

math.NT↗

On the existence of Newman and Littlewood multiples for certain integer polynomials

Newman polynomials have coefficients in {0, 1} and constant term 1, whereas Littlewood polynomials have coefficients in {-1, 1}. We study two questions concerning the existence of Newman and Littlewood multiples for certain integer polynomials. For Newman multiples, we revisit a question of Hare and Mossinghoff [6]: whether there exists a real number sigma > 1 such that every P in Z[x] with no nonnegative real root and Mahler measure less than sigma has a Newman multiple. To bound any possible value of sigma from above, we seek polynomials with no nonnegative real root and no Newman multiple, and with Mahler measure as small as possible. Using the updated database of known small-Mahler-measure polynomials up to degree 200 [11], we test, for each listed polynomial p(x), both p(x) and its sign transform p(-x). These two polynomials have the same Mahler measure, but the existence of a Newman multiple is not invariant under the substitution x -> x. After a degree-bounded prefilter formulated as a mixed-integer linear optimization problem, we apply the Hare-Mossinghoff certification procedure to the remaining candidates. This yields 14 irreducible polynomials of Mahler measure less than 1.3, with no nonnegative real root and no Newman multiple. The smallest of their Mahler measures is 1.263095875491..., showing that any such sigma is at most this value. For Littlewood multiples, we return to the three Newman polynomials listed in Table 3 of Drungilas, Jankauskas, Junevicius, Klebonas and Siurys [3], for which the existence of a Littlewood multiple of smallest possible degree was left unresolved. We show that one of them attains this degree, whereas the other two have no Littlewood multiple at either of their first two possible degrees.

math.NT↗

Algorithmic aspects of Newman polynomials and their divisors

We study the problem of determining which integer polynomials divide Newman polynomials. In this vein, we first give results concerning the $8438$ known polynomials with Mahler measure less than $1.3$. We then exhibit a list of polynomials that divide no Newman polynomial. In particular, we show that a degree-10 polynomial of Mahler measure \text{approximately} 1.419404632 divides no Newman polynomial, thereby improving the best known upper bound for any universal constant $σ$, if it exists, such that every integer polynomial of Mahler measure less than $σ$ divides a Newman polynomial. Finally, letting $l(x)$ denote Lehmer's polynomial, we explicitly construct Newman polynomials divisible by $l(x)^2$ with degrees up to $150$, and show that no Newman polynomial is divisible by $l(x)^3$ up to degree $160$.

math.NT↗

Salem numbers less than 49/37

A certain number of lists of small Salem numbers, some of which are certified as complete, are available online. Notably, the website of M. J. Mossinghoff features a list of 47 Salem numbers smaller than 1.3, as well as complete lists of Salem numbers of fixed degrees that are smaller than various bounds. The objective of this work is to advance the understanding of Salem numbers by providing a list of Salem numbers smaller than a threshold of 49/37 (≈ 1.324324) through the implementation of a method based on integer linear programming and uniform sampling of root separators. Beyond the intrinsic interest of the newly detected Salem numbers, the rediscovery of already known Salem numbers through this alternative method could offer valuable insights into the potential completeness of already existing lists for degrees where it has not yet been proven.

math.NT↗

Small degree Salem numbers with trace -3

The contribution of this work is to provide tables of Salem numbers with trace -3 and small degrees, namely degrees 2d = 34, 36, 38, and 40. The implemented method also generates a list of totally positive polynomials of degrees d = 17, 18, 19, and 20, with trace 2d - 3, a single root strictly greater than 4, and all other roots strictly between 0 and 4.

math.NT↗