𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving XXtr = A over the integers

✍ Scribed by W. Plesken

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
791 KB
Volume
226-228
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving Hankel Systems over the Integers
Solving Hankel Systems over the Integers
✍ Luca Gemignani 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 351 KB

A new algorithm is presented for computing the solution of a Hankel system with integer entries by means of structured matrix techniques. By combining subresultant theory and factorization properties of Hankel matrices, we prove that this algorithm has a Boolean sequential cost which is almost optim

Cyclic Codes over the Integers Modulopm
Cyclic Codes over the Integers Modulopm
✍ Pramod Kanwar; Sergio R. López-Permouth 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 430 KB

The purpose of this paper is twofold. First, we generalize the results of Pless and Qian and those of Pless, Sole ´, and Qian for cyclic ‫ޚ‬ 4 -codes to cyclic ‫ޚ‬ p m -codes. Second, we establish connections between this new development and the results on cyclic ‫ޚ‬ p m -codes obtained by Calderban

Sum graphs over all the integers
Sum graphs over all the integers
✍ Frank Harary 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We introduced the sum graph of a set S of positive integers as the graph G+(S) having S as its node set, with two nodes adjacent whenever their sum is in S. Now we study sum graphs over all the integers so that S may contain positive or negative integers on zero. A graph so obtained is called an int