Related papers: There are Salem numbers of every trace
Suppose that $A,B \in {\rm PSL}(2,\mathbb{R})$ generate a discrete and free group of rank 2, and let $m,n\ge 1$. We consider subgroups $\langle R,S\rangle$ of ${\rm PSL}(2,\mathbb{R})$ generated by roots of $A$ and $B$, i.e., by elements…
The problem of constructing polynomials with all coefficients $1$ or $-1$ and large merit factor (equivalently with small $L^4$ norm on the unit circle) arises naturally in complex analysis, condensed matter physics, and digital…
Bateman and Duquette have initiated the study of Salem elements in positive characteristic. This work extends their results to 2-Salem elements whose minimal polynomials are of the type $Y^n + \lambda_{n-1}Y^{n-1} + \ldots+\lambda_1Y +…
All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
It is shown that the set of decimal palindromes is an additive basis for the natural numbers. Specifically, we prove that every natural number can be expressed as the sum of forty-nine (possibly zero) decimal palindromes.
We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials,…
We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…
A noncommutative (nc) polynomial is called (globally) trace-positive if its evaluation at any tuple of operators in a tracial von Neumann algebra has nonnegative trace. Such polynomials emerge as trace inequalities in several matrix or…
Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the…
We investigate an infinite sequence of polynomials of the form: \[a_0T_{n}(x)+a_{1}T_{n-1}(x)+\cdots+a_{m}T_{n-m}(x)\] where $(a_0,a_1,\ldots,a_m)$ is a fixed m-tuple of real numbers, $a_0,a_m\ne0$, $T_i(x)$ are Chebyshev polynomials of the…
Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the…
In this article, we construct an arithmetic hyperbolic $6-$orbifold $\mathcal{O}$ such that, any square-rootable Salem number of degree at most $4$ over $\mathbb{Q}$ is realized as the exponential of the length of a closed geodesic in…
By the classical Sturm's theorem, the number of distinct real roots of a given real polynomial $f(x)$ within any interval $(a,b]$ can be expressed by the number of variations in the sign of the Sturm chain at the bounds. Through…
We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log |A|)^{1/2-\varepsilon}$. This gives the…
Specification languages are essential in deductive program verification, but they are usually based on first-order logic, hence less expressive than the programs they specify. Recently, trace specification logics with fixed points that are…
We construct large subsets of the first $N$ positive integers which avoid certain arithmetic configurations. In particular, we construct a set of order $N^{0.7685}$ lacking the configuration $\{x,x+y,x+y^2\},$ surpassing the $N^{3/4}$ limit…
We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…
Traces of inverse powers of a positive definite symmetric tridiagonal matrix give lower bounds of the minimal singular value of an upper bidiagonal matrix. In a preceding work, a formula for the traces which gives the diagonal entries of…
The reversal of a positive integer $A$ is the number obtained by reading $A$ backwards in its decimal representation. A pair $(A,B)$ of positive integers is said to be palindromic if the reversal of the product $A \times B$ is equal to the…