Library

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
    Semigroup forum 9 (1974), S. 95-101 
    ISSN: 1432-2137
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper contains constructions of finite transformation monoids such that the number of transformations from one point into another is a constant and whose groups of units are not transitive.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 4 (1989), S. 349-364 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The dimension of a graphG=(V, E) is the minimum numberd such that there exists a representation $$x \to \bar x \in R^d (x \in V)$$ and a thresholdt such thatxy εE iff $$\mathop x\limits^ - \mathop y\limits^ - \geqslant t$$ . We prove that d(G)≤n−x(G) and $$d(G) \leqslant n - \sqrt n $$ wheren=|V| andx(G) is the chromatic number ofG; we present upper bounds for the dimension of graphs with a large girth and we show that the complement of a forest can be represented by unit vectors inR 6. We prove that d(G)≥1/15n for most graphs and that there are 3-regular graphs with d(G)≥c logn/log logn.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 4 (1988), S. 43-47 
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is proved that for any treeT the vertices ofT can be placed on the surface of a sphere inR 3 in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances less than 1.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Manuscripta mathematica 53 (1985), S. 1-33 
    ISSN: 1432-1785
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The cartesian closed topological (CCT) hull of a concrete categoryK is the smallest full CCT extension ofK. A general method for describing the CCT hulls is presented and applied to render unified proofs for the basic examples ofK: topological spaces, uniform spaces, pretopological spaces, compact T2 spaces, metrizable spaces, and completely regular spaces.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Applied categorical structures 2 (1994), S. 77-90 
    ISSN: 1572-9095
    Keywords: 68Q65 ; 18D20 ; Data type equation ; complete metric space ; Banach's theorem ; categories enriched over metric spaces
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For a categoryK of data types, solutions of recursive data-type equationsX ℞T(X), whereT is an endofunctor ofK, can be constructed by iteratingT on the unique arrowT1 → 1. This is well-known forK enriched over complete posets and forT locally continuous (an application of the Kleene Fixed-Point Theorem). We prove this forK enriched over complete metric spaces and forT contracting (an application of the Banach Fixed-Point Theorem). Moreover, we prove that each such recursive equation has a unique solution. Our results generalize the approach of P. America and J. Rutten.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...