Related papers: Regular Dilation on Graph Products of $\mathbb{N}$
Regular dilation has recently been extended to graph product of $\mathbb{N}$, where having a *-regular dilation is equivalent to having a minimal isometric Nica-covariant dilation. In this paper, we first extend the result to right LCM…
We establish a necessary and sufficient condition for a representation of a lattice ordered semigroup to be regular, in the sense that certain extensions are completely positive definite. This result generalizes a theorem due to Brehmer…
Let E be a product system of C*-correspondences over N^r. Some sufficient conditions for the existence of a not necessarily regular isometric dilation of a completely contractive representation of E are established and difference between…
In this paper we propose a new technical tool for analyzing representations of Hilbert $C^*$-product systems. Using this tool, we give a new proof that every doubly commuting representation over $\mathbb{N}^k$ has a regular isometric…
We study completely contractive representations of product systems $X$ of correspondences over the semigroup $\mathbb{Z}_+^k$. We present a necessary and sufficient condition for such a representation to have a regular isometric dilation.…
An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\A_\theta$ and $\A_u$ which are associated with the commutation relation permutation $\theta$ of a 2…
Higher-rank graph generalisations of the Popescu-Poisson transform are constructed, allowing us to develop a dilation theory for higher rank operator tuples. These dilations are joint dilations of the families of operators satisfying…
We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of the results from [L. Lov\'asz, B.…
We study dilations of finite tuples of normal, completely positive and completely contractive maps (which we call CP-maps) acting on a von Neumann algebra, and commuting according to a graph G. We show that if G is acyclic, then a tuple…
This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…
Given a row contraction of operators on Hilbert space and a family of projections on the space which stabilize the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries which satisfy natural…
We take a new look at dilation theory for nonself-adjoint operator algebras. Among the extremal (co)extensions of a representation, there is a special property of being fully extremal. This allows a refinement of some of the classical…
We construct a weak dilation of a not necessarily unital CP-semigroup to an E-semigroup acting on the adjointable operators of a Hilbert module with a unit vector. We construct the dilation in such a way that the dilating E-semigroup has a…
We discuss representations of product systems (of $W^*$-correspondences) over the semigroup $\mathbb{Z}^n_+$ and show that, under certain pureness and Szego positivity conditions, a completely contractive representation can be dilated to an…
Laca constructed a minimal automorphic dilation for every semigroup dynamical system arising from an action of an Ore semigroup by injective endomorphisms of a unital $C^*$-algebra. Here we show that the semigroup crossed product with its…
In this paper we show that certain almost distance-regular graphs, the so-called $h$-punctually walk-regular graphs, can be characterized through the cospectrality of their perturbed graphs. A graph $G$ with diameter $D$ is called…
To generalise evolution families we consider systems of contractions $\{\varphi(u, v)\}_{(u, v) \in E}$ defined on the edges of a graph $\mathcal{G} = (\Omega, E)$. In this setup the Markov property, or \emph{divisibility}, can be modelled…
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with bounded thinness,…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…