✦ LIBER ✦

Description of posets critical with respect to the nonnegativity of the quadratic Tits form

✍ Scribed by V. M. Bondarenko; M. V. Stepochkina

Publisher: Springer
Year: 2009
Tongue: English
Weight: 189 KB
Volume: 61
Category: Article
ISSN: 0041-5995
DOI: 10.1007/s11253-009-0245-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On weak critical posets with respect to

On weak critical posets with respect to the positive definiteness of a quadratic tits form

✍ A. M. Polishchuk 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 130 KB

The use of quadratic forms to study the

The use of quadratic forms to study the stability with respect to part of the variables

✍ A.S. Oziraner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Description of the canonical coefficient

Description of the canonical coefficients of the restriction of a quadratic form to a subspace of finite codimension

✍ V. V. Vlasov 📂 Article 📅 1980 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 264 KB

Asymptotics of small deviations of the B

Asymptotics of small deviations of the Bogoliubov processes with respect to a quadratic norm

✍ R. S. Pusev 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 402 KB

A characterization of Jordan canonical f

A characterization of Jordan canonical forms which are similar to eventually nonnegative matrices with the properties of nonnegative matrices

✍ Boris G Zaslavsky; Judith J McDonald 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 282 KB

In this paper we give necessary and sufficient conditions for a matrix in Jordan canonical form to be similar to an eventually nonnegative matrix whose irreducible diagonal blocks satisfy the conditions identified by Zaslavsky and Tam, and whose subdiagonal blocks (with respect to its Frobenius norm

On the Number of Edges in Hypergraphs Cr

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings

✍ Alexandr V. Kostochka; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 94 KB

A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph (G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-cr