Related papers: Salem numbers less than 49/37
The relationship between Salem numbers and short geodesics has been fruitful in quantitative studies of arithmetic hyperbolic orbifolds, particularly in dimensions 2 and 3. In this article, we push these connections even further. The…
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,…
We prove that there exist Salem numbers with trace $-3$ and every even degree $\geq 34$. Our proof combines a theoretical approach, which allows us to treat all sufficiently large degrees, with a numerical search for small degrees. Since it…
The set of Salem numbers is proved to be bounded from below by $\theta_{31}^{-1}= 1.08544\ldots$ where $\theta_{n}$, $ n \geq 2$, is the unique root in $(0,1)$ of the trinomial $-1+x+x^n$. Lehmer's number $1.176280\ldots$ belongs to the…
In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - with linear-sized alphabets. More precisely, we prove that,…
We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…
Sum-rank Hamming codes are introduced in this work. They are essentially defined as the longest codes (thus of highest information rate) with minimum sum-rank distance at least $ 3 $ (thus one-error-correcting) for a fixed redundancy $ r $,…
I survey results about, and recent applications of, Salem numbers.
We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval $[0,1]$. We implement algorithms from semi-infinite programming and a branch and bound algorithm to…
We give a complete classification of all Salem polynomials of length 5. For length 6 we show that all but finitely many Salem polynomials lie in one of 12 infinite families, and subject to Lehmer's Conjecture we give a complete list of the…
We present a necessary and sufficient condition for a root greater than unity of a monic reciprocal polynomial of an even degree at least four, with integer coefficients, to be a Salem number. We determine the probability of fulfillment the…
Cohen, Lewin and Zagier found four ladders that entail the polylogarithms ${\rm Li}_n(\alpha_1^{-k}):=\sum_{r>0}\alpha_1^{-k r}/r^n$ at order $n=16$, with indices $k\le360$, and $\alpha_1$ being the smallest known Salem number, i.e. the…
Insdel errors occur in communication systems caused by the loss of positional information of the message. Since the work by Guruswami and Wang, there have been some further investigations on the list decoding of insertion codes, deletion…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
In a recent paper, Brakensiek, Gopi and Makam introduced higher order MDS codes as a generalization of MDS codes. An order-$\ell$ MDS code, denoted by $\operatorname{MDS}(\ell)$, has the property that any $\ell$ subspaces formed from…
Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method was developed to find asymptotic results for very large graphs, so it seems that the method is not suitable for finding small…
We construct six new explicit families of linear maximum sum-rank distance (MSRD) codes, each of which has the smallest field sizes among all known MSRD codes for some parameter regime. Using them and a previous result of the author, we…
By extending a construction due to Gross and McMullen [2], we show that for any odd integer n and for any even integer d>n+2 there are infinitely many Salem numbers $\alpha$ of degree d such that $\alpha^n-1$ is a unit. A similar result is…
We derive and implement a new way to find lower bounds on the smallest limiting trace-to-degree ratio of totally positive algebraic integers and improve the previously best known bound to 1.80203. Our method adds new constraints to Smyth's…