Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  rank
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Rank and spectral multiplicity

100%
EN
For a dynamical system (X,T,μ), we investigate the connections between a metric invariant, the rank r(T), and a spectral invariant, the maximal multiplicity m(T). We build examples of systems for which the pair (m(T),r(T)) takes values (m,m) for any integer m ≥ 1 or (p-1, p) for any prime number p ≥ 3.
2
Content available remote

Inverse limit of M -cocycles and applications

100%
EN
For any m, 2 ≤ m < ∞, we construct an ergodic dynamical system having spectral multiplicity m and infinite rank. Given r > 1, 0 < b < 1 such that rb > 1 we construct a dynamical system (X, B, μ, T) with simple spectrum such that r(T) = r, F*(T) = b, and $#C(T)/wcl{T^n: n ∈ ℤ} = ∞$
EN
We investigate the convex invariants associated with two-path convexity in clone-free multipartite tournaments. Specifically, we explore the relationship between the Helly number, Radon number and rank of such digraphs. The main result is a structural theorem that describes the arc relationships among certain vertices associated with vertices of a given convexly independent set. We use this to prove that the Helly number, Radon number, and rank coincide in any clone-free bipartite tournament. We then study the relationship between Helly independence and Radon independence in clone-free multipartite tournaments. We show that if the rank is at least 4 or the Helly number is at least 3, then the Helly number and the Radon number are equal.
EN
For a rank-1 matrix $A = a ⊗ b^{t}$ over max algebra, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over max algebra. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices if and only if it has the form T(A) = U ⊗ A ⊗ V, or $T(A) = U ⊗ A^{t} ⊗ V$ with some monomial matrices U and V.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.