Percentage-Avoiding, Northwest Shapes and Peelable Tableaux
نویسندگان
چکیده
منابع مشابه
Tableaux and plane partitions of truncated shapes ( extended abstract )
We consider a new kind of straight and shifted plane partitions/Young tableaux — ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the number of standard tableaux in certain cases, namely a shifted staircase without the box in its upper right corner, i.e. truncated by a box, a rectangle truncated b...
متن کاملAscending Subsequences of Permutations and the Shapes of Tableaux
We nd an interesting relationship between two diicult counting problems in the theory of symmetric functions. For integer k 1, let y k (n) denote the number of standard Young tableaux on n cells whose rst row is of length k, and let Y k (x) = P n0 y k (n)x n =n!: Let u k (n) be the number of permutations of n letters that have no ascending subse-quence of length > k, and let U k (x) = P n0 u k ...
متن کاملEnumeration of Standard Young Tableaux of certain Truncated Shapes
Unexpected product formulas for the number of standard Young tableaux of certain truncated shapes are found and proved. These include shifted staircase shapes minus a square in the NE corner, rectangular shapes minus a square in the NE corner, and some variations.
متن کاملThe shapes of self-avoiding polygons with torsion
We consider self-avoiding polygons on the simple cubic lattice with a torsion fugacity. We use Monte Carlo methods to generate large samples as a function of the torsion fugacity and the number of edges in the polygon. Using these data we investigate the shapes of the polygons at large torsion fugacity and find evidence that the polygons have substantial helical character. In addition, we show ...
متن کاملHyperS Tableaux - Heuristic Hyper Tableaux
Several syntactic methods have been constructed to automate theorem proving in first-order logic. The positive (negative) hyper-resolution and the clause tableaux were combined in a single calculus called hyper tableaux in [1]. In this paper we propose a new calculus called hyperS tableaux which overcomes substantial drawbacks of hyper tableaux. Contrast to hyper tableaux, hyperS tableaux are e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1998
ISSN: 0097-3165
DOI: 10.1006/jcta.1997.2841