University of Wyoming Open Journals
Not a member yet
3193 research outputs found
Sort by
Volume 3 Issue 2: Editorial Introduction to the Indigenous Special Issue of the Journal of Working-Class Studies
No full textThe Work Arts and Crafts Do
No full textThis essay forms part of a suite of papers focused on work and belonging on the Wind River Reservation. This essay attempts to interrogate multiple meanings attached to work, by Native people and non-Indians, and across multiple work environments
Commutators Involving Matrix Functions
No full textSome results are obtained for matrix commutators involving matrix exponentials and their norms
AE Regularity of Interval Matrices
No full textConsider a linear system of equations with interval coefficients, and each interval coefficient is associated with either a universal or an existential quantifier. The AE solution set and AE solvability of the system is defined by ââ- quantification. The paper deals with the problem of what properties must the coefficient matrix have in order that there is guaranteed an existence of an AE solution. Based on this motivation, a concept of AE regularity is introduced, which implies that the AE solution set is nonempty and the system is AE solvable for every right-hand side. A characterization of AE regularity is discussed, and also various classes of matrices that are implicitly AE regular are investigated. Some of these classes are polynomially decidable, and therefore give an efficient way for checking AE regularity. Eventually, there are also stated open problems related to computational complexity and characterization of AE regularity
Norm Inequalities Related to Clarkson Inequalities
No full textLet and be matrices. It is shown that if , 4\leq p<\infty, or $2 < p <
Some Graphs Determined By Their Distance Spectrum
No full textLet be a connected graph with order . Let be the distance spectrum of . In this paper, it is shown that the complements of and are determined by their -spectrum. Moreover, it is shown that the cycle ( odd) is also determined by its -spectrum
Inequalities between and
No full textLet and be complex square matrices. Some inequalities between and are established. Applications of these inequalities are also given. For example, in the Frobenius norm, \parallel\, A+B \,\parallel_{F} \leq \sqrt[4]{2} \parallel \mid A\mid + \mid B\mid \, \parallel_{F}. $
Ordering cacti with signless Laplacian spread
No full textA cactus is a connected graph in which any two cycles have at most one vertex in common. The signless Laplacian spread of a graph is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the associated signless Laplacian matrix. In this paper, all cacti of order n with signless Laplacian spread greater than or equal to n - 1/2 are determined
Mangled Coding: Class in the Poems of Santee Frazier
No full textSantee Frazier’s 2009 collection, Dark Thirty reveals a text that can be largely read in the genre context of Native American poetry, around signifiers of poverty. Though Frazier passionately denies that his poems are constructed on a thematic basis, his curation of them in this collection does nevertheless add up to a coherent argument for interpreting his characters’ lives as specifically working-class lives, subject to interlocking and international forces of capital, displacement and documentation in a surveillance state
Average Mixing Matrix of Trees
No full textThe rank of the average mixing matrix of trees with all eigenvalues distinct, is investigated. The rank of the average mixing matrix of a tree on n vertices with n distinct eigenvalues is bounded above by [n/2]. Computations on trees up to 20 vertices suggest that the rank attains this upper bound most of the time. An infinite family of trees whose average mixing matrices have ranks which are bounded away from this upper bound, is given. A lower bound on the rank of the average mixing matrix of a tree, is also given