Related papers: Tower Tableaux
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…
We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…
In our companion paper, we develop a new $SL_4$-web basis. Basis elements are given by certain planar graphs and are constructed so that important algebraic operations can be performed diagrammatically. A guiding principle behind our…
We propose a duality between quiver gauge theories and the combinatorics of dimer models. The connection is via toric diagrams together with multiplicities associated to points in the diagram (which count multiplicities of fields in the…
We present a new type system combining refinement types and the expressiveness of intersection type discipline. The use of such features makes it possible to derive more precise types than in the original refinement system. We have been…
Combining a standard proof search method, such as resolution or tableaux, and rewriting is a powerful way to cut off search space in automated theorem proving, but proving the completeness of such combined methods may be challenging. It may…
There is a long tradition of categorifying combinatorial Hopf algebras by the modules of a tower of algebras (or even better via the representation theory of a tower of groups). From the point of view of combinatorics, such a…
We construct a tower of fibrations approximating the derived mapping space between two simplicially enriched operads subject to mild conditions. The n-th stage of the tower is obtained by neglecting operations with more than n inputs. The…
Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…
We show that there is a bijection between the subtoposes of the classifying topos of a geometric theory T over a signature L and the closed geometric theories over L which are `quotients' of the theory T; next, we analyze how classical…
Persistent homology is a technique recently developed in algebraic and computational topology well-suited to analysing structure in complex, high-dimensional data. In this paper, we exposit the theory of persistent homology from first…
This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…
We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
Computational topology provides a tool, persistent homology, to extract quantitative descriptors from structured objects (images, graphs, point clouds, etc). These descriptors can then be involved in optimization problems, typically as a…
Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the descriptions of stack-sortable (Knuth 1975) and…
Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…
We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…