Related papers: Partial Cartesian Graph Product
Due to supporting variance annotations, such as wildcard types, the subtyping relation in Java and other generic nominally-typed OO programming languages is both interesting and intricate. In these languages, the subtyping relation between…
This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
We introduce the notion of the partial group algebra with projections and relations and show that this C*-algebra is a partial crossed product. Examples of partial group algebras with projections and relations are the Cuntz-Krieger algebras…
For a given inverse semigroup S , we introduce the notion of algebraic crossed product by using a given partial action of S, and we will prove that under some condition it is associative. Also we will introduce the concept of partial…
The kernel of the natural projection of a graph product of groups onto their direct product is called the Cartesian subgroup of the graph product. This construction generalises commutator subgroups of right-angled Coxeter and Artin groups.…
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization…
The subdirect product of two finite groups $A$ and $B$ is defined as a subgroup of the direct product $A \times B$, which is a well-known notion in finite group theory. While it is clear that, under appropriate choices of sets of generators…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
This paper presents a graded hierarchy or chain of binary operations on the reals and the complex numbers. The operations are related distributively in the sense that any one of them distributes over the next lower operation in the chain.…
A valuation theoretic approach is presented that directly leads to division algebras that are noncrossed products (instead of, e.g., describing Brauer classes of noncrossed products in an abstract manner). While this feature is shared by…
We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language). Determining such sequences is, therefore, reduced to a…
We introduce two new binary operations with combinatorial species; the arithmetic product and the modified arithmetic product. The arithmetic product gives combinatorial meaning to the product of Dirichlet series and to the Lambert series…
We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesian product of prime graphs. For finite graphs the…
Recently, Bapat and Kurata [\textit{Linear Algebra Appl.}, 562(2019), 135-153] defined the Cartesian product of two square matrices $A$ and $B$ as $A\oslash B=A\otimes \J+\J\otimes B$, where $\J$ is the all one matrix of appropriate order…
In this work, we introduce the notion of a partial action of a group on a strict monoidal category. We propose, in the context of Monoidal categories, new constructions analogous to those existing for partial group actions over an algebra…
The recently developed theory of partial actions of discrete groups on $C^*$-algebras is extended. A related concept of actions of inverse semigroups on $C^*$-algebras is defined, including covariant representations and crossed products.…
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…
We define a semidirect product groupoid of a system of partially defined local homeomorphisms $T=(T_{1},..., T_{r})$. We prove that this construction gives rise to amenable groupoids. The associated algebra is a Cuntz-like algebra. We use…
This paper contributes to the multivariate analysis of marked spatio-temporal point process data by introducing different partial point characteristics and extending the spatial dependence graph model formalism. Our approach yields a…