✦ LIBER ✦

The number of indecomposable terms in direct decompositions of groups with the maximal condition

✍ Scribed by R. Hirshon

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 561 KB
Volume: 75
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(82)90064-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Certain groups with bounded movement hav

Certain groups with bounded movement having the maximal number of orbits

✍ Pan Soo Kim; Yangkok Kim 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 90 KB

Let G be a permutation group on a set Ω such that G has no fixed points in Ω. If, for a given positive integer m, the cardinalities |Γ g \Γ | is at most m for all g ∈ G and Γ ⊆ Ω, then G is said to have bounded movement m on Ω. When the maximum of |Γ g \Γ | over all g ∈ G and Γ ⊆ Ω is equal to m, we

The Maximal Number of Orbits of a Permut

The Maximal Number of Orbits of a Permutation Group with Bounded Movement

✍ Jung R. Cho; Pan Soo Kim; Cheryl E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 58 KB

Bounding the crossing number of a graph

Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree

✍ Enrique Garcia-Moreno; Gelasio Salazar 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 3 views

The maximization of internal pressure of

The maximization of internal pressure of compound cylinders in the elastic condition using an accelerated direct search technique

✍ R.D. Venter; M.C. de Malherbe 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Bounding the structure constants of a gr

Bounding the structure constants of a group in terms of its number of irreducible character degrees

✍ Sidney C Garrison 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Maximizing the weighted number of on-tim

Maximizing the weighted number of on-time jobs in single machine scheduling with time windows

✍ C. Koulamas 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 541 KB

The problem of maximizing the weighted number of on-time jobs on a single machine with time windows (STW) is shown to be strongly NP-hard. An efficient. heuristic is presented for STW. Computational experiments indicate that the performance of the heuristic is quite good.