Confidence regions in a multivariate regression model with constraints II

The multivariate model, where not only parameters of the mean value of the observation matrix, but also some other parameters occur in constraints, is considered in the paper. Some basic inference is presented under the condition that the covariance matrix is either unknown, or partially unknown, or known. Supported by the grant of the Council of Czech Republic MSM 6 198 959 214.     

Constraint incorporation in optimization

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.     

Division and <Emphasis Type="Italic">k</Emphasis>-th root theorems for <Emphasis Type="Italic">Q</Emphasis>-manifolds

We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z _∞-points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: K → X of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X ² and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space X ∈ χ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Y ∈ χ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists. This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07)     

A Spherical Decomposition for Riemannian Open 3-Manifolds

We show that open 3-manifolds that have a locally finite decomposition along 2-spheres are characterized by the existence of a Riemannian metric with respect to which the second homotopy group of the manifold is generated by small elements. Received: November 2005 Revision: February 2006 Accepted: May 2006     

Lagrangian skeletons,periodic geodesic flows and symplectic cuttings

In this paper, we investigate symplectic manifolds endowed with a Morse–Bott function with only two critical submanifolds, one of which is Lagrangian while the other one is symplectic.     

Prime Fano threefolds and integrable systems

For a general K3 surface S of genus g, with 2 ≤ g ≤ 10, we prove that the intermediate Jacobians of the family of prime Fano threefolds of genus g containing S as a hyperplane section, form generically an algebraic completely integrable Hamiltonian system. The first author is partially supported by grant MI1503/2005 of the Bulgarian Foundation for Scientific Research.     

Primes in quadratic progressions on average

In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.     

On a free group of transformations defined by an automaton

We prove that three automorphisms of the rooted binary tree defined by a certain 3-state automaton generate a free non-Abelian group of rank 3. Both authors are supported by the NSF grants DMS-0308985 and DMS-0456185. Yaroslav Vorobets is supported by a Clay Research Scholarship.     

A local search approach to a circle cutting problem arising in the motor cycle industry

This paper is concerned with the development of a customized circle packing algorithm for a manufacturer of sprockets for the motor cycle industry. Practical constraints mean that the problem differs somewhat from those tackled elsewhere in the literature. In particular, the layouts need to conform to a given structure. This is achieved by using a local search algorithm with an appropriate starting solution and a series of neighbourhoods designed to preserve the layout structure. Empirical evidence based on real data shows that the quality of the resulting solutions closely matches that of cutting patterns currently produced by human experts. Computation times average around 20–30?s per order as compared to several hours for an equivalent manual solution.