Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices

1992 ◽  
Vol 57 (1-3) ◽  
pp. 121-143 ◽  
Author(s):  
Ilan Adler ◽  
Peter A. Beling
2021 ◽  
Vol 45 (5) ◽  
pp. 751-759
Author(s):  
REINHARDT EULER ◽  
◽  
LUIS H. GALLARDO ◽  
OLIVIER RAHAVANDRAINY

We prove that there is no circulant Hadamard matrix H with first row [h1,…,hn] of order n > 4, under some linear conditions on the hi’s. All these conditions hold in the known case n = 4, so that our results can be thought as characterizations of properties that only hold when n = 4. Our first conditions imply that some eigenvalue λ of H is a sum of √ -- n terms h jωj, where ω is a primitive n-th root of 1. The same conclusion holds also if some complex arithmetic means associated to λ are algebraic integers (second conditions). Moreover, our third conditions, related to the recent notion of robust Hadamard matrices, implies also the nonexistence of these circulant Hadamard matrices. If some of the conditions fail, it appears (to us) very difficult to be able to prove the result.


Author(s):  
Benson Farb ◽  
Dan Margalit

This chapter focuses on the construction as well as the algebraic and dynamical properties of pseudo-Anosov homeomorphisms. It first presents five different constructions of pseudo-Anosov mapping classes: branched covers, constructions via Dehn twists, homological criterion, Kra's construction, and a construction for braid groups. It then proves a few fundamental facts concerning stretch factors of pseudo-Anosov homeomorphisms, focusing on the theorem that pseudo-Anosov stretch factors are algebraic integers. It also considers the spectrum of pseudo-Anosov stretch factors, along with the special properties of those measured foliations that are the stable (or unstable) foliations of some pseudo-Anosov homeomorphism. Finally, it describes the orbits of a pseudo-Anosov homeomorphism as well as lengths of curves and intersection numbers under iteration.


1991 ◽  
Vol 14 (3) ◽  
pp. 457-462 ◽  
Author(s):  
Clark Kimberling

Associated with any irrational numberα>1and the functiong(n)=[αn+12]is an array{s(i,j)}of positive integers defined inductively as follows:s(1,1)=1,s(1,j)=g(s(1,j−1))for allj≥2,s(i,1)=the least positive integer not amongs(h,j)forh≤i−1fori≥2, ands(i,j)=g(s(i,j−1))forj≥2. This work considers algebraic integersαof degree≥3for which the rows of the arrays(i,j)partition the set of positive integers. Such an array is called a Stolarsky array. A typical result is the following (Corollary 2): ifαis the positive root ofxk−xk−1−…−x−1fork≥3, thens(i,j)is a Stolarsky array.


Sign in / Sign up

Export Citation Format

Share Document