Open Access. Powered by Scholars. Published by Universities.®

Algebra Commons

Open Access. Powered by Scholars. Published by Universities.®

885 Full-Text Articles 904 Authors 144019 Downloads 99 Institutions

All Articles in Algebra

Faceted Search

885 full-text articles. Page 5 of 32.

Metafork: A Compilation Framework For Concurrency Models Targeting Hardware Accelerators, Xiaohui Chen 2017 The University of Western Ontario

Metafork: A Compilation Framework For Concurrency Models Targeting Hardware Accelerators, Xiaohui Chen

Electronic Thesis and Dissertation Repository

Parallel programming is gaining ground in various domains due to the tremendous computational power that it brings; however, it also requires a substantial code crafting effort to achieve performance improvement. Unfortunately, in most cases, performance tuning has to be accomplished manually by programmers. We argue that automated tuning is necessary due to the combination of the following factors. First, code optimization is machine-dependent. That is, optimization preferred on one machine may be not suitable for another machine. Second, as the possible optimization search space increases, manually finding an optimized configuration is hard. Therefore, developing new compiler techniques for optimizing applications ...


Minimum Rank Of Skew-Symmetric Matrices Described By A Graph, Mary Allison, Elizabeth Bodine, Luz Maria DeAlba, Joyati Debnath, Laura DeLoss, Colin Garnett, Jason Grout, Leslie Hogben, Bokhee Im, Hana Kim, Reshmi Nair, Olga Pryporova, Kendrick Savage, Bryan Shader, Amy Wangsness Wehe 2017 University of Wyoming

Minimum Rank Of Skew-Symmetric Matrices Described By A Graph, Mary Allison, Elizabeth Bodine, Luz Maria Dealba, Joyati Debnath, Laura Deloss, Colin Garnett, Jason Grout, Leslie Hogben, Bokhee Im, Hana Kim, Reshmi Nair, Olga Pryporova, Kendrick Savage, Bryan Shader, Amy Wangsness Wehe

Leslie Hogben

The minimum (symmetric) rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. The problem of determining minimum (symmetric) rank has been studied extensively. We define the minimum skew rank of a simple graph G to be the smallest possible rank among all skew-symmetric matrices over F whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. We apply ...


Potentially Eventually Exponentially Positive Sign Patterns, Marie Archer, Minerva Catral, Craig Erickson, Rana Haber, Leslie Hogben, Xavier Martinez-Rivera, Antonio Ochoa 2017 Columbia College

Potentially Eventually Exponentially Positive Sign Patterns, Marie Archer, Minerva Catral, Craig Erickson, Rana Haber, Leslie Hogben, Xavier Martinez-Rivera, Antonio Ochoa

Leslie Hogben

We introduce the study of potentially eventually exponentially positive (PEEP) sign patterns and establish several results using the connections between these sign patterns and the potentially eventually positive (PEP) sign patterns. It is shown that the problem of characterizing PEEP sign patterns is not equivalent to that of characterizing PEP sign patterns. A characterization of all 2×2 and 3×3 PEEP sign patterns is given.


The Symmetric M-Matrix And Symmetric Inverse M-Matrix Completion Problems, Leslie Hogben 2017 Iowa State University

The Symmetric M-Matrix And Symmetric Inverse M-Matrix Completion Problems, Leslie Hogben

Leslie Hogben

The symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of Johnson and Smith [Linear Algebra Appl. 290 (1999) 193] are extended to solve the symmetric inverse M-matrix completion problem: (1) A pattern (i.e., a list of positions in an n×n matrix) has symmetric M-completion (i.e., every partial symmetric M-matrix specifying the pattern can be completed to a symmetric M-matrix) if and only if the principal subpattern R determined by its diagonal is permutation similar to a pattern that is block diagonal with each diagonal block complete, or, in graph theoretic terms, if and only ...


Spectrally Arbitrary Patterns: Reducibility And The 2n Conjecture For N = 5, Luz M. DeAlba, Irvin R. Hentzel, Leslie Hogben, Judith McDonald, Rana Mikkelson, Olga Pryporova, Bryan Shader, Kevin N. Vander Meulen 2017 Drake University

Spectrally Arbitrary Patterns: Reducibility And The 2n Conjecture For N = 5, Luz M. Dealba, Irvin R. Hentzel, Leslie Hogben, Judith Mcdonald, Rana Mikkelson, Olga Pryporova, Bryan Shader, Kevin N. Vander Meulen

