2000 character limit reached
Classification of families of pr- and epr-sequences
Published 23 Jun 2016 in math.CO | (1606.07495v2)
Abstract: This paper establishes new restrictions for attainable enhanced principal rank characteristic sequences (epr-sequences). These results are then used to classify two related families of sequences that are attainable by a real symmetric matrix: the family of principal rank characteristic sequences (pr-sequences) not containing three consecutive $1$s and the family of epr-sequences which contain an $\tt{N}$ in every subsequence of length $3$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.