Related papers: Partial Cartesian Graph Product
We make explicit in terms of categories a number of statements from the theory of partial inner product spaces (PIP spaces) and operators on them. In particular, we construct sheaves and cosheaves of operators on certain PIP spaces of…
In this paper, we construct a partial group \(\mathcal{P}(F)\) that represents the "partial symmetry" inherent in a subset \(F\) of \(d\)-dimensional Euclidean space. In cases where \(F\) is not connected, \(\mathcal{P}(F)\) captures more…
We present some constructions of groupoids as: direct product, semidirect product, and we give necessary and sufficient conditions for a groupoid to be embedded into a direct product of groupoids. Also, we establish necessary and sufficient…
A new type of sectional curvature is introduced. The notion is purely algebraic and can be located in linear algebra as well as in differential geometry.
We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.
The paper deals with extension of bounded bilinear maps$.$ It gives a necessary and sufficient condition for extending a bounded bilinear map on the Cartesian product of subspaces of Banach spaces$.$ This leads to a full characterization…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
We decompose the crossed product functor for actions of crossed modules of locally compact groups on C*-algebras into more elementary constructions: taking crossed products by group actions and fibres in C*-algebras over topological spaces.…
In this paper we provide visual characterization of associative quasitrivial nondecreasing operations on finite chains. We also provide a characterization of bisymmetric quasitrivial nondecreasing binary operations on finite chains.…
The paper examines a partial order on bipartite graphs (X1, X2, E) with n vertices, X1UX2={1,2,...,n}. This partial order is a natural partial order of subobjects of an object in a triangular category with bipartite graphs as morphisms.
The concept of a crossed tensor product of algebras is studied from a few points of views. Some related constructions are considered. Crossed enveloping algebras and their representations are discussed. Applications to the noncommutative…
Categories of partial functions have become increasingly important principally because of their applications in theoretical computer science. In this note we prove that the category of partial bijections between sets as an…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…
In probabilistic modelling, joint distributions are often of more interest than their marginals, but the standard composition of stochastic channels is defined by marginalization. Last year at ACT, the notion of 'copy-composition' was…
In a nutshell, submodular functions encode an intuitive notion of diminishing returns. As a result, submodularity appears in many important machine learning tasks such as feature selection and data summarization. Although there has been a…
We consider a scalar-valued implicit function of many variables, and provide two closed formulae for all of its partial derivatives. One formula is based on products of partial derivatives of the defining function, the other one involves…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
We study inheritance of path-pairability in the Cartesian product of graphs, and prove different (such as additive and multiplicative) inheritance patterns of path-pairability, depending on the size of the Cartesian product. We present…
A novel partial order is defined on the space of digraphs or hypergraphs, based on assessing the cost of producing a graph via a sequence of elementary transformations. Leveraging work by Knuth and Skilling on the foundations of inference,…