CERES in higher-order logic

We define a generalization of the first-order cut-elimination method CERES to higher-order logic. At the core of lies the computation of an (unsatisfiable) set of sequents (the characteristic sequent set) from a proof π of a sequent S. A refutation of in a higher-order resolution calculus can be used to transform cut-free parts of π (the proof projections) into a cut-free proof of S. An example illustrates the method and shows that can produce meaningful cut-free proofs in mathematics that traditional cut-elimination methods cannot reach.     

Valuations and closure operators on finite lattices

Let L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)≤f(x)+f(y), supermodular if f(x∧y)+f(x∨y)≥f(x)+f(y), and modular if it is both submodular and supermodular. Modular functions on a finite lattice form a finite dimensional vector space. For finite distributive lattices, we compute this (modular) dimension. This turns out to be another characterization of distributivity (Theorem 3.9). We also present a correspondence between isotone submodular evaluations and closure operators on finite lattices (Theorem 5.5). This interplay between closure operators and evaluations should be understood as building a bridge between qualitative and quantitative data analysis.     

Continuous Blooming of Convex Polyhedra

We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming.     

Supporting offshoring and nearshoring decisions for mass customization manufacturing processes

Offshore countries attract companies for a possible relocation of production processes through extremely low worker wages. Particularly, mass production processes seem to be highly appropriate for a relocation. However, while the impact of wage reductions can be directly estimated, an appropriate determination of additional cost consequences proves to be a complex task. For instance, on account of lower education standards and higher fluctuation rates, the average worker skills in offshore countries are often significantly lower than in high-wage countries like the United States. In order to appropriately analyze and evaluate the resulting tradeoff between wages and worker skills for mass customization manufacturing systems, this paper introduces a new approach that comprises a detailed mixed-model assembly line balancing. This approach provides a direct comparison of the estimated variable manufacturing costs by generating a country-dependent line layout for all competing locations. In order to validate the efficiency of the balancing approach and, in particular, derive general implications for management, several test series with various country configurations were executed. First, by attaining improvement rates of up to 40%, the capability of a generated Tabu Search procedure for finding appropriate line layouts was proven. Second, as the main result, the complexity of the variant program was identified as a crucial factor for offshoring decisions since it substantially affects variable manufacturing costs. This was particularly proven for countries with low worker skills, which attract offshoring/nearshoring through exceptionally low labor costs. Hence, companies that consider outsourcing production systems to those countries are strongly hold to examine these decisive effects thoroughly. Regarding this, offshoring becomes very promising for manufacturing processes characterized by a moderate variant complexity level.     

A comparison of multiple criteria analysis techniques for water resource management

Multiple criteria analysis (MCA) is a framework for evaluating decision options against multiple criteria. Numerous techniques for solving an MCA problem are available. This paper applies MCA to six water management decision problems. The MCA methods tested include weighted summation, range of value, PROMTHEE II, Evamix and compromise programming. We show that different MCA methods were in strong agreement with high correlations amongst rankings. In the few cases where strong disagreement between MCA methods did occur it was due to presence of mixed ordinal-cardinal data in the evaluation matrix. The results suggest that whilst selection of the MCA technique is important more emphasis is needed on the initial structuring of the decision problem, which involves choosing criteria and decision options.     

Atomistic phenomena in dense fluid shock waves

The shock structure problem is one of the classical problems of fluid mechanics and at least for non-reacting dilute gases it has been considered essentially solved. Here we present a few recent findings, to show that this is not the case. There are still new physical effects to be discovered provided that the numerical technique is general enough to not rule them out a priori. While the results have been obtained for dense fluids, some of the effects might also be observable for shocks in dilute gases.     

Telescoping, rational-valued series, and zeta functions

We give an effective procedure for determining whether or not a series telescopes when is a rational function with complex coefficients. We give new examples of series , where is a rational function with integer coefficients, that add up to a rational number. Generalizations of the Euler phi function and the Riemann zeta function are involved. We give an effective procedure for determining which numbers of the form are rational. This procedure is conditional on 3 conjectures, which are shown to be equivalent to conjectures involving the linear independence over the rationals of certain sets of real numbers. For example, one of the conjectures is shown to be equivalent to the well-known conjecture that the set is linearly independent, where is the Riemann zeta function.

Some series of the form , where is a quotient of symmetric polynomials, are shown to be telescoping, as is . Quantum versions of these examples are also given.

     

Posets and planar graphs

A k-decomposition (G₁,…,G_k) of a graph G is a partition of its edge set to form k spanning subgraphs G₁,…,G_k. The classical theorem of Nordhaus and Gaddum bounds χ(G₁) + χ(G₂) and χ(G₁)χ(G₂) over all 2-decompositions of K_n. For a graph parameter p, let p(k;G) denote the maximum of over all k-decompositions of the graph G. The clique number ω, chromatic number χ, list chromatic number χℓ, and Szekeres–Wilf number σ satisfy ω(2;K_n) = χ(2;K_n) = χℓ(2;K_n) = σ(2;K_n) = n + 1. We obtain lower and upper bounds for ω(k;K_n), χ(k;K_n), χℓ(k;K_n), and σ(k;K_n). The last three behave differently for large k. We also obtain lower and upper bounds for the maximum of χ(k;G) over all graphs embedded on a given surface. © 2005 Wiley Periodicals, Inc. J Graph Theory