Wyoming Scholars RepositoryCopyright (c) 2018 University of Wyoming All rights reserved.
http://repository.uwyo.edu
Recent documents in Wyoming Scholars Repositoryen-usMon, 23 Apr 2018 03:13:39 PDT3600Whiteness Isn't an Accident: How My Irish Family Became White
http://repository.uwyo.edu/sjrc_awards/51
http://repository.uwyo.edu/sjrc_awards/51Wed, 18 Apr 2018 13:49:11 PDT
During her ten day trip to Ireland and Northern Ireland, scholar and creative writer Sarah Duncan examined, through exploring her own Irish family history, the connections between Irish migration and the construction of whiteness in what's known as the United States.
]]>
Sarah DuncanTeaching the Teachers: Summer School at the University of Wyoming 1905-1950
http://repository.uwyo.edu/edd/17
http://repository.uwyo.edu/edd/17Thu, 12 Apr 2018 09:45:28 PDT
This paper is a historical case study that examines the teacher education opportunities presented via the University of Wyoming Summer School from 1905 to 1950 and how the state’s teacher population was affected by these opportunities. It contextualizes UW Summer School in the broader movements of teacher education at the time, from teacher institutes to normal schools. UW Summer School is remarkable considering that when it started, the University had only been in existence for 17 years. The UW Summer School was a successful model, bringing in students for 110 years. This case study fills in gaps in the literature pertaining to the educational history of the west and the institutional history of the University.
]]>
Christi L. ThompsonFast verified computation for the solvent of the quadratic matrix equation
http://repository.uwyo.edu/ela/vol34/iss1/10
http://repository.uwyo.edu/ela/vol34/iss1/10Mon, 02 Apr 2018 21:57:06 PDT
Two fast algorithms for numerically computing an interval matrix containing the solvent of the quadratic matrix equation $AX^2 + BX + C = 0$ with square matrices $A$, $B$, $C$ and $X$ are proposed. These algorithms require only cubic complexity, verify the uniqueness of the contained solvent, and do not involve iterative process. Let $\ap{X}$ be a numerical approximation to the solvent. The first and second algorithms are applicable when $A$ and $A\ap{X}+B$ are nonsingular and numerically computed eigenvector matrices of $\ap{X}^T$ and $\ap{X} + \inv{A}B$, and $\ap{X}^T$ and $\inv{(A\ap{X}+B)}A$ are not ill-conditioned, respectively. The first algorithm moreover verifies the dominance and minimality of the contained solvent. Numerical results show efficiency of the algorithms.
]]>
Shinya MiyajimaDeterminantal representations of elliptic curves via Weierstrass elliptic functions
http://repository.uwyo.edu/ela/vol34/iss1/9
http://repository.uwyo.edu/ela/vol34/iss1/9Mon, 02 Apr 2018 21:56:58 PDT
Helton and Vinnikov proved that every hyperbolic ternary form admits a symmetric derminantal representation via Riemann theta functions. In the case the algebraic curve of the hyperbolic ternary form is elliptic, the determinantal representation of the ternary form is formulated by using Weierstrass $\wp$-functions in place of Riemann theta functions. An example of this approach is given.
]]>
Mao-Ting Chien et al.Upper Bound for the Number of Distinct Eigenvalues of a Perturbed Matrix
http://repository.uwyo.edu/ela/vol34/iss1/8
http://repository.uwyo.edu/ela/vol34/iss1/8Mon, 02 Apr 2018 21:56:50 PDT
In 2016, Farrell presented an upper bound for the number of distinct eigenvalues of a perturbed matrix. Xu (2017), and Wang and Wu (2016) introduced upper bounds which are sharper than Farrell's bound. In this paper, the upper bounds given by Xu, and Wang and Wu are improved.
]]>
Sunyo Moon et al.Range-compatible homomorphisms over the field with two elements
http://repository.uwyo.edu/ela/vol34/iss1/7
http://repository.uwyo.edu/ela/vol34/iss1/7Mon, 02 Apr 2018 07:04:00 PDT
Let U and V be finite-dimensional vector spaces over a field K, and S be a linear subspace of the space L(U, V ) of all linear operators from U to V. A map F : S → V is called range-compatible when F(s) ∈ Im s for all s ∈ S. Previous work has classified all the range-compatible group homomorphisms provided that codimL(U,V )S ≤ 2 dim V − 3, except in the special case when K has only two elements and codimL(U,V )S = 2 dim V − 3. This article gives a thorough treatment of that special case. The results are partly based upon the recent classification of vector spaces of matrices with rank at most 2 over F2. As an application, the 2-dimensional non-reflexive operator spaces are classified over any field, and so do the affine subspaces of Mn,p(K) with lower-rank at least 2 and codimension 3.
]]>
Clément de Seguins PazzisCharacterizing Graphs Of Maximum Principal Ratio
http://repository.uwyo.edu/ela/vol34/iss1/6
http://repository.uwyo.edu/ela/vol34/iss1/6Mon, 02 Apr 2018 07:03:55 PDT
The principal ratio of a connected graph, denoted γ(G), is the ratio of the maximum and minimum entries of its Perron eigenvector. Cioaba and Gregory (2007) conjectured that the graph on n vertices maximizing γ(G) is a kite graph, that is, a complete graph with a pendant path. In this paper, their conjecture is proved
]]>
Michael Tait et al.Observations of Notable Parental Behaviours of Northern Spotted Owls (Strix occidentalis caurina)
http://repository.uwyo.edu/zoology_facpub/41
http://repository.uwyo.edu/zoology_facpub/41Fri, 30 Mar 2018 12:15:55 PDT
Northern Spotted Owl (Strix occidentalis caurina) is a medium-sized forest owl of conservation concern in the Pacific Northwest of North America. We report two sightings of previously unreported parental behaviour: a Northern Spotted Owl feeding avian nestlings to its young and a Northern Spotted Owl defending a fledgling against a Black Bear (Ursus americanus). Further research may be warranted on the influence of brood size and habitat quality on dietary breadth. Although Black Bears have not been previously documented as Northern Spotted Owl predators, we suggest that they should be considered potential predators of nestling and fledgling owls.
]]>
Jesse Marion Alston et al.Bankruptcy Law -- A Battle of Two Acts: Midland Funding, LLC v Johnson, 137 S. Ct. 1407 (2017)
http://repository.uwyo.edu/wlr/vol18/iss1/6
http://repository.uwyo.edu/wlr/vol18/iss1/6Tue, 20 Mar 2018 09:43:42 PDTErin BerryGeneral Law DivisionThe Best-Fitting Uniform: Balancing Legislative Standards and Judicial Processes in Veterans Treatment Courts
http://repository.uwyo.edu/wlr/vol18/iss1/5
http://repository.uwyo.edu/wlr/vol18/iss1/5Tue, 20 Mar 2018 09:43:38 PDTBenjamin PomeranceGeneral Law DivisionProtect Our Military Children: Congress Must Rectify Jurisdiction on Military Installations to Address Juvenile-on-Juvenile Sexual Assault
http://repository.uwyo.edu/wlr/vol18/iss1/4
http://repository.uwyo.edu/wlr/vol18/iss1/4Tue, 20 Mar 2018 09:43:35 PDTGeorge R. Lavine IIIGeneral Law DivisionJudicial Ethics -- Judicial Words May Speak Softer Than Actions, But They Do Still Speak: The Code of Judicial Conduct; Neely v. Wyo. Comm'n. on Judicial Conduct & Ethics, 2017 WY 25, 390 P.3d 728 (Wyo. 2017)
http://repository.uwyo.edu/wlr/vol18/iss1/3
http://repository.uwyo.edu/wlr/vol18/iss1/3Tue, 20 Mar 2018 09:43:32 PDTKeeley O. CroninWY Law DivisionOne Nation, Even in Tort Law: How States Can Preempt or Circumvent Federal Preemption of Noneconomic Damage Limitations
http://repository.uwyo.edu/wlr/vol18/iss1/2
http://repository.uwyo.edu/wlr/vol18/iss1/2Tue, 20 Mar 2018 09:43:29 PDTEmily S. MaddenWY Law DivisionA Tale of Two Standards: Why Wyoming Courts Should Apply the Actual Substantial Evidence Standard When Reviewing Workers' Compensation Cases
http://repository.uwyo.edu/wlr/vol18/iss1/1
http://repository.uwyo.edu/wlr/vol18/iss1/1Tue, 20 Mar 2018 09:43:26 PDTMichael C. DuffWY Law DivisionThe Hafnian and a Commutative Analogue of the Grassmann Algebra
http://repository.uwyo.edu/ela/vol34/iss1/5
http://repository.uwyo.edu/ela/vol34/iss1/5Mon, 19 Mar 2018 21:14:58 PDT
A close relationship between the determinant, the pfaffian, and the Grassmann algebra is well-known. In this paper, a similar relation between the permanent, the hafnian, and a commutative analogue of the Grassmann algebra is described. Using the latter, some new properties of the hafnian are proved.
]]>
Dmitry EfimovNew Contributions to Semipositive and Minimally Semipositive Matrices
http://repository.uwyo.edu/ela/vol34/iss1/4
http://repository.uwyo.edu/ela/vol34/iss1/4Mon, 19 Mar 2018 21:14:51 PDT
Semipositive matrices (matrices that map at least one nonnegative vector to a positive vector) and minimally semipositive matrices (semipositive matrices whose no column-deleted submatrix is semipositive) are well studied in matrix theory. In this article, this notion is revisited and new results are presented. It is shown that the set of all $m \times n$ minimally semipositive matrices contains a basis for the linear space of all $m \times n$ matrices. Apart from considerations involving principal pivot transforms and the Schur complement, results on semipositivity and/or minimal semipositivity for the following classes of matrices are presented: intervals of rectangular matrices, skew-symmetric and almost skew-symmetric matrices, copositive matrices, $N$-matrices, almost $N$-matrices and almost $P$-matrices.
]]>
Projesh Nath Choudhury et al.Extremal Copositive Matrices with Zero Supports of Cardinality n-2
http://repository.uwyo.edu/ela/vol34/iss1/3
http://repository.uwyo.edu/ela/vol34/iss1/3Mon, 19 Mar 2018 21:14:43 PDT
Let $A \in {\cal C}^n$ be an exceptional extremal copositive $n \times n$ matrix with positive diagonal. A zero $u$ of $A$ is a non-zero nonnegative vector such that $u^TAu = 0$. The support of a zero $u$ is the index set of the positive elements of $u$. A zero $u$ is minimal if there is no other zero $v$ such that $\Supp v \subset \Supp u$ strictly. Let $G$ be the graph on $n$ vertices which has an edge $(i,j)$ if and only if $A$ has a zero with support $\{1,\dots,n\} \setminus \{i,j\}$. In this paper, it is shown that $G$ cannot contain a cycle of length strictly smaller than $n$. As a consequence, if all minimal zeros of $A$ have support of cardinality $n - 2$, then $G$ must be the cycle graph $C_n$.
]]>
Roland HildebrandOn the Notion of Scalar Product for Finite-dimensional Diffeological Vector Spaces
http://repository.uwyo.edu/ela/vol34/iss1/2
http://repository.uwyo.edu/ela/vol34/iss1/2Thu, 15 Mar 2018 06:46:32 PDT
It is known that the only finite-dimensional diffeological vector space that admits a diffeologically smooth scalar product is the standard space of appropriate dimension. In this note, a way to dispense withthis issue is considered, by introducing a notion of pseudo-metric, which, said informally, is the least-degeneratesymmetric bilinear form on a given space. This notion is applied to make some observations on subspaces which split off as smooth direct summands (providing examples which illustrate that not all subspaces do), and then to show that the diffeological dual of a finite-dimensional diffeological vector space always has the standard diffeology and in particular, any pseudo-metric on the initial space induces, in theobvious way, a smooth scalar product on the dual.
]]>
Ekaterina PervovaAlgebraic Methods for the Construction of Algebraic-Difference Equations With Desired Behavior
http://repository.uwyo.edu/ela/vol34/iss1/1
http://repository.uwyo.edu/ela/vol34/iss1/1Wed, 21 Feb 2018 17:34:36 PST
For a given system of algebraic and difference equations, written as an Auto-Regressive (AR) representation $A(\sigma)\beta(k)=0$, where $\sigma $ denotes the shift forward operator and $A\left( \sigma \right) $ a regular polynomial matrix, the forward-backward behavior of this system can be constructed by using the finite and infinite elementary divisor structure of $A\left( \sigma \right) $. This work studies the inverse problem: Given a specific forward-backward behavior, find a family of regular or non-regular polynomial matrices $A\left( \sigma \right) $, such that the constructed system $A\left( \sigma \right) \beta \left( k\right) =0$ has exactly the prescribed behavior. It is proved that this problem can be reduced either to a linear system of equations problem or to an interpolation problem and an algorithm is proposed for constructing a system satisfying a given forward and/or backward behavior.
]]>
Lazaros Moysis et al.Amended Wyoming Bar Rule 5 - Order
http://repository.uwyo.edu/wlj/vol19/iss3/8
http://repository.uwyo.edu/wlj/vol19/iss3/8Tue, 20 Feb 2018 15:05:44 PSTGlenn ParkerSpecial Section