Related papers: Graph parameters from symplectic group invariants
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…
The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…
We characterize which graph invariants are partition functions of a spin model over the complex numbers, in terms of the rank growth of associated `connection matrices'.
The symplectic graph Sp(2d, q) is the collinearity graph of the symplectic space of dimension 2d over a finite field of order q. A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1, lambda_2 ,m,n) if…
Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…
Following the works of Alexandrov, Mironov and Morozov, we show that the symplectic invariants of \cite{EOinvariants} built from a given spectral curve satisfy a set of Virasoro constraints associated to each pole of the differential form…
Introducing the notion of stabilized fundamental group for the complement of a branch curve in $CP^2$, we define effectively computable invariants of symplectic 4-manifolds that generalize those previously introduced by Moishezon and…
A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…
To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…
In this study, a novel feature coding method that exploits invariance for transformations represented by a finite group of orthogonal matrices is proposed. We prove that the group-invariant feature vector contains sufficient discriminative…
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
We show that the symmetry topological field theory (SymTFT) construction, also known as the topological holography, provides a natural and intuitive framework for the entropic order parameter characterising phases with (partially) broken…
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…
Inferring graph structure from observations on the nodes is an important and popular network science task. Departing from the more common inference of a single graph and motivated by social and biological networks, we study the problem of…
The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…
We consider the universality for the trace invariants of $c_1 N \times \cdots \times c_D N$ tensors with i.i.d. complex random elements. In the case $c_1 = \cdots = c_D$, Gurau derived the universality in the limit $N \to \infty$ by…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…