Related papers: Detecting squarefree numbers

We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…

Let $\epsilon > 0$ be sufficiently small and let $0 < \eta < 1/522$. We show that if $X$ is large enough in terms of $\epsilon$ then for any squarefree integer $q \leq X^{196/261-\epsilon}$ that is $X^{\eta}$-smooth one can obtain an…

In this note, we prove by using T. Estermann's and S. Dimitrov's arguments with an elementary inequality that there are infinitely many $n$ for which all of the numbers $n^2+1,n^2+2$ and $n^2+3$ are squarefree. We also improve the error…

For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this…

In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…

We determine the density of integral binary forms of given degree that have squarefree discriminant, proving for the first time that the lower density is positive. Furthermore, we determine the density of integral binary forms that cut out…

In [5, 6] it has been proved that the ring of quasisymmetric functions over the integers is free polynomial, see also [4]. This is a matter that has been of great interest since 1972; for instance because of the role this statement plays in…

We prove explicit asymptotic formulae for some functions used in sieve methods and show that there exists no odd multiperfect number of abundancy four whose squared part is cubefree.

We show that all perfect odd integer squares not divisible by 3, can be usefully written as sqrt(N) = a + 18p, where the constant a is determined by the basic properties of N. The equation can be solved deterministically by an efficient…

We give a complete list of square-free Cremona maps with at most six variables, up to equivalence classes. We also build an algorithm to count monomial square-free Cremona transformations. Using this algorithm, we obtain a complete list of…

An asteroidal triple free graph is a graph such that for every independent triple of vertices no path between any two avoids the third. In a recent result from Corneil and Stacho, these graphs were characterised through a linear vertex…

In this paper we introduce squarefree vertex cover algebras. We study the question when these algebras coincide with the ordinary vertex cover algebras and when these algebras are standard graded. In this context we exhibit a duality…

This article deals with the problem of functional classification for L2-valued random covariates when some of the covariates may have missing or unobservable fragments. Here, it is allowed for both the training sample as well as the new…

In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to…

Let $r,m$ be positive integers. Let $0\le x <1$ be a rational number. Let $\Phi_s(x,z)$ be the $s$-th Lerch function $\sum_{k=0}^{\infty}\tfrac{z^{k+1}}{(k+x+1)^s}$ with $s=1,2,\ldots ,r$. When $x=0$, this is the polylogarithmic function.…

In this paper, we consider a variant of Tur\'an's problem on the distance from an integer polynomial in $\mathbb{Z}[x]$ to the nea\-rest irreducible polynomial in $\mathbb{Z}[x]$. We prove that for any polynomial $f \in \mathbb{Z}[x]$,…

Let $\Sigma$ be an $n$-vertex controllable or almost controllable signed bipartite graph, and let $\Delta_\Sigma$ denote the discriminant of its characteristic polynomial $\chi(\Sigma; x)$. We prove that if (\rmnum{1}) the integer $2^{…

A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of…

Let $u \shuffle v$ denote the set of all shuffles of the words $u$ and $v$. It is shown that for each integer $n \geq 3$ there exists a square-free ternary word $u$ of length $n$ such that $u\shuffle u$ contains a square-free word. This…

We computationally verify that if $L(s,\chi)$ is a quadratic Dirichlet $L$-function modulo $q \leq 10^{10}$ then $L(\sigma,\chi) \neq 0$ for real $\sigma \ge 1-1/(5\log q)$. The number of verified moduli exceeds benchmarks due to Watkins…