نتایج جستجو برای: p exact sequence

تعداد نتایج: 1736549  

Journal: :Journal of Symbolic Computation 2021

2007
WOLFGANG SMITH J. W. SMITH

As our second example we consider the case where TT is a differentiable submersion (in the usual sense) of codimension 1. Thus we assume that X, B are C°°-manifolds of dimensions n + 1 and n, respectively, and that TT is a regular differentiate map. Such a submersion is orientable if the induced line element field on X is orientable, and w will be called simple if w~(b) is connected for all bÇEB.

Journal: :Journal of the American Statistical Association 2017

In this article, we show the existence of certain exact sequences with respect to two homology theories, called d-homology and extended d-homology. We present sufficient conditions for the existence of long exact extended d- homology sequence. Also we give some illustrative examples.

Journal: :Operations Research 2007
Sándor P. Fekete Jörg Schepers Jan van der Veen

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational re...

Journal: :International Journal of Mathematics and Mathematical Sciences 2003

2007
Serge Bouc

In this paper, I show that if p is an odd prime, and if P is a finite p-group, then there exists an exact sequence of abelian groups 0→ T (P )→ D(P )→ lim ←− 1<Q≤P D (

2012
Marek Cygan Fabrizio Grandoni Stefano Leonardi Marcin Pilipczuk Piotr Sankowski

In this paper we focus on problems characterized by an input n-node tree and a collection of subpaths. Motivated by the fact that some of these problems admit a very good approximation (or even a poly-time exact algorithm) when the input tree is a path, we develop a decomposition theorem of trees into paths. Our decomposition allows us to partition the input problem into a collection of O(log l...

Journal: :European Journal of Operational Research 2008
Gustavo H. A. Martins Robert F. Dell

This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxes have identical rectangular dimensions and, when placed, must be located completely within the pallet. Boxes may be rotated 90 so long as they are placed with edges parallel to the pallet’s edges. The set of all PLP i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید