Related papers: Identifying Young diagrams among residue multisets
The conjecture about the correspondence between instanton partition functions in the N=2 SUSY Yang-Mills theory and conformal blocks of two-dimensional conformal field theories is extended to the case of the N=1 supersymmetric conformal…
We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…
This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…
In this paper we study the inverse eigenvector centrality problem on directed graphs: given a prescribed node centrality profile, we seek edge weights that realize it. Since this inverse problem generally admits infinitely many solutions,…
Strongly interacting models often possess "dualities" subtler than a one-to-one mapping of energy levels. The maps can be non-invertible, as apparent in the canonical example of Kramers and Wannier. We analyse an algebraic structure common…
By identifying each standard flag with a trivalent Feynman diagram, the corresponding propagators can be read directly from the flag itself. Within the flag representation, the kinematic Jacobi identity (equivalently, the residue theorem on…
In this paper we study a mapping from permutations to Dyck paths. A Dyck path gives rise to a (Young) diagram and we give relationships between statistics on permutations and statistics on their corresponding diagrams. The distribution of…
In this paper we study the equivalence relation on the set of acyclic orientations of a graph Y that arises through source-to-sink conversions. This source-to-sink conversion encodes, e.g. conjugation of Coxeter elements of a Coxeter group.…
We propose a new set of Master Integrals which can be used as a basis for certain multiloop calculations in massless gauge field theories. In these theories we consider three-point Feynman diagrams with arbitrary number of loops. The…
Applications of tangles of connectivity systems suggest a duality between these, in which for two sets $X$ and $Y\!$ the elements $x$ of $X$ map to subsets $Y_x$ of $Y\!$, and the elements $y$ of $Y\!$ map to subsets $X_y$ of $X$, so that…
We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…
We study the problem of computing the preimage of a set under a neural network with piecewise-affine activation functions. We recall an old result that the preimage of a polyhedral set is again a union of polyhedral sets and can be…
We show that momentum space Feynman diagrams involving internal massless fields can be cast as conformal integrals. This leads to a classification of all Feynman diagrams into conformal families, labelled by conformal integrals. Computing…
In theories like SM or MSSM with a complex gauge group structure the complete set of Feynman diagrams contributed to a particular physics process can be splited to exact gauge invariant subsets. Arguments and examples given in the review…
We consider several families of palintiples (also known as reverse multiples) whose carries themselves are digits of lower-base palintiples and give some methods for constructing them from fundamental palintiple types. We also continue the…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
We show that the theory of sorting by reversals fits into the well-established theory of circuit partitions of 4-regular multigraphs (which also involves the combinatorial structures of circle graphs and delta-matroids). In this way, we…
We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
We revisit the problem of performing conformal block decomposition of exchange Witten diagrams in the crossed channel. Using properties of conformal blocks and Witten diagrams, we discover infinitely many linear relations among the crossed…
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a…