Related papers: A note on the "Smith is Huq" condition
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
Johnson's characterization of amenable groups states that a discrete group $\Gamma$ is amenable if and only if $H_b^{n \geq 1}(\Gamma; V) = 0$ for all dual normed $\mathbb{R}[\Gamma]$-modules V. In this paper, we extend the previous result…
The transmission of a vertex in a connected graph is the sum of its distances to all the other vertices. A graph is transmission irregular (TI) when all of its vertices have mutually distinct transmissions. In an earlier paper, Al-Yakoob…
For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$, denoted $\mathrm{ind}(H)$, which is defined as the maximum possible probability that choosing $k$ vertices uniformly at random from a…
A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A related problem is to find representations for multiple…
We prove a general version of the amenability conjecture in the unified setting of a Gromov hyperbolic group G acting properly cocompactly either on its Cayley graph, or on a CAT(-1)-space. Namely, for any subgroup H of G, we show that H is…
Let $\Gamma$ be a finite connected graph and $G$ a vertex-transitive group of its automorphisms. The pair $(\Gamma, G)$ is said to be locally-$L$ if the permutation group induced by the action of the vertex-stabiliser $G_v$ on the set of…
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…
Let $H$ be an infinite dimensional separable Hilbert space and $B(H)$ the C*-algebra of bounded operators on $H.$ Suppose that $T_1,T_2,..., T_n$ are self-adjoint operators in $B(H).$ We show that, if commutators $[T_i, T_j]$ are…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
We relate two important notions in graph theory: expanders which are highly connected graphs, and modularity a parameter of a graph that is primarily used in community detection. More precisely, we show that a graph having modularity…
We study variants of the well-known Collatz graph, by considering the action of the 3n+1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic to binary De Bruijn graphs. Unlike the Collatz…
A pair of Hilbert space linear operators $(V_1,V_2)$ is said to be $q$-commutative, for a unimodular complex number $q$, if $V_1V_2=qV_2V_1$. A concrete functional model for $q$-commutative pairs of isometries is obtained. The functional…
In \cite{SH}, A. L. Shields proved a well-known theorem for the similarity of unilateral weighted shift operators. By using the generalization of this theorem for multivariable weighted shifts and the curvature of holomorphic bundles, we…
We show that all invertible $n \times n$ matrices over any finite field $\mathbb{F}_q$ can be generated in a Gray code fashion. More specifically, there exists a listing such that (1) each matrix appears exactly once, and (2) two…
A diagram $\mathcal{D} = (G, l)$ over a monoid $M$ is an oriented graph $G = (V, E)$ endowed with a labeling $l\colon E \to M$. A diagram is commutative if and only if for any two oriented paths with the same endpoints, the products in $M$…
We consider a condition for non-degenerate commuting squares of matrix algebras (finite dimensional von Neumann algebras) called the \emph{span condition}, which in the case of the $n$-dimensional standard spin models is shown to be…
We give the first specific conjectures on how frequently graphs satisfy sufficient conditions for being uniquely characterized by spectral information. These conjectures arise from a theoretical framework that we developed based on…
Generalizing Pisier's idea, we introduce a Hilbertian matrix cross normed space associated with a pair of symmetric normed ideals. When the two ideals coincide, we show that our construction gives an operator space if and only if the ideal…
A necessary and sufficient condition is presented for a graph algebra to satisfy a bracketing identity. The associative spectrum of an arbitrary graph algebra is shown to be either constant or exponentially growing.