An k-noncrossing RNA structure can be identified with an k-noncrossing diagram over [n], which in turn corresponds to a vacillating tableaux having at most (k − 1) rows. In this paper we derive the limit distribution of irreducible substructures via studying their corresponding vacillating tableaux. Our main result proves, that the limit distribution of the numbers of irreducible substructures ...

Gauge fields of mixed symmetry, corresponding to arbitrary representations of the local Lorentz group of the background spacetime, arise as massive modes in compactifications of superstring theories. We describe bosonic gauge field theories on constant curvature spaces whose fields are in irreducible representations of the general linear group corresponding to Young tableaux with two columns. T...

Services now play a remarkably prominent role in modern economies. Not surprisingly, economists and marketing researchers have begun to turn their attention to the analysis of activities in the so-called tertiary sector. In this chapter we attempt to contribute to the effort of systematizing the analysis of service institutions by integrating perspectives from the economic analysis of instituti...

Smullyan wrote his famous book of puzzles before the boom in automated theorem proving. Hence it is interesting, that all the puzzles can be solved with one method or not. The paper shows how this can be done with analytic tableaux.

The first step towards a wide-coverage tableau prover for natural logic is presented. We describe an automatized method for obtaining Lambda Logical Forms from surface forms and use this method with an implemented prover to hunt for new tableau rules in textual entailment data sets. The collected tableau rules are presented and their usage is also exemplified in several tableau proofs. The perf...

With the help of a tableaux method, determinant formulas for trace generating functions for various classes of shifted plane partitions are derived. Proceeding from these determinants, generalizations of Gansner's (J. hook formulas for shifted plane partitions and alternative proofs of recent results of Proctor about alternating trace generating functions are given.

An overview is provided of some of the basic facts concerning rim hook lattices and ribbon tableaux, using a representation of partitions by their edge sequences. An action is defined of the affine Coxeter group of type Ãr−1 on the r-rim hook lattice, and thereby on the sets of standard and semistandard r-ribbon tableaux, and this action is related to the concept of chains in r-ribbon tableaux....

We characterise those classes of permutations closed under taking subsequences and reindexing that also have the property that for every tableau shape either every permutation of that shape or no permutation of that shape belongs to the class. The characterisation is in terms of the dominance order for partitions (and their conjugates) and shows that for any such class there is a constant k suc...

We describe a general and uniform tableau methodology for multi-modal logics arising from Gabbay’s methodology of fibring and Governatori’s tableau system KEM.

In this paper, diierent variants of classical analytic calculi for rst-order logic are compared with respect to the length of proofs possible in such calculi. A cut-free sequent calculus is used as a prototype for diierent other analytic calculi like analytic tableau or various connection calculi. With modiied branching rules ({rules), non-elementary shorter minimal proofs can be obtained for a...