In this paper it is shown that R. Kowalski's connection graph proof procedure /Ko75/ terminates with the empty clause for every unit-refutable clause set, provided an exhaustive search strategy is employed. This result holds for unrestricted tautology deletion, whereas subsumption requires certain precautions. The results are shown for an improved version of the connection graph resolution rule...

We use the Pieri and Giambelli formulas of [BKT1, BKT3] and the calculus of raising operators developed in [BKT2, T1] to prove a tableau formula for the eta polynomials of [BKT3] and the Stanley symmetric functions which correspond to Grassmannian elements of the Weyl group W̃n of type Dn. We define the skew elements of W̃n and exhibit a bijection between the set of reduced words for any skew w ∈...

We deene an action of the symmetric group S n 2 ] on the set of domino tableaux, and prove that the number of domino tableaux of weight 0 does not depend on the permutation of the weight 0. A bijective proof of the well-known result due to J. Stembridge that the number of self{evacuating tableaux of a given shape and weight = (1 ; : : : ; n+1 2 ] ; n 2 ] ; : : : ; 1), is equal to that of domino...

We develop the theory of semi-primary lattices, a class of modular lattices, including abelian subgroup lattices and invariant subspace lattices, in which an integer partition is assigned to every element and every interval. Flags in these lattices give rise to chains of partitions, which may be encoded as tableaux. In certain of these lattices, Steinberg and van Leeuwen respectively have shown...

We obtain a tableau definition of the skew Schubert polynomials named by Lascoux, which are defined as flagged double skew Schur functions. These polynomials are in fact Schubert polynomials in two sets of variables indexed by 321-avoiding permutations. From the divided difference definition of the skew Schubert polynomials, we construct a lattice path interpretation based on the Chen-Li-Louck ...

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in Sn which contain a given permutation τ ∈ Sk as a subsequence; this number depends on the patterns of the first j values of τ for 1 ≤ j ≤ k. We then use this to define a partition of Sk, analogous to Wilf-classes in the study of pattern avoidance, and examine properties of this equivalence. In the process, w...

In signal processing, the approach of the analytic signal is a capable and often used method. For signals of finite length, quadrature filters yield a bandpass filtered approximation of the analytic signal. In the case of multidimensional signals, the quadrature filters can only be applied with respect to a preference direction. Therefore, the orientation has to be sampled, steered or orientati...

The VAST 2010 Challenge consisted of three separate datasets which we investigated with three student teams using three different tools in order to solve each Mini Challenge (MC1-3). The teams met to share findings, request supporting evidence from the other mini challenges, and raise questions for other teams to investigate further. We used CZSaw [1] to investigate the MC1 arms dealer reports ...

gravity and magnetic data are usually processed and interpreted separately, and fully integrated results basically are created in the mind of the interpreter. data interpretation in such a manner requires an interpreter experienced both on topics concerning potential field theory and the geology of the study area. to simplify the joint interpretation of data, the automatic production of auxilia...

We apply Quinn and Rohrbaugh's (1983) competing values framework (CVF) as an organizing taxonomy to meta-analytically test hypotheses about the relationship between 3 culture types and 3 major indices of organizational effectiveness (employee attitudes, operational performance [i.e., innovation and product and service quality], and financial performance). The paper also tests theoretical suppos...