Related papers: $q$-Analogs of strongly regular graphs
There has been a great deal of research on graphs defined on algebraic structures in the last two decades. In this paper we begin an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this…
Inspired by some new advances on normal factor graphs (NFGs), we introduce NFGs as a simple and intuitive diagrammatic approach towards encoding some concepts from linear algebra. We illustrate with examples the workings of such an approach…
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
Over the past decade, a number of quantum processes have been proposed which are logically consistent, yet feature a cyclic causal structure. However, there is no general formal method to construct a process with an exotic causal structure…
In this paper we attempt to consider quantum superpositions from the perspective of the logos categorical approach presented in [26]. We will argue that our approach allows us not only to better visualize the structural features of quantum…
A $q$-difference analog of the sixth Painlev\'e equation is presented. It arises as the condition for preserving the connection matrix of linear $q$-difference equations, in close analogy with the monodromy preserving deformation of linear…
In this paper we give two characterizations of the $p \times q$-grid graphs as co-edge-regular graphs with four distinct eigenvalues.
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…
The notion of $f$-ideal is recent and has so far been studied in several papers. In \cite{qfi}, the idea of $f$-ideal is generalized to quasi $f$-ideals, which is much larger class than the class of $f$-ideals. In this paper, we introduce…
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…
We investigate the concept of $q$-replicated arguments in symmetric functions with its connection to spectral functions of hyperbolic geometry. This construction suffices for vector generation functions in the form of $q$-series, and string…
Quantum Graph Neural Networks (QGNNs) represent a novel fusion of quantum computing and Graph Neural Networks (GNNs), aimed at overcoming the computational and scalability challenges inherent in classical GNNs that are powerful tools for…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
Let R be an equivalence relation on graphs. By the strengthening of R we mean the relation R' such that graphs G and H are in the relation R' if for every graph F, the union of the graphs G and F is in the relation R with the union of the…
We present a new probabilistic modelling framework based on the recent notion of normal factor graph (NFG). We show that the proposed NFG models and their transformations unify some existing models such as factor graphs, convolutional…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.
We define $\Gamma_q(B,S \otimes H)$, the generalized $q$-gaussian von Neumann algebras associated to a sequence of symmetric independent copies $(\pi_j,B,A,D)$ and to a subset $1 \in S = S^* \subset A$ and, under certain assumptions, prove…