Related papers: Regular Dilation on Graph Products of $\mathbb{N}$

For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…

Snake graphs are a class of planar graphs that are important in the theory of cluster algebras. Indeed, the Laurent expansions of the cluster variables in cluster algebras from surfaces are given as weight generating functions for 1-dimer…

Let $G$ be a connected nonregular graphs of order $n$ with maximum degree $\Delta$ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that $G$ has a degree sequence $(\Delta,\ldots,\Delta,\delta)$ with…

We introduce a generalization of the zig-zag product of regular digraphs (directed graphs), which allows us to construct regular digraphs with m ore flexible choices of the degrees. In our generalization, we can control the connectivity of…

In this paper, we derive new sharp diameter bounds for distance regular graphs, which better answer a problem raised by Neumaier and Penji\' c in many cases. Our proof is built upon a relation between the diameter and long-scale Ollivier…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

Continuous wavelet transforms arising from the quasiregular representation of a semidirect product of a vector group with a matrix group -- the so-called dilation group -- have been studied by various authors. Recently the attention has…

This thesis is dedicated to developing a dilation theory for semigroups of completely positive maps. The first part treats two-parameter semigroups, and contains also contributions to dilation theory of product system representations. The…

We study completely contractive representations of product systems of $C^*$-correspondences over semigroups. For a product system of $C^*$-correspondences over the semigroup $\mathbb{N}^2$, we prove that every such representation can be…

Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…

The explicit constructions of minimal isometric, and minimal unitary dilations of an arbitrary linear pencil of operators $T(\lambda)=T_0+\lambda T_1$ consisting of contractions on a separable Hilbert space for $|\lambda |=1$, which…

Let $G$ and $H$ be two simple graphs and let $G*H$ denotes the graph theoretical product of $G$ by $H$. In this paper we provide some results on graded Betti numbers, Castelnuovo-Mumford regularity, projective dimension, $h$-vector, and…

Figueroa-Centeno et al. introduced the following product of digraphs: let $D$ be a digraph and let $\Gamma$ be a family of digraphs such that $V(F)=V$ for every $F\in \Gamma$. Consider any function $h:E(D)\longrightarrow\Gamma $. Then the…

The article deals with isometric dilation and commutant lifting for a class of $n$-tuples $(n \geq 3)$ of commuting contractions. We show that operator tuples in the class dilate to tuples of commuting isometries of BCL type. As a…

Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…

We introduce H-clique-width, a new structural measure of graphs that aims to provide a hereditary analogue of the traditional graph product structure. The definition naturally generalises the ordinary clique-width concept. As a result, for…

Let $\mathcal{S}$ be the semigroup $\mathcal{S}=\sum^{\oplus k}_{i=1}\Sc{S}_i$, where for each $i\in I$, $\mathcal{S}_i$ is a countable subsemigroup of the additive semigroup $\B{R}_+$ containing 0. We consider representations of…

We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…

We study close-packed dimers on the quasiperiodic Ammann-Beenker (AB) graph, that was recently shown to have the unusual feature that hard-core dimer constraints are exactly reproduced at successive discrete length scales. This observation…

We study relative bi-exactness of graph product and graph-wreath product group von Neumann algebras. In particular, we obtain the relative bi-exactness for graph product von Neumann algebras $LH_{\Gamma}=\ast_{v,\Gamma} LH_v$ and…