Leslie Hogben

A sign pattern Z (a matrix whose entries are elements of {+, −, 0}) is spectrally arbitrary if for any self-conjugate spectrum there is a real matrix with sign pattern Z having the given spectrum. Spectrally arbitrary sign patterns were introduced in [J.H. Drew, C.R. Johnson, D.D. Olesky, P. van den Driessche, Spectrally arbitrary patterns, Linear Algebra Appl. 308 (2000) 121–137], where it was (incorrectly) stated that if a sign pattern Z is reducible and each of its irreducible components is a spectrally arbitrary sign pattern, then Z is a spectrally arbitrary sign pattern, and it was conjectured ...


The Copositive Completion Problem: Unspecified Diagonal Entries, Leslie Hogben 2017 Iowa State University

The Copositive Completion Problem: Unspecified Diagonal Entries, Leslie Hogben

Leslie Hogben

In [L. Hogben, C.R. Johnson, R. Reams, The copositive matrix completion problem, Linear Algebra Appl. 408 (2005) 207–211] it was shown that any partial (strictly) copositive matrix all of whose diagonal entries are specified can be completed to a (strictly) copositive matrix. In this note we show that every partial strictly copositive matrix (possibly with unspecified diagonal entries) can be completed to a strictly copositive matrix, but there is an example of a partial copositive matrix with an unspecified diagonal entry that cannot be completed to a copositive matrix.


The Minimum Rank Of Symmetric Matrices Described By A Graph: A Survey, Shaun M. Fallat, Leslie Hogben 2017 University of Regina

The Minimum Rank Of Symmetric Matrices Described By A Graph: A Survey, Shaun M. Fallat, Leslie Hogben

Leslie Hogben

The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. This paper surveys the current state of knowledge on the problem of determining the minimum rank of a graph and related issues.


Recursive Robust Pca Or Recursive Sparse Recovery In Large But Structured Noise, Chenlu Qiu, Namrata Vaswani, Brian Lois, Leslie Hogben 2017 Iowa State University

Recursive Robust Pca Or Recursive Sparse Recovery In Large But Structured Noise, Chenlu Qiu, Namrata Vaswani, Brian Lois, Leslie Hogben

Leslie Hogben

This paper studies the recursive robust principal components analysis problem. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively recovering a time sequence of sparse vectors, St, in the presence of large but structured noise, Lt. The structure that we assume on Lt is that Lt is dense and lies in a low-dimensional subspace that is either fixed or changes slowly enough. A key application where this problem occurs is in video surveillance where the goal is to separate a slowly changing background (Lt) from moving foreground objects (St) on-the-fly. To solve the above ...


On Completion Problems For Various Classes Of P-Matrices, John Bowers, Job Evers, Leslie Hogben, Steve Shaner, Karyn Snider, Amy Wangsness 2017 Grinnell College

On Completion Problems For Various Classes Of P-Matrices, John Bowers, Job Evers, Leslie Hogben, Steve Shaner, Karyn Snider, Amy Wangsness

Leslie Hogben

A P-matrix is a real square matrix having every principal minor positive, and a Fischer matrix is a P-matrix that satisfies Fischer’s inequality for all principal submatrices. In this paper, all patterns of positions for n × n matrices, n ⩽ 4, are classified as to whether or not every partial Π-matrix can be completed to a Π-matrix for Π any of the classes positive P-, nonnegative P-, or Fischer matrices. Also, all symmetric patterns for 5 × 5 matrices are classified as to completion of partial Fischer matrices, and all but two such patterns are classified as to positive P- or ...


Minimum Rank And Maximum Eigenvalue Multiplicity Of Symmetric Tree Sign Patterns, Luz M. DeAlba, Timothy L. Hardy, Irvin R. Hentzel, Leslie Hogben, Amy Wangsness 2017 Drake University

Minimum Rank And Maximum Eigenvalue Multiplicity Of Symmetric Tree Sign Patterns, Luz M. Dealba, Timothy L. Hardy, Irvin R. Hentzel, Leslie Hogben, Amy Wangsness

Leslie Hogben

