What the study found
The authors give complete characterizations of entrywise transforms of rectangular matrices that preserve sign regularity and strict sign regularity, including versions with a specified sign pattern.
Why the authors say this matters
The study suggests these results extend earlier work on matrix positivity and on totally positive and totally non-negative matrices, and place sign regularity within a broader line of entrywise-preserver results.
What the researchers tested
The paper studies entrywise functions acting on rectangular matrices. It focuses on preserving strictly sign regular and sign regular matrices, and also on preserving these properties when a sign pattern is fixed.
What worked and what didn't
The main results are the complete characterizations for the two preservation settings described in the abstract: sign regularity and strict sign regularity, with and without a given sign pattern. The abstract does not describe any failures or negative cases beyond these classification results.
What to keep in mind
The abstract does not provide the detailed forms of the characterizing functions or the precise conditions under which they apply. It also does not state limitations beyond the scope of rectangular matrices and the matrix classes named in the abstract.
Key points
- The paper gives complete characterizations of entrywise transforms preserving sign regularity and strict sign regularity.
- It also treats preservation when the matrices have a given sign pattern.
- The work builds on earlier results about positive semidefinite, totally positive, and totally non-negative matrices.
- The abstract identifies sign regularity as a class first studied by Schoenberg in 1930.
Disclosure
- Research title:
- Entrywise preservers of sign regularity are fully characterized
Get the weekly research newsletter
Stay current with peer-reviewed research without reading academic papers — one filtered digest, every Friday.