Related papers: Identifying Young diagrams among residue multisets
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
For any two root subsets associated with two Carter diagrams that have the same $ADE$ type and the same size, we construct the transition matrix that maps one subset to the other. The transition between these two subsets is carried out in…
In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that corresponds to an…
We use simple iterated one-loop graphs in massless Yukawa theory and QED to pose the following question: what are the symmetries of the residues of a graph under a permutation of places to insert subdivergences. The investigation confirms…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing". We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar…
Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decompositions is by multicuts, the subsets of those edges that…
We consider finite quantum systems defined by a mixed set of commutation and anti-commutation relations between components of the Hamiltonian operator. These relations are represented by an anti-commutativity graph which contains a…
Graph maps that are homotopic to the identity and that permute the vertices are studied. Given a periodic point for such a map, a {\em rotation element} is defined in terms of the fundamental group. A number of results are proved about the…
We consider the multivariate generating series $F_P$ of $P$-partitions in infinitely many variables $x_1, x_2 , \dots$. For some family of ranked posets $P$, it is natural to consider an analog $N_P$ with two infinite alphabets. When we…
We study the problem of learning permutation invariant representations that can capture "flexible" notions of containment. We formalize this problem via a measure theoretic definition of multisets, and obtain a theoretically-motivated…
A tableau inversion is a pair of entries from the same column of a row-standard tableau that lack the relative ordering necessary to make the tableau column-standard. An $i$-inverted Young tableau is a row-standard tableau with precisely…
Bipartite field theories (BFTs) are a new class of 4d N=1 quantum field theories defined by bipartite graphs on bordered Riemann surfaces. In this paper we derive, purely in terms of the gauge theory, the cluster transformations of face…
Mayer's theory of cluster integrals allows one to write the partition function of a gas model as a generating function of weighted graphs. Recently, Labelle, Leroux and Ducharme have studied the graph weights arising from the…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
A plane partition, whose 3D Young diagram is made of unit cubes, can be approximated by a ``coarser" plane partition, made of cubes of side length 2. Indeed, there are two such approximations obtained by ``rounding up" or ``rounding down"…
We consider the following problem arising from the study of human problem solving: Let $G$ be a vertex-weighted graph with marked "in" and "out" vertices. Suppose a random walker begins at the in-vertex, steps to neighbors of vertices with…
This paper addresses the problem of reassembling images from disjointed fragments. More specifically, given an unordered set of fragments, we aim at reassembling one or several possibly incomplete images. The main contributions of this work…
This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and…
We investigate in detail the behavior of the bipartite fluctuations of particle number $\hat{N}$ and spin $\hat{S}^z$ in many-body quantum systems, focusing on systems where such U(1) charges are both conserved and fluctuate within…