๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Nilpotent sign patterns of a given index

โœ Scribed by Zejun Huang

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
120 KB
Volume
434
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sign patterns allowing nilpotence of ind
Sign patterns allowing nilpotence of index 3
โœ Yubin Gao; Zhongshan Li; Yanling Shao ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

Suppose P is a property referring to a real matrix. We say that a sign pattern A allows P if there exists at least one matrix with the same sign pattern as A that has the property P. In this paper, we study sign patterns allowing nilpotence of index 3. Four methods for constructing sign patterns tha

Sign patterns of inverse-positive matric
Sign patterns of inverse-positive matrices
โœ Charles R. Johnson; Frank Thomson Leighton; Herbert A. Robinson ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 411 KB
On the Number of Permutations Avoiding a
On the Number of Permutations Avoiding a Given Pattern
โœ Noga Alon; Ehud Friedgut ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 118 KB

Let \_ # S k and { # S n be permutations. We say { contains \_ if there exist Stanley and Wilf conjectured that for any \_ # S k there exists a constant c=c(\_) such that F(n, \_) c n for all n. Here we prove the following weaker statement: For every fixed \_ # S k , F(n, \_) c n#\* (n) , where c=c