Related papers: A natural generalization of Balanced Tableaux
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
We give the definition of Lazard and Hall sets in the context of transitive factorizations of free monoids. The equivalence of the two properties is proved. This allows to build new effective bases of free partially commutative Lie…
The concept of "table algebra" was introduced by Z Arad anf H. Blau in order to study in a uniform way properties of products of conjugacy classes and of irreducible characters of a finite group, Except for certain cases which remain open,…
The notion of a natural model of type theory is defined in terms of that of a representable natural transfomation of presheaves. It is shown that such models agree exactly with the concept of a category with families in the sense of Dybjer,…
Given a direct sum $A$ of full matrix algebras, if there is a combinatorial interpretation associated with both the dimension of $A$ and the dimensions of the irreducible $A$-modules, then this can be thought of as providing an analogue of…
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
We show how one may classify all semisimple algebras containing the $\mathfrak{su}(3)\oplus \mathfrak{su}(2) \oplus \mathfrak{u}(1)$ symmetry of the Standard Model and acting on some given matter sector, enabling theories beyond the…
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…
We give new equivalent characterizations for ideals of Borel type. Also, we prove that the regularity of a product of ideals of Borel type is bounded by the sum of the regularities of those ideals.
We introduce edge labeled Young tableaux. Our main results provide a corresponding analogue of [Sch\"{u}tzenberger '77]'s theory of jeu de taquin. These are applied to the equivariant Schubert calculus of Grassmannians. Reinterpreting, we…
Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…
Based on Sch\"utzenberger's evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function…
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…
Type theory plays an important role in foundations of mathematics as a framework for formalizing mathematics and a base for proof assistants providing semi-automatic proof checking and construction. Derivation of each theorem in type theory…
We provide a semi-grammatical description of the set of normal proofs of positive formulae in minimal predicate logic, i.e. a grammar that generates a set of schemes, from each of which we can produce a finite number of normal proofs. This…
We define a family of groups that generalises Thompson's groups $T$ and $G$ and also those of Higman, Stein and Brin. For groups in this family we descrine centralisers of finite subgroups and show, that for a given finite subgroup $Q$,…
Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…