Adams operations on higherK-theory

We construct Adams operations on higher algebraicK-groups induced by operations such as symmetric powers on any suitable exact category, by constructing an explicit map of spaces, combinatorially defined. The map uses theS-construction of Waldhausen, and deloops (once) earlier constructions of the map.Supported by NSF grant DMS 90-02715     

Multilinear Quantum Lie Operations

It is proved that under an existence condition, the dimension of all n-linear quantum Lie operations lies between (n - 2)! and (n - 1)!; moreover, the low bound is attained if the intersection of all conforming (i.e., satisfying the existence condition) subsets of a given set of quantum variables is nonempty. The upper bound is attained if all subsets are conforming. The space of multilinear quantum Lie operations is almost always generated by symmetric operations. All exceptional cases are given. In particular, the space of general n-linear Lie operations is always generated by general symmetric quantum Lie operations. Bibliography: 24 titles.     

On Steenrod Operations in Oriented and Special Unitary Cobordism Theories

Algebras of Steenrod operations in oriented and special unitary cobordisms are constructed. The representing spectra of SO- and SU-cobordisms are studied. It is shown that on the corresponding spectra, there exists the structure of a multiplicative family over a suitable bioperad. The connection with Steenrod operations proposed by T. tom Dieck is established. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 19, Topology and Noncommutative Geometry, 2004.     

An algebra of skew primitive elements

We study the various term operations on the set of skew primitive elements of Hopf algebras, generated by skew primitive semi-invariants of an Abelian group of grouplike elements. All 1-linear binary operations are described and trilinear and quadrilinear operations are given a detailed treatment. Necessary and sufficient conditions for the existence of multilinear operations are specified in terms of the property of particular polynomials being linearly dependent and of one arithmetic condition. We dub the conjecture that this condition implies, in fact, the linear dependence of the polynomials in question and so is itself sufficient. Supported by RFFR grant No. 95-01-01356, and by the National Society of researchers, Mexico (exp. 18740, 1997). Translated fromAlgebra i Logika, Vol. 37, No. 2, pp. 181–223, March–April, 1998.     

On Pairs of Dual Consequence Operations

In the paper, the authors discuss two kinds of consequence operations characterized axiomatically. The first one are consequence operations of the type Cn ⁺ that, in the intuitive sense, are infallible operations, always leading from accepted (true) sentences of a deductive system to accepted (true) sentences of the deductive system (see Tarski in Monatshefte für Mathematik und Physik 37:361–404, 1930, Comptes Rendus des Séances De la Société des Sciences et des Lettres de Varsovie 23:22–29, 1930; Pogorzelski and Słupecki in Stud Logic 9:163–176, 1960, Stud Logic 10:77–95, 1960). The second kind are dual consequence operations of the type Cn ⁻ that can be regarded as anti-infallible operations leading from non-accepted (rejected, false) sentences of a deductive system to non-accepted (rejected, false) sentences of the system (see Słupecki in Funkcja Łukasiewicza, 33–40, 1959; Wybraniec-Skardowska in Teoria zdań odrzuconych, 5–131, Zeszyty Naukowe Wyższej Szkoły Inżynierskiej w Opolu, Seria Matematyka 4(81):35–61, 1983, Ann Pure Appl Logic 127:243–266, 2004, in On the notion and function of rejected propositions, 179–202, 2005). The operations of the types Cn ⁺ and Cn ⁻ can be ordinary finitistic consequence operations or unit consequence operations. A deductive system can be characterized in two ways by the following triple:

The stable set problem and the lift-and-project ranks of graphs

We study the lift-and-project procedures for solving combinatorial optimization problems, as described by Lovász and Schrijver, in the context of the stable set problem on graphs. We investigate how the procedures' performances change as we apply fundamental graph operations. We show that the odd subdivision of an edge and the subdivision of a star operations (as well as their common generalization, the stretching of a vertex operation) cannot decrease the N₀-, N-, or N₊-rank of the graph. We also provide graph classes (which contain the complete graphs) where these operations do not increase the N₀- or the N-rank. Hence we obtain the ranks for these graphs, and we also present some graph-minor like characterizations for them. Despite these properties we give examples showing that in general most of these operations can increase these ranks. Finally, we provide improved bounds for N₊-ranks of graphs in terms of the number of nodes in the graph and prove that the subdivision of an edge or cloning a vertex can increase the N₊-rank of a graph.Research of these authors was supported in part by a PREA from Ontario, Canada and research grants from NSERC.Mathematics Subject Classification (2000): 0C10, 90C22, 90C27, 47D20     

An O(n 3 L) primal interior point algorithm for convex quadratic programming

We present a primal interior point method for convex quadratic programming which is based upon a logarithmic barrier function approach. This approach generates a sequence of problems, each of which is approximately solved by taking a single Newton step. It is shown that the method requires iterations and O(n ^3.5 L) arithmetic operations. By using modified Newton steps the number of arithmetic operations required by the algorithm can be reduced to O(n ³ L).This research was supported in part by NSF Grant DMS-85-12277 and ONR Contract N-00014-87-K0214. It was presented at the Meeting on Mathematische Optimierung, Mathematisches Forschungsinstitut, Oberwolfach, West Germany, January 3–9, 1988.     

