Indecomposable matrices over a distributive lattice

Yi Jia Tan

Displaying similar documents to “Indecomposable matrices over a distributive lattice”

More on the Fibonacci sequence and Hessenberg matrices.

Esmaeili, Morteza (2006)

Integers

Similarity:

The semigroup of fully indecomposable relations and Hall relations

Štefan Schwarz (1973)

Czechoslovak Mathematical Journal

Similarity:

Permanents of Hessenberg (0,1)-matrices.

Olesky, D.D., Shader, Bryan, van den Driessche, P. (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

About the decision of reachability for register machines

Véronique Cortier (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We study the decidability of the following problem: given $p$ affine functions $f_{1}, ..., f_{p}$ over $ℕ^{k}$ and two vectors $v_{1}, v_{2} \in ℕ^{k}$ , is $v_{2}$ reachable from $v_{1}$ by successive iterations of $f_{1}, ..., f_{p}$ (in this given order)? We show that this question is decidable for $p = 1, 2$ and undecidable for some fixed $p$ .

Some norm inequalities for special Gram matrices

Ramazan Türkmen, Osman Kan, Hasan Gökbas (2016)

Special Matrices

Similarity:

In this paper we firstly give majorization relations between the vectors Fn = {f0, f1, . . . , fn−1},Ln = {l0, l1, . . . , ln−1} and Pn = {p0, p1, . . . , pn−1} which constructed with fibonacci, lucas and pell numbers. Then we give upper and lower bounds for determinants, Euclidean norms and Spectral norms of Gram matrices GF=〈Fn,Fni〉, GL=〈Ln,Lni〉, GP=〈Pn,Pni〉, GFL=〈Fn,Lni〉, GFP=〈Fn,Pni〉.