Related papers: On graphs of Hecke operators
This paper presents a comprehensive study of H-Toeplitz operators on the Fock space, a class of operators that synthesizes structural elements of both Toeplitz and Hankel operators. We derive explicit matrix representations for these…
A constructive characterization of the class of uniformly $4$-connected graphs is presented. The characterization is based on the application of graph operations to appropriate vertex and edge sets in uniformly $4$-connected graphs, that…
In this paper, we define the multiplicative Hecke operators $\mathcal{T}(n)$ for any positive integer on the integral weight meromorphic modular forms for $\Gamma_{0}(N)$. We then show that they have properties similar to those of additive…
Let $\mathcal{H}$ be a set of given connected graphs. A graph $G$ is said to be $\mathcal{H}$-free if $G$ contains no $H$ as an induced subgraph for any $H\in \mathcal{H}$. The graph $G$ is super-edge-connected if each minimum edge-cut…
In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…
Given a graph $H$, let $G^j_k(H)$ be the graph whose vertices are the proper $k$-colorings of $H$, with edges joining two colorings if $H$ contains a connected subgraph on at most $j$ vertices that includes all vertices where the colorings…
Using functions from electrical networks (graphs with resistors assigned to edges), we prove existence (with explicit formulas) of a canonical Parseval frame in the energy Hilbert space $\mathscr{H}_{E}$ of a prescribed infinite (or finite)…
In this article we discuss the convergence of first order operators on a thickened graph (a graph-like space) towards a similar operator on the underlying metric graph. On the graph-like space, the first order operator is of the form…
We consider Stanley--Reisner rings $k[x_1,...,x_n]/I(\mc{H})$ where $I(\mc{H})$ is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that…
An ordering of the vertices of a graph is \emph{connected} if every vertex (but the first) has a neighbor among its predecessors. The greedy colouring algorithm of a graph with a connected order consists in taking the vertices in order, and…
We define the following parameter of connected graphs. For a given graph $G$ we place one agent in each vertex of $G$. Every pair of agents sharing a common edge is declared to be acquainted. In each round we choose some matching of $G$…
For any pair of edges $e,f$ of a graph $G$, we say that {\em $e,f$ are $P_3$-connected in $G$} if there exists a sequence of edges $e=e_0,e_1,\ldots, e_k=f$ such that $e_i$ and $e_{i+1}$ are two edges of an induced $3$-vertex path in $G$…
We develop two approaches to Quantum (or Non-commutative) Graphs based on arbitrary von Neumann algebras $M\subseteq\mathcal B(H)$: one looking at operator bimodules of Hilbert--Schmidt (instead of bounded) operators, and the second looking…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
To each finite frame $\varphi$ in an inner product space $\mathcal{H}$ we associate a simple graph $G(\varphi)$, called {\it frame graph}, with the vectors of the frame as vertices and there is an edge between vertices $f$ and $g$ provided…
We construct 2-representations of quantum affine algebras from 2-representations of quantum Heisenberg algebras. The main tool in this construction are categorical vertex operators, which are certain complexes in a Heisenberg…
In this paper we extend the results in [Ra] on the representation of the Hecke algebra, determined by the matrix coefficients of a projective, unitary representation, in the discrete series of representations of the ambient group, to a more…
Given a formation $\mathfrak F$, we consider the graph whose vertices are the elements of $G$ and where two vertices $g,h\in G$ are adjacent if and only if $\langle g,h \rangle \notin\mathfrak F$. We are interested in the two following…
In this paper we discuss a coding and the associated symbolic dynamics for the geodesic flow on Hecke triangle surfaces. We construct an explicit cross section for which the first return map factors through a simple (explicit) map given in…
Several graph properties are characterized as the class of graphs that admit an orientation avoiding finitely many oriented structures. For instance, if $F_k$ is the set of homomorphic images of the directed path on $k+1$ vertices, then a…