Search

By applying simplification operations to categories of multigraphs, several natural graph operations are shown to demonstrate categorical issues. The replacement of an undirected edge with a directed cycle for digraphs admits both a left and a right adjoint, while the analogous operation for quivers only admits a left adjoint. The clique-replacement graph, intersection graph, and dual hypergraph fail to be functorial with traditional graph homomorphisms. The three failures are remedied by considering weak set-system homomorphisms, which form a category isomorphic to both the category of incidence structures and a lax comma category., Comment: 24 pages, 6 images

Rank-based linkage is a new tool for summarizing a collection $S$ of objects according to their relationships. These objects are not mapped to vectors, and ``similarity'' between objects need be neither numerical nor symmetrical. All an object needs to do is rank nearby objects by similarity to itself, using a Comparator which is transitive, but need not be consistent with any metric on the whole set. Call this a ranking system on $S$. Rank-based linkage is applied to the $K$-nearest neighbor digraph derived from a ranking system. Computations occur on a 2-dimensional abstract oriented simplicial complex whose faces are among the points, edges, and triangles of the line graph of the undirected $K$-nearest neighbor graph on $S$. In $|S| K^2$ steps it builds an edge-weighted linkage graph $(S, \mathcal{L}, \sigma)$ where $\sigma(\{x, y\})$ is called the in-sway between objects $x$ and $y$. Take $\mathcal{L}_t$ to be the links whose in-sway is at least $t$, and partition $S$ into components of the graph $(S, \mathcal{L}_t)$, for varying $t$. Rank-based linkage is a functor from a category of out-ordered digraphs to a category of partitioned sets, with the practical consequence that augmenting the set of objects in a rank-respectful way gives a fresh clustering which does not ``rip apart`` the previous one. The same holds for single linkage clustering in the metric space context, but not for typical optimization-based methods. Open combinatorial problems are presented in the last section., Comment: 37 pages, 12 figures

The simplification of a multigraph into a simple graph can be abstracted to a more general comma category under some common conditions. When using the identity functor, the category of simple objects in a comma category generalizes the functor-structured category. Seated in categorical terms, simplification can be dualized to "antisimplification", which manifests as removal of isolated vertices and loose edges., Comment: 16 pages

The box product and its associated box exponential are characterized for the categories of quivers (directed graphs), multigraphs, set system hypergraphs, and incidence hypergraphs. It is shown that only the quiver case of the box exponential can be characterized via homs entirely within their own category. An asymmetry in the incidence hypergraphic box product is rectified via an incidence dual-closed generalization that effectively treats vertices and edges as real and imaginary parts of a complex number, respectively. This new hypergraphic box product is shown to have a natural interpretation as the canonical box product for graphs via the bipartite representation functor, and its associated box exponential is represented as homs entirely in the category of incidence hypergraphs; with incidences determined by incidence-prism mapping. The evaluation of the box exponential at paths is shown to correspond to the entries in half-powers of the oriented hypergraphic signless Laplacian matrix., Comment: 31 pages, 23 figures, 4 tables

An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in the subobject classifier of incidence hypergraphs. Moreover, the injective envelope is calculated and shown to contain the class of uniform hypergraphs -- providing a combinatorial framework for the entries of incidence matrices. A multivariable all-minors characteristic polynomial is obtained for both the determinant and permanent of the oriented hypergraphic Laplacian and adjacency matrices arising from any integer incidence matrix. The coefficients of each polynomial are shown to be submonic maps from the same family into the injective envelope limited by the subobject classifier. These results provide a unifying theorem for oriented hypergraphic matrix-tree-type and Sachs-coefficient-type theorems. Finally, by specializing to bidirected graphs, the trivial subclasses for the degree-$k$ monomials of the Laplacian are shown to be in one-to-one correspondence with $k$-arborescences., Comment: 27 pages, 10 figures

This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective objects, unlike the category of directed multigraphs (i.e. quivers). The category of incidence hypergraphs is introduced as a "graph-like" remedy for the set-system issues so that hypergraphs may be studied by their locally graphic behavior via homomorphisms that allow an edge of the domain to be mapped into a subset of an edge in the codomain. Moreover, it is shown that the category of quivers embeds into the category of incidence hypergraphs via a logical functor that is the inverse image of an essential geometric morphism between the topoi. Consequently, the quiver exponential is shown to be simply represented using incidence hypergraph homomorphisms.

