相关论文: Properties of the Generalized Zig-Zag Product of G…

In various contexts, the zeta function of an object splits into a product of $L$-functions. We categorify this product formula for quadratic covers of objects in the following contexts: quadratic extensions of number fields, ramified double…

We study the categorical homology of Zappa-Sz\'ep products of small categories, which include all self-similar actions. We prove that the categorical homology coincides with the homology of a double complex, and so can be computed via a…

This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…

One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…

Several variants of hypergraph products have been introduced as generalizations of the strong and direct products of graphs. Here we show that only some of them are associative. In addition to the Cartesian product, these are the minimal…

In this paper we introduce a product-like operation that generalizes the construction of generalized Sierpi\'nski graphs. Let $G,H$ be graphs and let $f: V(G) \to V(H)$ be a function. Then the Sierpi\'nski product of $G$ and $H$ with…

In this work, for a given inverse semigroup we will define the crossed product of an inverse semigroup by a partial action. Also, we will associate to an inverse semigroup $G$ an inverse semigroup $S_G$, and we will prove that there is a…

We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…

The power graph $P(G)$ of a finite group $G$ is the graph with vertex set $G$ and two distinct vertices are adjacent if either of them is a power of the other. Here we show that the power graph $P(G_1 \times G_2)$ of the direct product of…

Graph products for groups were defined by Green in her thesis as a generalization of both Cartesian and free products. In this paper we define the corresponding graph product for reduced and maximal C*-algebras, von Neumann algebras and…

Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…

In the context of Hecke algebras of complex reflection groups, we prove that the generalized Hecke algebras of normalizers of parabolic subgroups are semidirect products, under suitable conditions on the parameters involved in their…

We study properties of a family of algebraic star products defined on coadjoint orbits of semisimple Lie groups. We connect this description with the point of view of differentiable deformations and geometric quantization.

A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…

Given a free and proper action of a groupoid on a Fell bundle (over another groupoid), we give an equivalence between the semidirect-product and the generalized-fixed-point Fell bundles, generalizing an earlier result where the action was…

The notion of a generalized product, refining that of a (symmetric and smooth) simplicial space is introduced and shown to imply the existence of an algebra of pseudodifferential operators. This encompasses many constructions of such…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. graphs forms a common generalization of the classes of…

k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…

In this paper we define a new product-like binary operation on directed graphs, and we discuss some of its properties. We also briefly discuss its application in constructing the subtyping relation in generic nominally-typed object-oriented…