A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. Recently Andersen et al. [3] and Cornuéjols and Margot [17] showed that the facet-defining inequalities of this set are either split cuts or intersection cuts obtained from lattice-free triangles and quadrilaterals. Throug...

This paper introduces MetTeL2, a tableau prover generator producing Java code from the specification of a logical syntax and a tableau calculus. It is intended to provide an easy to use system for non-technical users and allow technical users to extend the generated implementations.

in this paper a new method is proposed for interpretation of 2d magnetic data, using multiples of the analytic signal method, in which the analytic signal of magnetic anomaly is used directly to compute the depth and the structural index of the source instead of using its higher order derivatives. this method only needs the computation of the first order derivatives of the magnetic anomaly, so ...

Metal ion sensors are an important yet challenging field in analytical chemistry. Despite much effort, only a limited number of metal ion sensors are available for practical use because sensor design is often a trial-and-error-dependent process. DNAzyme-based sensors, in contrast, can be developed through a systematic selection that is generalizable for a wide range of metal ions. Here, we summ...

This paper discusses a new strategy to decide Dummett logic. The strategy relies on a tableau calculus whose distinguishing features are the rules for implicative formulas. The strategy has been implemented and the experimental results are reported.

Let λ be a partition, and denote by f λ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing f λ was determined in the classical work of Logan and Shepp and, independently, of Vershik and Kerov. The analogue problem, where the number of parts of λ is bounded by a fixed number, was done by Askey and Regev – though some steps in this work were assumed without a proof. ...

tableau for that formula. The test generally does not terminate, but it does if a given formula is bisimulation invariant, i.e., the test is positive.

Nakajima introduced a certain set of monomials characterizing the irreducible highest weight crystals B(λ). The monomial set can be extended so that it contains B(∞) in addition to B(λ). We give explicit new realizations of the crystals B(∞) and B(λ) over special linear Lie algebras in the language of extended Nakajima monomials. Also, we introduce Young tableau realization of the crystal B(∞) ...

We give an account of the construction of exterior differential systems based on the notion of tableaux over Lie algebras as developed in [33]. The definition of a tableau over a Lie algebra is revisited and extended in the light of the formalism of the Spencer cohomology; the question of involutiveness for the associated systems and their prolongations is addressed; examples are discussed.

Recursive decomposition of fundamental events in the directional, one-dimensional, discrete, stationary Boolean model has resulted in analytic representation of the event probabilities and the recursive representation of clump-length and gap-length densities. This paper applies the methodology to find analytic expressions for distributions of a number of random variables, including the number o...