This paper discusses some issues arising from the category $\mathfrak{H}$ of hypergraphs, the category $\mathfrak{M}$ of (undirected) multigraphs, and the topos $\mathfrak{Q}$ of quivers. First, the natural inclusion of $\mathfrak{M}$ into $\mathfrak{H}$ admits a right adjoint functor by deleting all nontraditional edges. Dually, the operations of taking the underlying multigraph of a quiver and taking the associated digraph of a multigraph form an adjoint pair between $\mathfrak{M}$ and $\mathfrak{Q}$. On the other hand, neither $\mathfrak{H}$ nor $\mathfrak{M}$ is cartesian closed, meaning that neither is a topos like $\mathfrak{Q}$. Moreover, despite $\mathfrak{M}$ being a subcategory of $\mathfrak{H}$, $\mathfrak{H}$ does not have enough projective objects while $\mathfrak{M}$ admits a projective cover for every object., Comment: 25 pages, 1 figure, 13 images This paper has been withdrawn as it has been merged with arXiv:1805.07670

This work creates two categories of "array-weighted sets" for the purposes of constructing universal matrix-normed spaces and algebras. These universal objects have the analogous universal property to the free vector space, lifting maps completely bounded on a generation set to a completely bounded linear map of the matrix-normed space. Moreover, the universal matrix-normed algebra is used to prove the existence of a free product for matrix-normed algebras using algebraic methods., Comment: 46 pages. Version 4 fixed a few minor typos. Version 3 added matricial completion; fixed an arithmetic error in Example 3.5.10. Version 2 added a preliminaries section on weighted sets and matricial Banach spaces, incorporating much of "Matricial Banach spaces" in summary; fixed a domain issue in Lemma 3.3.2; simplified Examples 3.5.10 and 4.11; added more proofs to Sections 4 and 5

This work performs a study of the category of complete matrix-normed spaces, called matricial Banach spaces. Many of the usual constructions of Banach spaces extend in a natural way to matricial Banach spaces, including products, direct sums, and completions. Also, while the minimal matrix-norm on a Banach space is well-known, this work characterizes the maximal matrix-norm on a Banach space from the work of Effros and Ruan as a dual operator space. Moreover, building from the work of Blecher, Ruan, and Sinclair, the Haagerup tensor product is merged with the direct sum to form a Haagerup tensor algebra, which shares the analogous universal property of the Banach tensor algebra from the work of Leptin., Comment: 19 pages. This paper has been withdrawn as it has been merged with arXiv:1405.7113

This work connects the idea of a "blow-up" of a quiver with that of injectivity, showing that for a class of monic maps $\Phi$, a quiver is $\Phi$-injective if and only if all blow-ups of it are as well. This relationship is then used to characterize all quivers that are injective with respect to the natural embedding of $P_{n}$ into $C_{n}$., Comment: 17 pages

This paper characterizes the injective and projective objects in the category of directed multigraphs, or quivers. Further, the injective envelope and projective cover of any quiver in this category is constructed., Comment: 17 pages

In this paper, I characterize four particular classes of directed multigraphs, or quivers, as images under left and right adjoints to the natural vertex and edge functors. In particular, the following notions coincide: (1) independent sets of vertices with a left adjoint functor to the vertex functor, (2) independent sets of edges with a left adjoint functor to the edge functor, (3) complete digraphs with a right adjoint functor to the vertex functor, (4) bouquets with a right adjoint functor to the edge functor., Comment: 10 pages This paper has been withdrawn as it was subsumed by arXiv:1608.00058

This paper characterizes the unital C*-algebra generated by a single invertible element as the unital free product of C[0,1] and C(T). To do this, I develop techniques to split and merge presentations of C*-algebras using free products in tandem with the Tietze transformations devised in my previous paper., Comment: 16 pages This paper has been withdrawn as it was merged into paper arXiv:1012.1275v2

In this work, I develop a new view of presentation theory for C*-algebras, both unital and non-unital, heavily grounded in classical notions from algebra. In particular, I introduce Tietze transformations for these presentations, which lead to a transformation theorem analogous to Tietze's 1908 result in group theory., Comment: 17 pages

In this work, I address a primary issue with adapting categorical and algebraic concepts to functional analytic settings, the lack of free objects. Using a "normed set" and associated categories, I describe constructions of normed objects, which build from a set to a vector space to an algebra, and thus parallel the natural progression found in algebraic settings. Each of these is characterized as a left adjoint functor to a natural forgetful functor. Further, the universal property in each case yields a "scaled-free" mapping property, which extends previous notions of "free" normed objects. In subsequent papers, this scaled-free property, coupled with the associated functorial results, will give rise to a presentation theory for Banach algebras and other such objects, which inherits many properties and constructions from its algebraic counterpart., Comment: 15 pages