相关论文: Arrays and the octahedron recurrence

The cosmohedron was recently proposed as a polytope underlying the cosmological wavefunction for $\text{Tr}(\Phi^3)$ theory. Its faces were conjectured to be in bijection with Matryoshkas, which are obtained from a subdivision of a polygon…

The $A_\infty$ T-system, also called the octahedron recurrence, is a dynamical recurrence relation. It can be realized as mutation in a coefficient-free cluster algebra (Kedem 2008, Di Francesco and Kedem 2009). We define T-systems with…

This paper presents a topological framework for investigating the Birch and Swinnerton Dyer conjecture through four dimensional embeddings of elliptic curves. We propose a correspondence between the algebraic rank of an elliptic curve and…

Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook…

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

It is known that a topological correspondence \((X,\lambda)\) from a locally compact groupoid with a Haar system \((G,\alpha)\) to another one, \((H,\beta)\), produces a \(\textrm{C}^*\)-correspondence \(\mathcal{H}(X,\lambda)\) from…

We give a bijection between the set of self-conjugate partitions and that of ordinary partitions. Also, we show the relation between hook lengths of self conjugate partition and corresponding partition via the bijection. As a corollary, we…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

This is a study on pattern Hopf algebras in combinatorial structures. We introduce the notion of combinatorial presheaf, by adapting the algebraic framework of species to the study of substructures in combinatorics. Afterwards, we consider…

A unicellular map, or one-face map, is a graph embedded in an orientable surface such that its complement is a topological disk. In this paper, we give a new viewpoint to the structure of these objects, by describing a decomposition of any…

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

In 2015, Archdeacon proposed the notion of Heffter arrays in view of its connection to several other combinatorial objects. In the same paper he also presented the following variant. A weak Heffter array $\mathrm{W}\mathrm{H}(m,n;h,k)$ is…

We attempt to explain the ubiquity of tableaux and of Pieri and Cauchy formulae for combinatorially defined families of symmetric functions. We show that such formulae are to be expected from symmetric functions arising from representations…

A superposition of a matrix ensemble refers to the ensemble constructed from two independent copies of the original, while a decimation refers to the formation of a new ensemble by observing only every second eigenvalue. In the cases of the…

Based on the direct-sum-decomposition of the rth tensor power of the defining representation of the special orthogonal group SO(2k+1) one is interested in a bijective approach for determining the Frobenius characters of the isotypic…

The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that…

Let $A(\ell,n,k)$ denote the number of $\ell$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We provide a new proof of an explicit formula for $A(\ell,n,k)$…

We construct a functor associating a cubical set to a (simple) graph. We show that cubical sets arising in this way are Kan complexes, and that the A-groups of a graph coincide with the homotopy groups of the associated Kan complex. We use…

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

The purpose of this article is to study the relation between combinatorial equivalence and topological conjugacy, specifically how a certain type of combinatorial equivalence implies topological conjugacy. We introduce the concept of…