
arXiv: 2411.08994
Positive spanning sets (PSSs) are families of vectors that span a given linear space through non-negative linear combinations. Despite certain classes of PSSs being well understood, a complete characterization of PSSs remains elusive. In this paper, we explore a relatively understudied relationship between positive spanning sets and strongly edge-connected digraphs, in that the former can be viewed as a generalization of the latter. We leverage this connection to define a decomposition structure for positive spanning sets inspired by the ear decomposition from digraph theory.
FOS: Computer and information sciences, 05C20, 05C50, 15A21, 15B99, Discrete Mathematics (cs.DM), Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics - Optimization and Control, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, 05C20, 05C50, 15A21, 15B99, Discrete Mathematics (cs.DM), Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics - Optimization and Control, Computer Science - Discrete Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
