Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is Sigma(k)(i=1) vertical bar C(i)vertical bar. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width. (C) 2008 Elsevier B.V. All rights reserved.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

ON THE SUPERCRITICALITY OF THE FIRST HOPF BIFURCATION IN A DELAY BOUNDARY PROBLEM

The goal of this paper is to analyze the character of the first Hopf bifurcation (subcritical versus supercritical) that appears in a one-dimensional reaction-diffusion equation with nonlinear boundary conditions of logistic type with delay. We showed in the previous work [Arrieta et al., 2010] that if the delay is small, the unique non-negative equilibrium solution is asymptotically stable. We also showed that, as the delay increases and crosses certain critical value, this equilibrium becomes unstable and undergoes a Hopf bifurcation. This bifurcation is the first one of a cascade occurring as the delay goes to infinity. The structure of this cascade will depend on the parameters appearing in the equation. In this paper, we show that the first bifurcation that occurs is supercritical, that is, when the parameter is bigger than the delay bifurcation value, stable periodic orbits branch off from the constant equilibrium.

Examples of Self-Iterating Lie Algebras, 2

We study properties of self-iterating Lie algebras in positive characteristic. Let R = K[t(i)vertical bar i is an element of N]/(t(i)(p)vertical bar i is an element of N) be the truncated polynomial ring. Let partial derivative(i) = partial derivative/partial derivative t(i), i is an element of N, denote the respective derivations. Consider the operators v(1) = partial derivative(1) + t(0)(partial derivative(2) + t(1)(partial derivative(3) + t(2)(partial derivative(4) + t(3)(partial derivative(5) + t(4)(partial derivative(6) + ...))))); v(2) = partial derivative(2) + t(1)(partial derivative(3) + t(2)(partial derivative(4) + t(3)(partial derivative(5) + t(4)(partial derivative(6) + ...)))). Let L = Lie(p)(v(1), v(2)) subset of Der R be the restricted Lie algebra generated by these derivations. We establish the following properties of this algebra in case p = 2, 3. a) L has a polynomial growth with Gelfand-Kirillov dimension lnp/ln((1+root 5)/2). b) the associative envelope A = Alg(v(1), v(2)) of L has Gelfand-Kirillov dimension 2 lnp/ln((1+root 5)/2). c) L has a nil-p-mapping. d) L, A and the augmentation ideal of the restricted enveloping algebra u = u(0)(L) are direct sums of two locally nilpotent subalgebras. The question whether u is a nil-algebra remains open. e) the restricted enveloping algebra u(L) is of intermediate growth. These properties resemble those of Grigorchuk and Gupta-Sidki groups.

Lie properties of crossed products

Let F-sigma(lambda)vertical bar G vertical bar be a crossed product of a group G and the field F. We study the Lie properties of F-sigma(lambda)vertical bar G vertical bar in order to obtain a characterization of those crossed products which are upper (lower) Lie nilpotent and Lie (n, m)-Engel. (C) 2008 Elsevier Inc. All rights reserved.

Extensions of homogeneous polynomials ON c(0)(l(2)(i))

We show that a 2-homogeneous polynomial on the complex Banach space c(0)(l(2)(i)) is norm attaining if and only if it is finite (i.e, depends only on finite coordinates). As the consequence, we show that there exists a unique norm-preserving extension for norm-attaining 2-homogeneous polynomials on c(0)(l(2)(i)).

Nuclear elements of degree 6 in the free alternative algebra

We construct five new elements of degree 6 in the nucleus of the free alternative algebra. We use the representation theory of the symmetric group to locate the elements. We use the computer algebra system ALBERT and an extension of ALBERT to express the elements in compact form and to show that these new elements are not a consequence of the known clegree-5 elements in the nucleus. We prove that these five new elements and four known elements form a basis for the subspace of nuclear elements of degree 6. Our calculations are done using modular arithmetic to save memory and time. The calculations can be done in characteristic zero or any prime greater than 6, and similar results are expected. We generated the nuclear elements using prime 103. We check our answer using five other primes.

Finite-dimensional non-associative algebras and codimension growth

Let A be a (non-necessarily associative) finite-dimensional algebra over a field of characteristic zero. A quantitative estimate of the polynomial identities satisfied by A is achieved through the study of the asymptotics of the sequence of codimensions of A. It is well known that for such an algebra this sequence is exponentially bounded. Here we capture the exponential rate of growth of the sequence of codimensions for several classes of algebras including simple algebras with a special non-degenerate form, finite-dimensional Jordan or alternative algebras and many more. In all cases such rate of growth is integer and is explicitly related to the dimension of a subalgebra of A. One of the main tools of independent interest is the construction in the free non-associative algebra of multialternating polynomials satisfying special properties. (C) 2010 Elsevier Inc. All rights reserved.

Description of costandard modules for Schur superalgebra S(2 vertical bar 1) in positive characteristic

We describe the characters of simple modules and composition factors of costandard modules for S(2 vertical bar 1) in positive characteristics and verify a conjecture of La Scala-Zubkov regarding polynomial superinvariants for GL(2 vertical bar 1).

Nil graded self-similar algebras

