相关论文: Dual equivalence graphs II: Transformations on loc…
Over the past years, major attention has been drawn to the question of identifying Schur-positive sets, i.e. sets of permutations whose associated quasisymmetric function is symmetric and can be written as a non-negative sum of Schur…
We study the interplay between the classical theory of linear series on curves, and the recent theory of linear series on graphs. We prove that every d-gonal (weighted) graph of Hurwitz type is the dual graph of a d-gonal curve. Conversely…
Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs \emph{without cycles} and moderate message update complexities, the sum-product algorithm (SPA) can be used to…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We study various cases of dualities between $\cal{N}$$=1$ 5d supersymmetric gauge theories. We motivate the dualities using brane webs, and provide evidence for them by comparing the superconformal index. In many cases we find that the…
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…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network's adjacency matrix up to a set of eigenvalues…
For a positive integer $d$, a connected graph $\Gamma$ is a symmetrical 2-extension of the $d$-dimensional grid $\Lambda^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $\Gamma$ and its imprimitivity system $\sigma$…
A Schur multiplier is a linear map on matrices which acts on its entries by multiplication with some function, called the symbol. We consider idempotent Schur multipliers, whose symbols are indicator functions of smooth Euclidean domains.…
Cylindric Schur functions are a family of symmetric functions that generalize skew Schur functions. We give a short proof that skew cylindric Schur functions expand positively in terms of non-skew cylindric Schur functions. In particular,…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
The dual immaculate and Young quasisymmetric Schur bases of quasisymmetric functions possess analogues in the peak algebra: respectively, the quasisymmetric Schur $Q$-functions and the peak Young quasisymmetric Schur functions. We show…
In this paper, we introduce and study two variants of the chromatic quasisymmetric function of a graph: the total chromatic quasisymmetric function via vertex labeling and via acyclic orientations. The original definition of the chromatic…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…
In this paper, we study the problem of testing the equality of two multivariate distributions. One class of tests used for this purpose utilizes geometric graphs constructed using inter-point distances. So far, the asymptotic theory of…
The symmetric tensor power of graphs is introduced and its fundamental properties are explored. A wide range of intriguing phenomena occur when one considers symmetric tensor powers of familiar graphs. A host of open questions are…
Hypothesis testing for graphs has been an important tool in applied research fields for more than two decades, and still remains a challenging problem as one often needs to draw inference from few replicates of large graphs. Recent studies…
A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…