相关论文: n-Categories Admissible by n-graph

We propose a new model for multicategories with symmetries with respect to Zhang's group operads. The fully faithful embedding of the category of group operads into that of crossed interval groups is made use of, and it is shown that every…

The structure of a $k$-fold monoidal category as introduced by Balteanu, Fiedorowicz, Schw\"anzl and Vogt can be seen as a weaker structure than a symmetric or even braided monoidal category. In this paper we show that it is still…

Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

We define a notion of cofibration among n-categories and show that the cofibrant objects are exactly the free ones, that is those generated by polygraphs.

Precategories generalize both the notions of strict $n$-category and sesquicategory: their definition is essentially the same as the one of strict $n$-categories, excepting that we do not require the various interchange laws to hold. Those…

We propose a recursive definition of V-n-categories and their morphisms. We show that for V k-fold monoidal the structure of a (k-n)-fold monoidal strict (n+1)-category is possessed by V-n-Cat. This article is a completion of the work begun…

We explain how categories, and groupoids, can be seen as models for a Lawvere ${\mathfrak Gr}$-theory, where ${\mathfrak Gr}$ is the category of graphs, and show that for Lawvere ${\mathfrak Gr}$-theories finitely presentable models are…

A generalization of the notion of an $\infty$-category is presented, allowing for ($\infty$-)cat(egorie)s that may have non-invertible higher morphisms.

We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…

An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented…

Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…

We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…

The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…

In this paper, we propose a framework for graph signal processing using category theory. The aim is to generalize a few recent works on probabilistic approaches to graph signal processing, which handle signal and graph uncertainties.

A signed graph is an ordered pair $\Sigma=(G,\sigma),$ where $G=(V,E)$ is the underlying graph of $\Sigma$ with a signature function $\sigma:E\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss…

The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…

Besides the need for a better understanding of networks, there is a need for prescriptive models and tools to specify requirements concerning networks and their associated graph representations. We propose class-based graphs as a means to…

We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…

Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this paper, we propose (for the first time) a notion of…