Related papers: Small degree Salem numbers with trace -3

Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…

We explicitly determine the values of reduced cyclotomic periods of order $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. These evaluations are applied to obtain explicit factorizations of the corresponding…

Suppose $f(x,y)$ is a binary form of degree $d$ with coefficients in a field $K \subseteq \mathbb C$. The $K$-rank of $f$ is the smallest number of $d$-th powers of linear forms over $K$ of which $f$ is a $K$-linear combination. We prove…

A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…

We show that all knots up to $6$ crossings can be represented by polynomial knots of degree at most $7$, among which except for $5_2, 5_2^*, 6_1, 6_1^*, 6_2, 6_2^*$ and $6_3$ all are in their minimal degree representation. We provide…

The graph parameter treedepth is minor-monotone; hence, the class of graphs with treedepth at most $k$ is minor-closed. By the Graph Minor Theorem, such a class is characterized by a finite set of forbidden minors. A conjecture of…

The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…

Polynomials with all the coefficients in $\{ 0,1\}$ and constant term 1 are called Newman polynomials, whereas polynomials with all the coefficients in $\{ -1,1\}$ are called Littlewood polynomials. By exploiting an algorithm developed…

An L(2, 1)-labeling of a graph is an assignment of nonnegative integers to the vertices of G such that adjacent vertices receive numbers differed by at least 2, and vertices at distance 2 are assigned distinct numbers. The L(2, 1)-labeling…

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…

In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial $f_0 \in \F_2 [x]$. If $f_0$ is of degree $n = 2^l \cdot m$, where $m$ is odd and $l$ is a non-negative integer,…

In relation to Hall's conjecture, a new algorithm is presented to search for small k = |x^3 -y^2| values. Thirteen new values of k < x^(1/2) are reported.

Let S(n) be the set of all polynomials of degree n with all roots in the unit disk, and define d(P) to be the maximum of the distances from each of the roots of a polynomial P to that root's nearest critical point. In this notation,…

This article extends Bayer-Fluckiger's theorem on characteristic polynomials of isometries on an even unimodular lattice to the case where the isometries have determinant $-1$. As an application, we show that the logarithm of every Salem…

We study the probabilistic degree over reals of the OR function on $n$ variables. For an error parameter $\epsilon$ in (0,1/3), the $\epsilon$-error probabilistic degree of any Boolean function $f$ over reals is the smallest non-negative…

For $k\geq 2$, we derive an asymptotic formula for the number of zeros of the forms $\prod_{i=1}^{k}(x_{2i-1}^2+x_{2i}^2)+\prod_{i=1}^{k}(x_{2k+2i-1}^2+x_{2k+2i}^2)-x_{4k+1}^{2k}$ and…

We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…

We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).

Let $p>5$ be a prime. We prove congruences modulo $p^{3-d}$ for sums of the general form $\sum_{k=0}^{(p-3)/2}\binom{2k}{k}t^k/(2k+1)^{d+1}$ and $\sum_{k=1}^{(p-1)/2}\binom{2k}{k}t^k/k^d$ with $d=0,1$. We also consider the special case…