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
    Unknown
    Amsterdam, The Netherlands ; Boston : Elsevier
    Keywords: DDC 514/.325 ; LC QA611.28 ; Distances - Measurement ; Metric spaces
    Pages: Online-Ressource (xv, 391 pages)
    Edition: 1st ed
    ISBN: 9780444520876
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Unknown
    Amsterdam ; New York : North-Holland Pub. Co
    Keywords: DDC 511/.6 ; LC QA164 ; Combinatorial analysis
    Pages: Online-Ressource (xxii, 309 pages)
    ISBN: 9780444861108
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 4 (1988), S. 31-42 
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Two sets of vertices of a hypercubes in ℝ n and ℝ m are said to be equivalent if there exists a distance preserving linear transformation of one hypercube into the other taking one set to the other. A set of vertices of a hypercube is said to be weakly rigid if up to equivalence it is a unique realization of its distance pattern and it is called rigid if the same holds for any multiple of its distance pattern. A method of describing all rigid and weakly rigid sets of vertices of hypercube of a given size is developed. It is also shown that distance pattern of any rigid set is on the face of convex cone of all distance patterns of sets of vertices in hypercubes. Rigid pentagons (i.e. rigid sets of size 5 in hypercubes) are described. It is shown that there are exactly seven distinct types of rigid pentagons and one type of rigid quadrangle. It is also shown that there is a unique weakly rigid pentagon which is not rigid. An application to the study of all rigid pentagons and quadrangles inL 1 having integral distance pattern is also given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of algebraic combinatorics 3 (1994), S. 153-175 
    ISSN: 1572-9192
    Keywords: ℓ1-graph ; cut cone ; rigidity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An ℓ1-graph is a graph whose nodes can be labeled by binary vectors in such a way that the Hamming distance between the binary addresses is, up to scale, the distance in the graph between the corresponding nodes. We show that many interesting graphs are ℓ1-rigid, i.e., that they admit an essentially unique such binary labeling.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 52 (1998), S. 31-47 
    ISSN: 1572-9036
    Keywords: integral system ; root system ; lattice ; polytope
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider uniform odd systems, i.e. sets of vectors of constant odd norm with odd inner product, and the lattice L(V) linearly generated by a uniform odd system V of odd norm 2t+1. If uu ≡ p (mod 4) for all u ∈ V, one has v2 ≡ p (mod 4) if v2 is odd and v2 ≡ 0 (mod 4) if v2 is even, for any vector v ∈ L(V). The vectors of even norm form a double even sublattice L0(V) of L(V), i.e. $$(1/\sqrt 2 )L_0 (\mathcal{V}) $$ is an even lattice. The closure of V, i.e. all vectors of L(V) of norm 2t+1, are minimal vectors of L(V) for t=1, and they are almost always minimal for t=2. For such t, the convex hull of vectors of the closure of V is an L-polytope of L0V and the contact polytope of L(V). As an example, we consider closed uniform odd systems of norm 5 spanning equiangular lines.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 14 (1983), S. 293-301 
    ISSN: 1572-9168
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider sets of (0, +1)-vectors in R n, having exactly s non-zero positions. In some cases we give best or nearly best possible bounds for the maximal number of such vectors if all the pairwise scalar products belong to a fixed set D of integers. The investigated cases include D={ -d, d}, which corresponds to equiangular lines.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 1 (1986), S. 379-390 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Extremal problems and the existence of designs is investigated in a new type of combinatorial structures, called squashed geometries.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Aequationes mathematicae 17 (1978), S. 322-330 
    ISSN: 1420-8903
    Keywords: Primary 05B30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An equidistant permutation array (E.P.A.)A(r, λ v) is av × r array in which every row is a permutation of the integers 1, 2, ⋯,r such that any two distinct rows have precisely λ columns in common. In this paper we introduce the concept of orthogonality for E.P.A.s. A special case of this is the well known idea of a set of pairwise orthogonal latin squares. We show that a set of these arrays is equivalent to a particular type of resolvable (r, λ)-design. It is also shown that the cardinality of such a set is bounded byr − λ with the upper bound being obtained only ifλ = 0. A brief survey of related orthogonal systems is included. In particular, sets of pairwise orthogonal symmetric latin squares, sets of orthogonal Steiner systems and sets of orthogonal skeins.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Combinatorica 8 (1988), S. 249-260 
    ISSN: 1439-6912
    Keywords: 20B99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The Hamming distance between two permutations of a finite setX is the number of elements ofX on which they differ. In the first part of this paper, we consider bounds for the cardinality of a subset (or subgroup) of a permutation groupP onX with prescribed distances between its elements. In the second part. We consider similar results for sets ofs-tuples of permutations; the role of Hamming distance is played by the number of elements ofX on which, for somei, the ith permutations of the two tuples differ.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Combinatorica 13 (1993), S. 397-411 
    ISSN: 1439-6912
    Keywords: 52 A 43 ; 52 A 25 ; 05 A 99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The hypermetric coneH n is the cone in the spaceR n(n−1)/2 of all vectorsd=(d ij)1≤i〈j≤n satisfying the hypermetric inequalities: −1≤i≤j≤n z j z j d ij ≤ 0 for all integer vectorsz inZ n with −1≤i≤n z i =1. We explore connections of the hypermetric cone with quadratic forms and the geometry of numbers (empty spheres andL-polytopes in lattices). As an application, we show that the hypermetric coneH n is polyhedral.
    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...