The set of real matrices described by a sign pattern (a matrix whose entries are elements of {+, −, 0}) has been studied extensively but only loose bounds were available for the minimum rank of a tree sign pattern. A simple graph has been associated with the set of symmetric matrices having a zero–nonzero pattern of off-diagonal entries described by the graph, and the minimum rank/maximum eigenvalue multiplicity among matrices in this set is readily computable for a tree. In this paper, we extend techniques for trees to tree sign patterns and trees allowing loops (with the presence or absence ...


Rational Realization Of Maximum Eigenvalue Multiplicity Of Symmetric Tree Sign Patterns, Atoshi Chowdhury, Leslie Hogben, Jude Melancon, Rana Mikkelson 2017 Princeton University

Rational Realization Of Maximum Eigenvalue Multiplicity Of Symmetric Tree Sign Patterns, Atoshi Chowdhury, Leslie Hogben, Jude Melancon, Rana Mikkelson

Leslie Hogben

A sign pattern is a matrix whose entries are elements of {+, −, 0}; it describes the set of real matrices whose entries have the signs in the pattern. A graph (that allows loops but not multiple edges) describes the set of symmetric matrices having a zero-nonzero pattern of entries determined by the absence or presence of edges in the graph. DeAlba et al. [L.M. DeAlba, T.L. Hardy, I.R. Hentzel, L. Hogben, A. Wangsness, Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns, Linear Algebra Appl., in press, doi:10.1016/j.laa.2006.02.018.] gave ...


Minimum Rank Of Matrices Described By A Graph Or Pattern Over The Rational, Real And Complex Numbers, Avi Berman, Shmuel Friedland, Leslie Hogben, Uriel G. Rothblum, Bryan Shader 2017 Technion-Israel Institute of Technology

Minimum Rank Of Matrices Described By A Graph Or Pattern Over The Rational, Real And Complex Numbers, Avi Berman, Shmuel Friedland, Leslie Hogben, Uriel G. Rothblum, Bryan Shader

Leslie Hogben

We use a technique based on matroids to construct two nonzero patterns Z1 and Z2 such that the minimum rank of matrices described by Z1 is less over the complex numbers than over the real numbers, and the minimum rank of matrices described by Z2 is less over the real numbers than over the rational numbers. The latter example provides a counterexample to a conjecture in [AHKLR] about rational realization of minimum rank of sign patterns. Using Z1 and Z2, we construct symmetric patterns, equivalent to graphs G1 and G2, with the analogous minimum rank properties. We also discuss issues ...


Path Cover Number, Maximum Nullity, And Zero Forcing Number Of Oriented Graphs And Other Simple Digraphs, Adam Berliner, Cora Brown, Joshua Carlson, Nathanael Cox, Leslie Hogben, Jason Hu, Katrina Jacobs, Kathryn Manternach, Travis Peters, Nathan Warnberg, Michael Young 2017 Saint Olaf College

Path Cover Number, Maximum Nullity, And Zero Forcing Number Of Oriented Graphs And Other Simple Digraphs, Adam Berliner, Cora Brown, Joshua Carlson, Nathanael Cox, Leslie Hogben, Jason Hu, Katrina Jacobs, Kathryn Manternach, Travis Peters, Nathan Warnberg, Michael Young

Leslie Hogben

An oriented graph is a simple digraph obtained from a simple graph by choosing exactly one of the two arcs (u,v)(u,v) or (v,u)(v,u) to replace each edge {u,v}{u,v}. A simple digraph describes the zero-nonzero pattern of off-diagonal entries of a family of (not necessarily symmetric) matrices. The minimum rank of a simple digraph is the minimum rank of this family of matrices; maximum nullity is defined analogously. The simple digraph zero forcing number and path cover number are related parameters. We establish bounds on the range of possible values of all ...


Orthogonal Representations, Minimum Rank, And Graph Complements, Leslie Hogben 2017 Iowa State University

Orthogonal Representations, Minimum Rank, And Graph Complements, Leslie Hogben

Leslie Hogben

Orthogonal representations are used to show that complements of certain sparse graphs have (positive semidefinite) minimum rank at most 4. This bound applies to the complement of a 2-tree and to the complement of a unicyclic graph. Hence for such graphs, the sum of the minimum rank of the graph and the minimum rank of its complement is at most two more than the order of the graph. The minimum rank of the complement of a 2-tree is determined exactly.


Maximum Generic Nullity Of A Graph, Leslie Hogben, Bryan Shader 2017 Iowa State University

Maximum Generic Nullity Of A Graph, Leslie Hogben, Bryan Shader

Leslie Hogben

For a graph G of order n, the maximum nullity of G is defined to be the largest possible nullity over all real symmetric n×n matrices A whose (i,j)th entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. Maximum nullity and the related parameter minimum rank of the same set of matrices have been studied extensively. A new parameter, maximum generic nullity, is introduced. Maximum generic nullity provides insight into the structure of the null-space of a matrix realizing maximum nullity of a graph. It is shown that ...


Minimum Rank Problems, Leslie Hogben 2017 Iowa State University

Minimum Rank Problems, Leslie Hogben

Leslie Hogben

A graph describes the zero–nonzero pattern of a family of matrices, with the type of graph (undirected or directed, simple or allowing loops) determining what type of matrices (symmetric or not necessarily symmetric, diagonal entries free or constrained) are described by the graph. The minimum rank problem of the graph is to determine the minimum among the ranks of the matrices in this family; the determination of maximum nullity is equivalent. This problem has been solved for simple trees [P.M. Nylen, Minimum-rank matrices with prescribed graph, Linear Algebra Appl. 248 (1996) 303–316, C.R. Johnson, A. Leal ...


On The Difference Between The Maximum Multiplicity And Path Cover Number For Tree-Like Graphs, Francesco Barioli, Shaun Fallat, Leslie Hogben 2017 Carleton University

On The Difference Between The Maximum Multiplicity And Path Cover Number For Tree-Like Graphs, Francesco Barioli, Shaun Fallat, Leslie Hogben

Leslie Hogben

For a given undirected graph G, the maximum multiplicity of G is defined to be the largest multiplicity of an eigenvalue over all real symmetric matrices A whose (i, j)th entry is non-zero whenever i ≠ j and {i, j} is an edge in G. The path cover number of G is the minimum number of vertex-disjoint paths occurring as induced subgraphs of G that cover all the vertices of G. We derive a formula for the path cover number of a vertex-sum of graphs, and use it to prove that the vertex-sum of so-called non-deficient graphs is non-deficient. For ...


Constructions Of Potentially Eventually Positive Sign Patterns With Reducible Positive Part, Marie Archer, Minerva Catral, Craig Erickson, Rana Haber, Leslie Hogben, Xavier Martinez-Rivera, Antonio Ochoa 2017 Iowa State University

Constructions Of Potentially Eventually Positive Sign Patterns With Reducible Positive Part, Marie Archer, Minerva Catral, Craig Erickson, Rana Haber, Leslie Hogben, Xavier Martinez-Rivera, Antonio Ochoa

Leslie Hogben

Potentially eventually positive (PEP) sign patterns were introduced by Berman et al. (Electron. J. Linear Algebra 19 (2010), 108–120), where it was noted that a matrix is PEP if its positive part is primitive, and an example was given of a 3×3 PEP sign pattern with reducible positive part. We extend these results by constructing n×n PEP sign patterns with reducible positive part, for every n≥3.


Completions Of P-Matrix Patterns, Luz M. DeAlba, Leslie Hogben 2017 Drake University

Completions Of P-Matrix Patterns, Luz M. Dealba, Leslie Hogben

Leslie Hogben

A list of positions in an n×n real matrix (a pattern) is said to have P-completion if every partial P-matrix that specifies exactly these positions can be completed to a P-matrix. We extend the work of C.R. Johnson, B.K. Kroschel [Electron. J. Linear Algebra Appl. 241–243 (1996) 655–657] by proving that a larger class of patterns has P-completion, including any 4×4 pattern with eight or fewer off-diagonal positions. We also show that any pattern whose digraph contains a minimally chordal symmetric-Hamiltonian induced subdigraph does not have P-completion.


Graph Theoretic Methods For Matrix Completion Problems, Leslie Hogben 2017 Iowa State University

Graph Theoretic Methods For Matrix Completion Problems, Leslie Hogben

Leslie Hogben

A pattern is a list of positions in an n×n real matrix. A matrix completion problem for the class of Π-matrices asks whether every partial Π-matrix whose specified entries are exactly the positions of the pattern can be completed to a Π-matrix. We survey the current state of research on Π-matrix completion problems for many subclasses Π of P0-matrices, including positive definite matrices, M-matrices, inverse M-matrices, P-matrices, and matrices defined by various sign symmetry and positivity conditions on P0- and P-matrices. Graph theoretic techniques used to study completion problems are discussed. Several new results are also presented, including the ...


Digital Commons powered by bepress