A correction of the justification of the Dietrich-escudero-garín-pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates

Summary In this brief note we present a correction of the Propositions 1 and 5 for proving the O(n) complexity of the algorithms described in [Dietrich et al. (1993)] for identifying maximal cliques and non-dominated covers from extensions of consecutive minimal covers and alternates implied by 0–1 knapsack constraints.     

Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems

This paper is concerned with classical concave cost multi-echelon production/inventory control problems studied by W. Zangwill and others. It is well known that the problem with m production steps and n time periods can be solved by a dynamic programming algorithm in O(n ⁴ m) steps, which is considered as the fastest algorithm for solving this class of problems. In this paper, we will show that an alternative 0–1 integer programming approach can solve the same problem much faster particularly when n is large and the number of 0–1 integer variables is relatively few. This class of problems include, among others problem with set-up cost function and piecewise linear cost function with fewer linear pieces. The new approach can solve problems with mixed concave/convex cost functions, which cannot be solved by dynamic programming algorithms.     

Four (2 + 1)-dimensional integrable extensions of the KdV equation: Multiple-soliton and multiple singular soliton solutions

In this work, four (2 + 1)-dimensional nonlinear completely integrable equations, generated by extending the KdV equation are developed. The necessary condition for the complete integrability of these equation are formally derived. Multiple-soliton solutions and multiple singular soliton solutions are determined to emphasize the compatability of these models. The dispersion relations of these models are characterized by distinct physical structures. The resonance phenomenon for these equations does not exist for any model.     

The limiting case of Haglund's (q,t)-Schröder theorem and an involution formula

As a generalization of Haglund's statistic on Dyck paths [Conjectured statistics for the q,t-Catalan numbers, Adv. Math. 175 (2) (2003) 319–334; A positivity result in the theory of Macdonald polynomials, Proc. Nat. Acad. Sci. 98 (2001) 4313–4316], Egge et al. introduced the (q,t)-Schröder polynomial S_n,d(q,t), which evaluates to the Schröder number when q=t=1 [A Schröder generalization of Haglund's statistic on Catalan paths, Electron. J. Combin. 10 (2003) 21pp (Research Paper 16, electronic)]. In their paper, S_n,d(q,t) was conjectured to be equal to the coefficient of a hook shape on the Schur function expansion of the symmetric function e_n, which Haiman [Vanishing theorems and character formulas for the Hilbert scheme of points in the plane, Invent. Math. 149 (2002) 371–407] has shown to have a representation-theoretic interpretation. This conjecture was recently proved by Haglund [A proof of the q,t-Schröder conjecture, Internat. Math. Res. Not. (11) (2004) 525–560]. However, because that proof makes heavy use of symmetric function identities and plethystic machinery, the combinatorics behind it is not understood. Therefore, it is worthwhile to study it combinatorially. This paper investigates the limiting case of the (q,t)-Schröder Theorem and obtains interesting results by looking at some special cases.     

The Groups H3(F(X)/FM) and CH2(X) for Generic Splitting Varieties of Quadratic Forms

Let F be a field of characteristic different from 2 and be a quadratic form over F. Let X be an arbitrary projective homogeneous generic splitting variety of . For example, we can take X to be equal to the variety X_,m of totally isotropic m-dimensional subspaces of V, where V is the quadratic space corresponding to and < dim V. In this paper, we study the groups CH²(X) and H³(F(X)/F) = ker(H ³(F) H ³(F(X))). One of the main results of this paper claims that the group Tors CH²(X) is always zero or isomorphic to . In many cases we prove that Tors CH²(X) = 0 and compute the group H ³(F(X)/F) completely. As an application of the main results, we give a criterion of motivic equivalence of eight-dimensional forms except for the case where the Schur indices of their Clifford algebras equal 4.     

Differential-geometric Newton method for the best rank-(R1, R2, R3) approximation of tensors

An increasing number of applications are based on the manipulation of higher-order tensors. In this paper, we derive a differential-geometric Newton method for computing the best rank-(R ₁, R ₂, R ₃) approximation of a third-order tensor. The generalization to tensors of order higher than three is straightforward. We illustrate the fast quadratic convergence of the algorithm in a neighborhood of the solution and compare it with the known higher-order orthogonal iteration (De Lathauwer et al., SIAM J Matrix Anal Appl 21(4):1324–1342, 2000). This kind of algorithms are useful for many problems. This paper presents research results of the Belgian Network DYSCO (Dynamical Systems, Control, and Optimization), funded by the Interuniversity Attraction Poles Programme, initiated by the Belgian State, Science Policy Office. The scientific responsibility rests with its authors. Research supported by: (1) Research Council K.U.Leuven: GOA-Ambiorics, CoE EF/05/006 Optimization in Engineering (OPTEC), (2) F.W.O.: (a) project G.0321.06, (b) Research Communities ICCoS, ANMMM and MLDM, (3) the Belgian Federal Science Policy Office: IUAP P6/04 (DYSCO, “Dynamical systems, control and optimization”, 2007–2011), (4) EU: ERNSI. M. Ishteva is supported by a K.U.Leuven doctoral scholarship (OE/06/25, OE/07/17, OE/08/007), L. De Lathauwer is supported by “Impulsfinanciering Campus Kortrijk (2007–2012)(CIF1)” and STRT1/08/023.