Related papers: Dual equivalence graphs II: Transformations on loc…

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…

This paper studies the bidiagonal factorization of the collocation matrices of analytic bases using symmetric functions. Explicit formulas for their initial minors are derived in terms of Schur functions. The structure of these formulas…

An oriented graph is a directed graph without any cycle of length at most 2. To push a vertex of a directed graph is to reverse the orientation of the arcs incident to that vertex. Klostermeyer and MacGillivray defined push graphs which are…

Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether…

We investigate the $e$-positivity and Schur positivity of the chromatic symmetric functions of some spider graphs with three legs. We obtain the positivity classification of all broom graphs and that of most double broom graphs. The methods…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

We propose a universal manipulation to obtain Seiberg-like dualities of 3d $\mathcal{N}=2$ general quiver gauge theories with unitary, symplectic and orthogonal gauge groups coupled to fundamental and bifundamental matter fields. We…

We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

We introduce a definition of ``equivariant quasisymmetry'' for polynomials in two sets of variables. Using this definition we define quasisymmetric generalizations of the theory of double Schur and double Schubert polynomials that we call…

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Turner's Conjecture describes all blocks of symmetric groups and Hecke algebras up to derived equivalence in terms of certain double algebras. With a view towards a proof of this conjecture, we develop a general theory of Turner doubles. In…

Graph transformers are a recent advancement in machine learning, offering a new class of neural network models for graph-structured data. The synergy between transformers and graph learning demonstrates strong performance and versatility…

Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…

Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…

We study the equivalence/duality between various non-commutative gauge models at the classical and quantum level. The duality is realised by a linear Seiberg-Witten-like map. The infinitesimal form of this map is analysed in more details.

We define $G$-cospectrality of two $G$-gain graphs $(\Gamma,\psi)$ and $(\Gamma',\psi')$, proving that it is a switching isomorphism invariant. When $G$ is a finite group, we prove that $G$-cospectrality is equivalent to cospectrality with…

We define and discuss the utility of two equivalence graph classes over which a spectral projector-based graph Fourier transform is equivalent: isomorphic equivalence classes and Jordan equivalence classes. Isomorphic equivalence classes…