In [19], [24] we introduced a family of self-similar nil Lie algebras L over fields of prime characteristic p > 0 whose properties resemble those of Grigorchuk and Gupta-Sidki groups. The Lie algebra L is generated by two derivations v(1) = partial derivative(1) + t(0)(p-1) (partial derivative(2) + t(1)(p-1) (partial derivative(3) + t(2)(p-1) (partial derivative(4) + t(3)(p-1) (partial derivative(5) + t(4)(p-1) (partial derivative(6) + ...))))), v(2) = partial derivative(2) + t(1)(p-1) (partial derivative(3) + t(2)(p-1) (partial derivative(4) + t(3)(p-1) (partial derivative(5) + t(4)(p-1) (partial derivative(6) + ...)))) of the truncated polynomial ring K[t(i), i is an element of N vertical bar t(j)(p) =0, i is an element of N] in countably many variables. The associative algebra A generated by v(1), v(2) is equipped with a natural Z circle plus Z-gradation. In this paper we show that for p, which is not representable as p = m(2) + m + 1, m is an element of Z, the algebra A is graded nil and can be represented as a sum of two locally nilpotent subalgebras. L. Bartholdi [3] andYa. S. Krylyuk [15] proved that for p = m(2) + m + 1 the algebra A is not graded nil. However, we show that the second family of self-similar Lie algebras introduced in [24] and their associative hulls are always Z(p)-graded, graded nil, and are sums of two locally nilpotent subalgebras.

Nonhomogeneous subalgebras of Lie and special Jordan superalgebras

We consider polynomial identities satisfied by nonhomogeneous subalgebras of Lie and special Jordan superalgebras: we ignore the grading and regard the superalgebra as an ordinary algebra. The Lie case has been studied by Volichenko and Baranov: they found identities in degrees 3, 4 and 5 which imply all the identities in degrees <= 6. We simplify their identities in degree 5, and show that there are no new identities in degree 7. The Jordan case has not previously been studied: we find identities in degrees 3, 4, 5 and 6 which imply all the identities in degrees <= 6, and demonstrate the existence of further new identities in degree 7. our proofs depend on computer algebra: we use the representation theory of the symmetric group, the Hermite normal form of an integer matrix, the LLL algorithm for lattice basis reduction, and the Chinese remainder theorem. (C) 2009 Elsevier Inc. All rights reserved.

A Character Formula for the Category (O)over-tilde of Modules for Affine sl(2)

One may construct, for any function on the integers, an irreducible module of level zero for affine sl(2) using the values of the function as structure constants. The modules constructed using exponential-polynomial functions realize the irreducible modules with finite-dimensional weight spaces in the category (O) over tilde of Chari. In this work, an expression for the formal character of such a module is derived using the highest weight theory of truncations of the loop algebra.

Stabilizing Nonstationary Electrochemical Time Series

Electrochemical systems are ideal working-horses for studying oscillatory dynamics. Experimentally obtained time series, however, are usually associated with a spontaneous drift in some uncontrollable parameter that triggers transitions among different oscillatory patterns, despite the fact that all controllable parameters are kept constant. Herein we present an empirical method to stabilize experimental potential time series. The method consists of applying a negative galvanodynamic sweep to compensate the spontaneous drift and was tested for the oscillatory electro-oxidation of methanol on platinum. For a wide range of applied currents, the base system presents spontaneous transitions from quasi-harmonic to mixed mode oscillations. Temporal patterns were stabilized by galvanodynamic sweeps at different rates. The procedure resulted in a considerable increase in the number of oscillatory cycles from 5 to 20 times, depending on the specific temporal pattern. The spontaneous drift has been associated with uncompensated oscillations, in which the coverage of some adsorbed species are not reestablished after one cycle; i.e., there is a net accumulation and/or depletion of adsorbed species during oscillations. We interpreted the rate of the galvanodynamic sweep in terms of the time scales of the poisoning processes that underlies the uncompensated oscillations and thus the spontaneous slow drift.

Talangfabriken : Om organisation av kunskap och kreativitet i skivindustrin

The purpose of this dissertation is to describe, explain and understand how record companies identify and develop new music and new talent. The analysis is carried out on three levels: individual, organizational and sector level. In a record company, this task formally goes to A&R (Artist and Repertoire). This dissertation takes its point of departure in how the capacity for discovering new talent can be understood in terms of knowledge, creativity and competence and how this capacity is affected in the meeting between the record company and the industry. The theoretical framework of the dissertation spans two sociological fields: the sociology of organizations and the sociology of knowledge. While it takes its organizational starting point in the Knowledge Company Approach, it employs a practice-based approach to discuss knowledge. I argue that within the Knowledge company approach there are two contrasting ways to understand knowledge; a distinction is made between knowledge- and creativity-intensive enterprises. The results show that the record industry’s polarized structure can be seen as a result of the Knowledge Company’s typical problems. The A&R’s work is described as including two phases, one intuitive and one analytical. The intuitive assessment is direct, unconscious and without reflection. This ability has been described as "intuition" and "gut feeling". The analytical phase adds analysis and reflection based on knowledge. The results from the interviews with A&R’s reveal the limit of formal and explicit knowledge not only in the choice of music but also in the marketing strategies. The overarching picture is one in which record companies move in a space characterized by tension between dichotomous forces – art and commercialism, creativity and knowledge, culture and economy, chaos and order, but where opposite poles are not mutually exclusive but complementary.