On the solution of concave knapsack problems

We consider a version of the knapsack problem which gives rise to a separable concave minimization problem subject to bounds on the variables and one equality constraint. We characterize strict local miniimizers of concave minimization problems subject to linear constraints, and use this characterization to show that although the problem of determining a global minimizer of the concave knapsack problem is NP-hard, it is possible to determine a local minimizer of this problem with at most O(n logn) operations and 1+[logn] evaluations of the function. If the function is quadratic this algorithm requires at most O(n logn) operations.Work supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research of the U.S. Department of Energy under Contract W-31-109-Eng-38.Work supported in part by a Fannie and John Hertz Foundation graduate fellowship.     

P.L.-Spheres,convex polytopes,and stress

We describe here the notion of generalized stress on simplicial complexes, which serves several purposes: it establishes a link between two proofs of the Lower Bound Theorem for simplicial convex polytopes; elucidates some connections between the algebraic tools and the geometric properties of polytopes; leads to an associated natural generalization of infinitesimal motions; behaves well with respect to bistellar operations in the same way that the face ring of a simplicial complex coordinates well with shelling operations, giving rise to a new proof that p.l.-spheres are Cohen-Macaulay; and is dual to the notion of McMullen's weights on simple polytopes which he used to give a simpler, more geometric proof of theg-theorem. Supported in part by NSF Grants DMS-8504050 and DMS-8802933, by NSA Grant MDA904-89-H-2038, by the Mittag-Leffier Institute, by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center, NSF-STC88-09648, and by a grant from the EPSRC.     

Weight filtrations via commuting automorphisms

We consider a filtration of theK-theory space for a regular Noetherian ring proposed by Goodwillie and Lichtenbaum and show that its successive quotients are geometric realizations of explicit simplicial Abelian groups. The filtration in weightt involvest-tuples of commuting automorphisms of projectiveR-modules. It remains to show that the Adams operations act appropriately on the filtration.Supported by NSF grant DMS 90-02715. I thank Tom Goodwillie, Stephen Lichtenbaum, Friedhelm Waldhausen, Steven Landsburg, and Stephen Ullom for useful discussions and ideas.     

Optimal search trees and length restricted codes

An algorithm is given for constructing ad-ary search tree of minimum weighted path length forn nonnegative weights with restricted maximal depthL. It requires at mostLn ^d operations, but for most sets of weights much less, often near the minimalLn ² operations. The algorithm is shown also to solve the problem of constructing optimal, prefix codes with restricted maximal length and with all code word lengths restricted to multiples of the shortest code word length. The algorithm is useful, for example, in the design of directly executed languages and in file searching applications.This work has in part been supported by the Swedish Board for Technical Development (78-3762).     

Multi-fuzzy sets: An extension of fuzzy sets

In this paper we propose a method to construct more general fuzzy sets using ordinary fuzzy sets as building blocks. We introduce the concept of multi-fuzzy sets in terms of ordered sequences of membership functions. The family of operations T, S, M of multi-fuzzy sets are introduced by coordinate wise t-norms, s-norms and aggregation operations. We define the notion of coordinate wise conjugation of multifuzzy sets, a method for obtaining Atanassov’s intuitionistic fuzzy operations from multi-fuzzy sets. We show that various binary operations in Atanassov’s intuitionistic fuzzy sets are equivalent to some operations in multi-fuzzy sets like M operations, 2-conjugates of the T and S operations. It is concluded that multi-fuzzy set theory is an extension of Zadeh’s fuzzy set theory, Atanassov’s intuitionsitic fuzzy set theory and L-fuzzy set theory.     

On the parallel evaluation of a sparse polynomial at a point

A new version of the Ruffini–Horner rule is presented for the evaluation of a polynomial of degree n at a point. In the PRAM model of parallel computation the new algorithm requires log n parallel steps with n/2+1 processors and the total number of arithmetic operations is n+⌈log₂(n+1)⌉ -1 multiplications and n additions. If the polynomial is sparse, i.e., the number of nonzero coefficients is k≪ n, then the total number of operations is at most k(⌈log n⌉- ⌊log k⌋)+2k+⌈log n⌉. Moreover, similarly to the customary Ruffini–Horner rule, the algorithm is backward numerically stable. In other words, the value provided by applying the algorithm in floating point arithmetic with machine precision μ coincides with the value taken on at the same point by a slightly perturbed polynomial. This revised version was published online in June 2006 with corrections to the Cover Date.     

Network design: taxi planning

