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
Filter
  • Articles  (94)
  • Springer  (68)
  • Oxford University Press  (26)
  • Mathematics  (94)
Collection
  • Articles  (94)
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Transformation groups 5 (2000), S. 21-34 
    ISSN: 1531-586X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is well-known that the ring of invariants associated to a non-modular representation of a finite group is Cohen-Macaulay and hence has depth equal to the dimension of the representation. For modular representations the ring of invariants usually fails to be Cohen-Macaulay and computing the depth is often very difficult. In this paper1 we obtain a simple formula for the depth of the ring of invariants for a family of modular representations. This family includes all modular representations of cyclic groups. In particular, we obtain an elementary proof of the celebrated theorem of Ellingsrud and Skjelbred [6].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 49 (1990), S. 175-181 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract Let ℭ be the class of frames satisfying the condition $$\forall x\exists y(Ry \wedge yRy)$$ (“every world can see a reflexive world”). LetKMT be the system obtained by adding to the minimal normal modal systemK the axiom $$M((Lp_1 \supset p_1 ) \wedge ... \wedge (Lp_n \supset p_n ))$$ for eachn ⩾ 1. The main results proved are: (1)KMT is characterized by ℭ. (2)KMT has the finite model property. (3) There are frames forKMT which are not in ℭ, but allfinite frames forKMT are in ℭ. (4)KMT is decidable. (5)KMT is not finitely axiomatizable. (6) The class of all frames forKMT is not definable by any formula of first-order logic. (7) 〈W, R〉 is a frame forKMT iff for everyx εW, the worlds thatx can see form a sub-frame which is not finitely colourable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of theoretical probability 8 (1995), S. 703-715 
    ISSN: 1572-9230
    Keywords: Random quadratic form ; Sturm-Liouville problem ; continuity of eigenvalues ; spline approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An approximation theory for families of quadratic forms is given. We show that if continuity conditions for a family of quadratic forms hold uniformly on an index set for the family, generalized signature approximation results hold. We then apply these results to randomized spline type Sturm-Liouville problems and obtain continuity of thenth eigenvalue for generalized Sturm-Liouville problems under weak hypotheses.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Lifetime data analysis 5 (1999), S. 173-183 
    ISSN: 1572-9249
    Keywords: degradation ; least squares ; maximum likelihood estimation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In testing product reliability, there is often a critical cutoff level that determines whether a specimen is classified as “failed.” One consequence is that the number of degradation data collected varies from specimen to specimen. The information of random sample size should be included in the model, and our study shows that it can be influential in estimating model parameters. Two-stage least squares (LS) and maximum modified likelihood (MML) estimation, which both assume fixed sample sizes, are commonly used for estimating parameters in the repeated measurements models typically applied to degradation data. However, the LS estimate is not consistent in the case of random sample sizes. This article derives the likelihood for the random sample size model and suggests using maximum likelihood (ML) for parameter estimation. Our simulation studies show that ML estimates have smaller biases and variances compared to the LS and MML estimates. All estimation methods can be greatly improved if the number of specimens increases from 5 to 10. A data set from a semiconductor application is used to illustrate our methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of theoretical probability 8 (1995), S. 963-971 
    ISSN: 1572-9230
    Keywords: Random quadratic form ; focal point ; conjugate point ; spline approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper continues our earlier work on random quadratic forms. We show that if continuity conditions for a family of quadratic forms holds uniformly on an index set, generalized focal/conjugate point signature approximation results hold. We then apply these results to obtain continuity of thenth focal point in a random (robust) setting.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 35 (1990), S. 193-228 
    ISSN: 1572-9168
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Extended generalized quadrangles (roughly, connected structures whose every residue is a generalized quadrangle) are studied in some detail, especially those which are uniform or strongly uniform. Much basic structure theory is developed, many examples are given, and something approaching characterization is given for many types.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 42 (1992), S. 129-138 
    ISSN: 1572-9168
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract There are two known lower bounds for μ(P, Q) in an EpG, called β1 and β2, see for example [3]. In [4], μ=β1 was studied for the case of triangular EGQs and, in [3], μ=β2 was considered for EpGs in general. Here we extend this to the case μ=β1 for EpGs in general, including non-triangular EGQs, and we give a number of characterizations. For instance a triangular EpG with μ=β1 locally is an EGQ, an extended dual net or a semibiplane; if t〉2α−1, then an EpGα(s, t) with μ=β1 locally is an EGQ. In general we have only partial results for t≤2α−1.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 42 (1992), S. 119-128 
    ISSN: 1572-9168
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Recently Fisher and Hobart extended the original work of Buekenhout and Hubaut on extended generalized quadrangles with a certain minimal value (‘minimal μ’) for the nonempty residue intersections. We show that there is another minimal μ which is sometimes better than the earlier one, and we extend all this to the case of extended partial geometries. We examine especially the triangular case, and find only a few new possibilities, which we are unable to settle, although some of these look extremely interesting.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 5 (1976), S. 129-133 
    ISSN: 1572-9168
    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 ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Aequationes mathematicae 37 (1989), S. 219-232 
    ISSN: 1420-8903
    Keywords: Primary 94A17 ; Secondary 94A15, 39B40
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Using a recent result by B. Ebanks on the functional equation $$h(x,y) + h(x + y,z) = h(x,y + z) + h(y,z)$$ we derive a representation theorem for a large class of entropy functionals that exhibit the “branching property”. LetV(Ω, F,m) be the set of probability densities on a non-atomic measure space {Ω,F,m} and $$\bar V$$ (Ω,F,m) be the set of all simple probability densities. A functional Ф: (Ω,F,m) →R ∪ { − ∞, ∞} will be said to have thebranching property, if, given any setA ∈ F and any two functionsf, g ∈ V such that at least one of Ф(f) or Ф(g) is finite andf(ω) = g(ω) whenever ω ∈ Ω/A, then $$\Phi (f) - \Phi (g) = \Psi (f_A ,g_A ),$$ wheref A is the restriction off to the setA and Ψ:L 1(A, F,m) ×L 1(A, F,m) →R ∪ {− ∞, ∞}. Theorem 1.Given Ф: V(Ω,F,m) →R ∪ {−∞, ∞}, $$\bar V$$ (Ω,F,m) →R,If (i) Фhas the branching property (ii) Фis invariant under all metric endomorphisms (iii) (continuity) for any sequence of simple functions {si}, with si ↑ f we have (with ∥ · ∥ the L1 norm) $$\Phi \left( {\frac{{s_i }}{{\parallel s_i \parallel }}} \right) \to \Phi (f)$$ then there exists h:[0, ∞) →R continuous on (0, ∞)with h(0) = 0such that Ф(f) = ∫ Ω h(f) d m. Фis said to be “recursive” if, for any set A ∈ F and any two functions, f, g ∈ V such that f(ω) = g(ω) at each ω ∈ Ω/A and p:=∫ A f d m =∫ A g d m 〉0, $$\Phi (f) - \Phi (g) = p\left[ {\Phi \left( {\frac{{f\chi _A }}{p}} \right) - \Phi \left( {\frac{{g\chi _A }}{p}} \right)} \right],$$ where ϰ A is the characteristic function of the set A. By strengthening (i) in Theorem 1 to “Ф is recursive” we obtain a new characterization of the Boltzmann—Shannon entropy.
    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...