ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Designs, codes and cryptography 14 (1998), S. 5-22 
    ISSN: 1573-7586
    Keywords: perfect Mendelsohn packing designs ; incomplete perfect Mendelsohn designs ; transversal designs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A (v, k, 1) perfect Mendelsohn packing design (briefly (v, k, 1)-PMPD) is a pair (X, A) where X is a v-set (of points) and A is a collection of cyclically ordered k-subsets of X (called blocks) such that every ordered pair of points of X appears t-apart in at most one block of A for all t = 1, 2,..., k-1. If no other such packing has more blocks, the packing is said to be maximum and the number of blocks in a maximum packing is called the packing number, denoted by P(v, k, 1). The values of the function P(v, 5, 1) are determined here for all v ≥5 with a few possible exceptions. This result is established by means of a result on incomplete perfect Mendelsohn designs which is of interest in its own right.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Aequationes mathematicae 48 (1994), S. 116-116 
    ISSN: 1420-8903
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Aequationes mathematicae 51 (1996), S. 100-114 
    ISSN: 1420-8903
    Keywords: Primary 05B05, 05B15, 20N05 ; Secondary 05B40
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper it is proved that, for any positive integern ≡ 2, 3 (mod 4),n ≥ 7, there exists an incomplete idempotent Schröder quasigroup with one hole of size two IISQ(n, 2) except forn = 10. It is also proved that for any positive integern ≡ 0, 1 (mod 4), there exists an idempotent Schröder quasigroup ISQ(n) except forn = 5 and 9. These results completely determine the spectrum of ISQ(n) and provide an application to the packing of a class of edge-coloured block designs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Aequationes mathematicae 40 (1990), S. 248-260 
    ISSN: 1420-8903
    Keywords: Primary 05B05 ; Secondary 05C20
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Letv andK be positive integers. A (v, k, 1)-Mendelsohn design (briefly (v, k, 1)-MD) is a pair (X,B) whereX is av-set (ofpoints) andB is a collection of cyclically orderedk-subsets ofX (calledblocks) such that every ordered pair of points ofX are consecutive in exactly one block ofB. A necessary condition for the existence of a (v, k, 1)-MD isv(v−1) ≡ 0 (modk). If the blocks of a (v, k, 1)-MD can be partitioned into parallel classes each containingv/k blocks wherev ≡ ) (modk) or (v − 1)/k blocks wherev ≡ 1 (modk), then the design is calledresolvable and denoted briefly by (v, k, 1)-RMD. It is known that a (v, 3,1)-RMD exists if and only ifv ≡ 0 or 1 (mod 3) andv ≠ 6. In this paper, it is shown that the necessary condition for the existence of a (v, 4, 1)-RMD, namelyv ≡ 0 or 1 (mod 4), is also sufficient, except forv = 4 and possibly exceptingv = 12. These constructions are equivalent to a resolvable decomposition of the complete symmetric directed graphK v * onv vertices into 4-circuits.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...