701 research outputs found
Future extensions of audit services, Meeting investors\u27 future needs
https://egrove.olemiss.edu/dl_proceedings/1022/thumbnail.jp
How it feels to be a gored ox: Eight years with the Accounting Principles Board
Photograph not included in Web versio
Integer generalized inverses of incidence matrices
AbstractGraphical procedures are used to characterize the integral {1}- and {1, 2}-inverses of the incidence matrix A of a digraph, and to obtain a basis for the space of matrices X such that AXA = 0. These graphical procedures also produce the Smith canonical form of A and a full rank factorization of A using matrices with entries from {-1, 0, 1}. It is also shown how the results on incidence matrices of oriented graphs can be used to find generalized inverses of matrices of unoriented bipartite graphs
Interactions of Cosmic Superstrings
We develop methods by which cosmic superstring interactions can be studied in
detail. These include the reconnection probability and emission of radiation
such as gravitons or small string loops. Loop corrections to these are
discussed, as well as relationships to -strings. These tools should
allow a phenomenological study of string models in anticipation of upcoming
experiments sensitive to cosmic string radiation.Comment: 22 pages, 6 figures; v2: updated reference
Conpseudosimilarity and consemisimilarity over a division ring
AbstractIt is shown that for n × n matrices over a division ring which is finite dimensional over its center, the notions of consimilarity, conpseudosimilarity and consemisimilarity are all equivalent, provided the conjugation is strong
Pseudo-consimilarity and semi-consimilarity of complex matrices
AbstractIt is shown that the notion of consimilarity of n-by-n complex matrices is equivalent to each of the new concepts of pseudo-consimilarity and semi-consimilarity. This equivalence is unlike similarity in that pseudo-similarity and similarity are equivalent, while semi-similarity is a weaker relation than (pseudo-) similarity
- …