Related papers: Folding rotationally symmetrical tableaux via webs
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…
We study the problem of transforming a multi-way contingency table into an equivalent table with uniform margins and same dependence structure. Such a problem relates to recent developments in copula modeling for discrete random vectors.…
We extend the duality between acyclic orientations and totally cyclic orientations on planar graphs to dualities on graphs on orientable surfaces by introducing boundary acyclic orientations and totally bi-walkable orientations. In…
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…
Knowing which parts of a complex system have identical roles simplifies computations and reveals patterns in its network structure. Group theory has been applied to study symmetries in unweighted networks. However, in real-world weighted…
Let $\delta=(\delta_1,\ldots,\delta_n)$ be a string of letters $h$ and $v$. We define a Young tableau to be $\delta$-semistandard if the entries are weakly increasing along rows and columns, and the entries $i$ form a horizontal strip if…
Calculations of the number of equivalence classes of Sudoku boards has to this point been done only with the aid of a computer, in part because of the unnecessarily large symmetry group used to form the classes. In particular, the…
We give a cyclic sieving phenomenon for symplectic $\lambda$-tableaux $SP(\lambda,2m)$, where $\lambda$ is a partition of an odd integer $n$ and $gcd(m,p)=1$ for any odd prime $p\leq n$. We use the crystal structure on Kashiwara-Nakashima…
Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link…
We borrow a classical construction from the study of rational billiards in dynamical systems known as the "unfolding construction" and show that it can be used to study the automorphism group of a Platonic surface. More precisely, the…
In the first part of the paper we present the dressing method which generates multi-soliton solutions to integrable systems of nonlinear partial differential equations. We compare the approach of Neugebauer with that of Zakharov, Shabat and…
The sl_3 spider is a diagrammatic category used to study the representation theory of the quantum group U_q(sl_3). The morphisms in this category are generated by a basis of non-elliptic webs. Khovanov- Kuperberg observed that non-elliptic…
Two new matrix classes are introduced; inverse cyclic matrices and bi-diagonal south-west matrices. An interesting relation is established between these classes. Applications to two classes of inverse $Z$-matrices are provided.
We relate general maps to bipartite maps through a bijection of type slit-slide-sew. We provide an involution on arbitrary genus maps with even degree faces. This enables a full interpretation of the relation between general and bipartite…
Edelman and Greene constructed a bijection between the set of standard Young tableaux and the set of balanced Young tableaux of the same shape. Fomin, Greene, Reiner and Shimozono introduced the notion of balanced Rothe tableaux of a…
A table is an object that captures structured and informative content within a document, and recognizing a table in an image is challenging due to the complexity and variety of table layouts. Many previous works typically adopt a two-stage…
The usefulness of Gabor frames depends on the easy computability of a suitable dual window. This question is addressed under several aspects: several versions of Schulz's iterative algorithm for the approximation of the canonical dual…
Wilson loop diagrams are an important tool in studying scattering amplitudes of SYM $N=4$ theory and are known by previous work to be associated to positroids. We characterize the conditions under which two Wilson loop diagrams give the…
We calculate Wilson loops in lowest order of perturbation theory for triangular contours whose edges are circular arcs. Based on a suitable disentanglement of the relations between metrical and conformal parameters of the contours, the…
We define an action of the symmetric group on the set of domino tableaux, and prove that the number of domino tableaux of a given weight does not depend on the permutation of components of the last. A bijective proof of the well-known…