The effect of managing aircraft movements on the airport’s ground is an important tool that can alleviate the delays of flights, specially in peak hours or congested situations. Although some strategic design decisions regarding aeronautical and safety aspects have a main impact on the airport’s topology, there exists a number of other additional factors that must be evaluated according to the on ground operations, i.e. previous to the taking-off or after landing. Among these factors one can consider capacities at waiting points and directions of some corridors. These factors are related to the demand situation of a given period and influence the aircraft’s routing on the ground or short term Taxi Planning problem (or TP-S). While the TP-S problem studies the aircraft routing and scheduling on the airport’s ground under a dynamic point of view, this paper presents a Taxi Planning network design model (or TPND), attending to these additional factors of the airport’s topology and the conflicting movements of the aircraft on them with the same modelling approach used in the TP-S problem. The TPND model is formulated as a binary multicommodity network flow problem with additional side constraints under a multiobjective approach. The side constraints included are the classical limitations due to capacity and also as a distinctive approach, constraints that restrict the interference of aircraft in order to decrease the intervention of human controllers during the operations or increase their safety margins. The multiobjective approach adopted for the TPND model balances conflicting objectives: airport’s throughput, travel times, safety of operations and costs. In the paper computational results are included on two test airports solving the TPND model by “Branch and Bound” showing the effect of the conflicting objectives in the design decisions. Research supported under Research Project TRA-2005-09068-C03-01/MODAL from the “Ministerio de Educación y Ciencia”.     

Relationships between pure tail orderings of lifetime distributions and some concepts of residual life

The concepts of pure-tail orderings as defined by sq- and D-orderings are shown to order the family of reliability life distributions which age smoothly in a natural way. This ordering extends to comparisons regarding the limiting behavior of the residual life, mean residual life, sojourn time between perfect repairs in repairable systems, failure rate and, through the preservation of sq- and D-orderings by various reliability operations, to certain coherent systems of components that age smoothly. Possible applications of the results to the industrial practice of cannibalization are also noted.     

Improved Bounds for Acyclic Job Shop Scheduling

In acyclic job shop scheduling problems there are n jobs and m machines. Each job is composed of a sequence of operations to be performed on different machines. A legal schedule is one in which within each job, operations are carried out in order, and each machine performs at most one operation in any unit of time. If D denotes the length of the longest job, and C denotes the number of time units requested by all jobs on the most loaded machine, then clearly lb = max[C,D] is a lower bound on the length of the shortest legal schedule. A celebrated result of Leighton, Maggs, and Rao shows that if all operations are of unit length, then there always is a legal schedule of length O(lb), independent of n and m. For the case that operations may have different lengths, Shmoys, Stein and Wein showed that there always is a legal schedule of length , where the notation is used to suppress terms. We improve the upper bound to . We also show that our new upper bound is essentially best possible, by proving the existence of instances of acyclic job shop scheduling for which the shortest legal schedule is of length . This resolves (negatively) a known open problem of whether the linear upper bound of Leighton, Maggs, and Rao applies to arbitrary job shop scheduling instances (without the restriction to acyclicity and unit length operations). Received June 30, 1998 RID="*" ID="*" Incumbent of the Joseph and Celia Reskin Career Development Chair RID="†" ID="†" Research was done while staying at the Weizmann Institute, supported by a scholarship from the Minerva foundation.     

Companion <Emphasis Type="Italic">d</Emphasis>-algebras

In this paper we develop a theory of companion d-algebras in sufficient detail to demonstrate considerable parallelism with the theory of BCK-algebras as well as obtaining a collection of results of a novel type. Included among the latter are results on certain natural posets associated with companion d-algebras as well as constructions on Bin(X), the collection of binary operations on the set X, which permit construction of new companion d-algebras from companion d-algebras X also in natural ways. Supported by Korea Research Foundation Grant (KRF-2002-041-C00003).     

Galois theory for sets of operations closed under permutation,cylindrification, and composition

A set of operations on A is shown to be the set of linear term operations of some algebra on A if and only if it is closed under permutation of variables, addition of inessential variables, and composition, and if it contains all projections. A Galois framework is introduced to describe the sets of operations that are closed under the operations mentioned above, not necessarily containing all projections. The dual objects of this Galois connection are systems of pointed multisets, and the Galois closed sets of dual objects are described accordingly. Moreover, the closure systems associated with this Galois connection are shown to be uncountable (even if the closed sets of operations are assumed to contain all projections).     

A fast algorithm for scalar Nevanlinna-Pick interpolation

Summary In this paper, we derive a fast algorithm for the scalar Nevanlinna-Pick interpolation. Givenn distinct pointsz _i in the unit disk |z|<1 andn complex numbersw _i satisfying the Pick condition for 1in, the new Nevanlinna-Pick interpolation algorithm requires onlyO(n) arithmetic operations to evaluate the interpolatory rational function at a particular value ofz, in contrast to the classical algorithm which requiresO(n ²) arithmetic operations to compute the so-called Fenyves array (which is inherent in the classical algorithm). The new algorithm bypasses the generation of the Fenyves array to speed up the computation, and also yields a parallel scheme requiring onlyO(logn) arithmetic operations on a concurrent-read, exclusive-write parallel random access machine withn processors. We must remark that the rational functionf(z) computed by the new algorithm is one degree higher than the function computed by the classical algorithm.Supported in part by the US Army Research Office Grant No. DAAL03-91-G-0106