ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (347)
  • stability  (222)
  • 06A10  (125)
  • Springer  (347)
  • Mathematics  (347)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    The journal of Fourier analysis and applications 5 (1999), S. 105-125 
    ISSN: 1531-5851
    Keywords: 26B05 ; 42B10 ; 42C99 ; frame ; Gabor system ; Riesz basis ; stability ; wavelet
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract If the sequence of functions ϕj, k is a wavelet frame (Riesz basis) or Gabor frame (Riesz basis), we obtain its perturbation system ψj,k which is still a frame (Riesz basis) under very mild conditions. For example, we do not need to know that the support of ϕ or ψ $$(\hat \phi or\hat \psi )$$ is compact as in [14]. We also discuss the stability of irregular sampling problems. In order to arrive at some of our results, we set up a general multivariate version of Littlewood-Paley type inequality which was originally considered by Lemarié and Meyer [17], then by Chui and Shi [9], and Long [16].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 20 (1998), S. 101-107 
    ISSN: 1436-6304
    Keywords: Competitive location model ; Nash equilibria ; stability ; reachability ; Wettbewerbsmodelle in der Standorttheorie ; Nash Gleichgewicht ; Stabilität ; Erreichbarkeit
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung In der Arbeit werden die Standorte von Duopolisten in einem Baum untersucht. Unter der Annahme festgesetzter Preise werden notwendige und hinreichende Bedingungen für Nash Gleichgewichte für Standorte auf Bäumen hergeleitet. Unter Verwendung dieser Bedingungen wird dann gezeigt, daß — angenommen Nash Gleichgewichte existieren — diese in einem wiederholt angewandten sequentiellen Standortfindungsprozeß, in dem beide Duopolisten als Zielfunktion kurzfristige Gewinnmaximierung haben, auch erreicht werden.
    Notes: Abstract This paper examines the location of duopolists on a tree. Given parametric prices, we first delineate necessary and sufficient conditions for locational Nash equilibria on trees. Given these conditions, we then show that Nash equilibria, provided they exist, can be reached in a repeated sequential relocation process in which both facilities follow short-term profit maximization objectives.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 20 (1998), S. 101-107 
    ISSN: 1436-6304
    Keywords: Key words: Competitive location model ; Nash equilibria ; stability ; reachability ; Schlüsselwörter: Wettbewerbsmodelle in der Standorttheorie ; Nash Gleichgewicht ; Stabilität ; Erreichbarkeit
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung. In der Arbeit werden die Standorte von Duopolisten in einem Baum untersucht. Unter der Annahme festgesetzter Preise werden notwendige und hinreichende Bedingungen für Nash Gleichgewichte für Standorte auf Bäumen hergeleitet. Unter Verwendung dieser Bedingungen wird dann gezeigt, daß– angenommen Nash Gleichgewichte existieren – diese in einem wiederholt angewandten sequentiellen Standortfindungsprozeß, in dem beide Duopolisten als Zielfunktion kurzfristige Gewinnmaximierung haben, auch erreicht werden. “Equilibrium is a place in heaven, but how do we get there from here?”
    Notes: Abstract. This paper examines the location of duopolists on a tree. Given parametric prices, we first delineate necessary and sufficient conditions for locational Nash equilibria on trees. Given these conditions, we then show that Nash equilibria, provided they exist, can be reached in a repeated sequential relocation process in which both facilities follow short-term profit maximization objectives.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 16 (1994), S. 47-52 
    ISSN: 1436-6304
    Keywords: Vector optimization ; approximately efficient solutions ; stability ; Vektoroptimierung ; Näherungslösungen ; Stabilität
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Wir führen ein Konzept für Näherungslösungen in der Vektoroptimierung ein und vergleichen dieses mit einem neuen Konzept aus [8]. Weiterhin untersuchen wir Beziehungen zwischen der Menge der Näherungslösungen eines Vektoroptimierungsproblems und den Näherungslösungen eines entsprechenden parametrischen Ersatzproblems. Schließlich beweisen wir Stabilitätseigenschaften des skalaren Ersatzproblems.
    Notes: Abstract We introduce a concept for approximately efficient solutions in vector optimization and compare it with another recent concept given in [8]. Further, we study relations between the set of approximately efficient solutions of a vector optimization problem and the approximate solutions of a corresponding parametric surrogate optimization problem. Finally, we prove stability properties for the scalar surrogate problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 18 (1996), S. 231-239 
    ISSN: 1436-6304
    Keywords: Generalized polymatrix games ; generalized linear complementarity problem ; stability ; degree theory ; Verallgemeinerte Polymatrix-Spiele ; verallgemeinertes lineares Komplementaritätsproblem ; Stabilität ; Grad-Theorie
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung In dieser Arbeit führen wir eine Verallgemeinerung des Polymatrix-Spiels (eines Nicht-Nullsummen- und nicht-kooperativenn-Personen-Spiels), das von Howson betrachtet wurde, ein und führen das Problem, eine Gleichgewichtsmenge von Strategien für ein solches Spiel zu berechnen, auf das verallgemeinerte lineare Komplementaritätsproblem von Cottle und Dantzig zurück. Für eine noch allgemeinere Version des Spiels beweisen wir die Existenz einerε-Gleichgewichtsmenge von Strategien. Wir präsentieren auch ein Ergebnis über die Stabilität der Gleichgewichte, das auf der Grad-Theorie beruht.
    Notes: Abstract In this paper, we introduce a generalization of the polymatrix game (a nonzero sum noncooperativen-person game) considered by Howson and relate the problem of computing an equilibrium set of strategies for such a game to the generalized linear complementarity problem of Cottle and Dantzig. For an even more general version of the game we prove the existence of anε-equilibrium set of strategies. We also present a result on the stability of the equilibria based on degree theory.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 47 (1990), S. 117-141 
    ISSN: 1436-4646
    Keywords: Bifurcation ; singularity ; parametric programming ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The structure of solutions to the nonlinear parametric programming problem with a one dimensional parameter is analyzed in terms of the bifurcation behavior of the curves of critical points and the persistence of minima along these curves. Changes in the structure of the solution occur at singularities of a nonlinear system of equations motivated by the Fritz John first-order necessary conditions. It has been shown that these singularities may be completely partitioned into seven distinct classes based upon the violation of one or more of the following: a complementarity condition, a constraint qualification, and the nonsingularity of the Hessian of the Lagrangian on a tangent space. To apply classical bifurcation techniques to these singularities, a further subdivision of each case is necessary. The structure of curves of critical points near singularities of lowest (zero) codimension within each case is analyzed, as well as the persistence of minima along curves emanating from these singularities. Bifurcation behavior is also investigated or discussed for many of the subcases giving rise to a codimension one singularity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 54 (1992), S. 57-67 
    ISSN: 1436-4646
    Keywords: Matchings ; stability ; extreme points ; polytope
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The purpose of this paper is to extend a modified version of a recent result of Vande Vate (1989) which characterizes stable matchings as the extreme points of a certain polytope. Our proofs are simpler and more transparent than those of Vande Vate.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 61 (1993), S. 197-214 
    ISSN: 1436-4646
    Keywords: Epi-convergence ; epi-distance ; stability ; convex optimization ; approximate solutions ; subgradients ; level sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We prove that theε-optimal solutions of convex optimization problems are Lipschitz continuous with respect to data perturbations when these are measured in terms of the epi-distance. A similar property is obtained for the distance between the level sets of extended real valued functions. We also show that these properties imply that theε-subgradient mapping is Lipschitz continuous.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 1 (1989), S. 269-298 
    ISSN: 1572-9222
    Keywords: Geometric mechanics ; reduction ; stability ; chaos ; rigid body dynamics ; periodic orbits ; 58F
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We give a complete bifurcation and stability analysis for the relative equilibria of the dynamics of three coupled planar rigid bodies. We also use the equivariant Weinstein-Moser theorem to show the existence of two periodic orbits distinguished by symmetry type near the stable equilibrium. Finally we prove that the dynamics is chaotic in the sense of Poincaré-Birkhoff-Smale horseshoes using the version of Melnikov's method suitable for systems with symmetry due to Holmes and Marsden.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 10 (1998), S. 151-188 
    ISSN: 1572-9222
    Keywords: Fourth-order solitary waves ; stability ; instability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study ground-state traveling wave solutions of a fourth-order wave equation. We find conditions on the speed of the waves which imply stability and instability of the solitary waves. The analysis depends on the variational characterization of the ground states rather than information about the linearized operator.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 6 (1994), S. 37-51 
    ISSN: 1572-9222
    Keywords: Celestial mechanics ; relative equilibria ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A criterion for the linear stability of relative equilibria of the Newtoniann-body problem is found in the case whenn−1 of the masses are small. Several stable periodic orbits of the problem are presented as examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1984), S. 21-28 
    ISSN: 1572-9273
    Keywords: 06A10 ; 05A05 ; Partially ordered sets ; Sperner's Theorem ; LYM property ; product of chains
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let P be the poset k 1 × ... × k n , which is a product of chains, where n≥1 and k 1≥ ... ≥k n ≥2. Let $$M = k_1 - \sum\nolimits_{i = 2}^n {(k_i - 1)} $$ . P is known to have the Sperner property, which means that its maximum ranks are maximum antichains. Here we prove that its maximum ranks are its only maximum antichains if and only if either n=1 or M≤1. This is a generalization of a classical result, Sperner's Theorem, which is the case k 1= ... =k n =2. We also determine the number and location of the maximum ranks of P.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Order 12 (1995), S. 213-220 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68C25 ; Parallel computation ; m-machine problem ; tree
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract LetP={v 1,...,v n } be a set ofn jobs to be executed on a set ofm identical machines. In many instances of scheduling problems, if a jobv i has to be executed before the jobv j and both jobs are to be executed on different machines, some sort of information exchange has to take place between the machines executing them. The time it takes for this exchange of information is called a communication delay. In this paper we give anO(n) algorithm to find an optimal scheduling with communication delays when the number of machines is not limited and the precedence constraints on the jobs form a tree.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Order 12 (1995), S. 327-349 
    ISSN: 1572-9273
    Keywords: 06A07 ; 06A10 ; Partially ordered set ; linear extension ; balancing pairs ; cross-product conjecture ; Ahlswede-Daykin inequality ; sorting
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In a finite partially ordered set, Prob (x〉y) denotes the proportion of linear extensions in which elementx appears above elementy. In 1969, S. S. Kislitsyn conjectured that in every finite poset which is not a chain, there exists a pair (x,y) for which 1/3⩽Prob(x〉y)⩽2/3. In 1984, J. Kahn and M. Saks showed that there exists a pair (x,y) with 3/11〈Prob(x〉y)〈8/11, but the full 1/3–2/3 conjecture remains open and has been listed among ORDER's featured unsolved problems for more than 10 years. In this paper, we show that there exists a pair (x,y) for which (5−√5)/10⩽Prob(x〉y)⩽(5+√5)/10. The proof depends on an application of the Ahlswede-Daykin inequality to prove a special case of a conjecture which we call the Cross Product Conjecture. Our proof also requires the full force of the Kahn-Saks approach — in particular, it requires the Alexandrov-Fenchel inequalities for mixed volumes. We extend our result on balancing pairs to a class of countably infinite partially ordered sets where the 1/3–2/3 conjecture isfalse, and our bound is best possible. Finally, we obtain improved bounds for the time required to sort using comparisons in the presence of partial information.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Order 13 (1996), S. 101-117 
    ISSN: 1572-9273
    Keywords: 06A10 ; (Partially) ordered set ; maximal chain ; maximal antichain ; cutset ; fibre
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract There is a product of two linear orders of size $$2^{\aleph _0 } $$ with the property that every subset or complement thereof contains a maximal chain. Furthermore, for regular ℵα, there is a product of two linear orders of size ℵα+2 that when colored with fewer than ℵα colors always has a monochromatic maximal chain. As a corollary, for every uncountable strong limit cardinal κ, there is an ordered set of cardinality κ that must be colored with at least κ colors before no monochromatic maximal chains are present. Duals of these results show that at least as much is true for maximal antichains.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 193-198 
    ISSN: 1572-9273
    Keywords: 06A10 ; 06D99 ; 52A25 ; Finite distributive lattices ; finite posets ; valuations ; convex polytopes ; extreme points
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let L be a finite distributive lattice and V(L) the real vector space of all valuations on L. We verify the conjecture of Geissinger that the extreme points of the convex polytope M(L)={v ∈ L : 0 ≤ v ≤ 1} are precisely the 0–1 valuations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 257-264 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68E05 ; Sorting ; merging ; linear extension
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For a finite poset P and x, yεP let pr(x〉y) be the fraction of linear extensions which put x above y. N. Linial has shown that for posets of width 2 there is always a pair x, y with 1/3 ⩽ pr(x〉y)⩽2/3. The disjoint union C 1∪C 2 of a 1-element chain with a 2-element chain shows that the bound 1/3 cannot be further increased. In this paper the extreme case is characterized: If P is a poset of width 2 then the bound 1/3 is exact iff P is an ordinal sum of C 1∪C 2's and C 1's.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Order 3 (1986), S. 283-286 
    ISSN: 1572-9273
    Keywords: 06A10 ; 06A12 ; 06B99 ; Partially ordered set ; semilattice ; lattice ; cofinality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A partial ordering on a set P can be weakened to an upper or lower semilattice ordering, respectively a lattice ordering, if and only if P is filtered in the appropriate direction(s).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Order 3 (1987), S. 355-357 
    ISSN: 1572-9273
    Keywords: 05App ; 06A10 ; Factor poset ; antichain ; depth
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Denote g(m, n) the minimum of min A, where A is a subset of {1, 2, ..., m} of size n and there do not exist two distinct x and y in A such that x divides y. We use a method of poset to prove that g(m, n)=2 i for positive integer i≤log3 m and 1+s(m, i−1)〈n≤1+s(m, i), where s(m, i) is the number of odd integers x such that m/3 i 〈x≤m.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Order 4 (1987), S. 127-142 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68-XX ; Poset ; closures ; Hasse diagram
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The combinatorial properties of the poset of closures are studied, especially the degrees in the Hasse diagram.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Order 3 (1986), S. 1-2 
    ISSN: 1572-9273
    Keywords: 06A10 ; Jump number
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The following result is proved in this note: For any positive integers w and t, if an ordered set P has jump number at least (t+1) w−1, then either the width of P is more than w, or P has a tower, i.e., a linear sum of pairs of noncomparable elements, of height more than t.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Order 4 (1987), S. 155-164 
    ISSN: 1572-9273
    Keywords: 05C55 ; 06A10 ; 62J ; Regressions ; Ramsey theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A regressive function (also called a regression or contractive mapping) on a partial order P is a function σ mapping P to itself such that σ(x)≤x. A monotone k-chain for σ is a k-chain on which σ is order-preserving; i.e., a chain x 1〈...〈xksuch that σ(x 1)≤...≤σ(xk). Let P nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x t(x,j−1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) 〈 f(K) 〈t(е + εk, k) , where εk → 0 as k→∞. Alternatively, the largest k such that every regression on P nis guaranteed to have a monotone k-chain lies between lg*(n) and lg*(n)−2, inclusive, where lg*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Order 4 (1987), S. 269-272 
    ISSN: 1572-9273
    Keywords: 06A10 ; 05A15 ; Interval order ; enumeration
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An algorithm is obtained for enumerating the interval orders of a given cardinality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Order 3 (1987), S. 345-353 
    ISSN: 1572-9273
    Keywords: 06A10 ; 06A23 ; Order-dimension ; Ferrers relation ; partition lattice ; linear lattice
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The aim of this paper is to study the order-dimension of partition lattices and linear lattices. Our investigations were motivated by a question due to Bill Sands: For a lattice L, does dim L=n always imply |L|≥2 n ? We will answer this question in the negative since both classes of lattices mentioned above form counterexamples. In the case of the partition lattices, we will determine the dimension up to an absolute constant. For the linear lattice over GF(2), L n , we determine the dimension up to a factor C/n for an absolute constant C.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Order 3 (1987), S. 369-382 
    ISSN: 1572-9273
    Keywords: 06A10 ; Partial order ; tree ; chain decomposition ; width
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We establish some inequalities connecting natural parameters of a partial order P. For example, if every interval [a,b] contains at most λ maximal chains, if some antichain has cardinality v, and if there are χ1 chains whose union is cofinal and coinitial in P, then the chain decomposition number for P is ⩽χ1λv (Theorem 2.2), and the inequality is sharp in a certain sense (Section 3).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Order 4 (1987), S. 37-42 
    ISSN: 1572-9273
    Keywords: 06A10 ; Partially ordered sets ; Van der Waerden's arithmetic sequence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Van der Waerden's arithmetic sequence theorem—in particular, the ‘density version’ of Szemerédi—is generalized to partially ordered sets in the following manner. Let w and t be fixed positive integers and ε〉0. Then for every sufficiently large partially ordered set P of width at most w, every subset S of P satisfying |S|≥ε|P| contains a chain a 1, a 2,..., a 1 such that the cardinality of the interval [a i, a i+1] in P is the same for each i.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1988), S. 163-171 
    ISSN: 1572-9273
    Keywords: 05C45 ; 05C70 ; 06A10 ; Boolean lattice ; Hamiltonian cycle ; matching
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract New classes of explicit matchings for the bipartite graph ℬ(k) consisting of the middle two levels of the Boolean lattice on 2k+1 elements are constructed and counted. This research is part of an ongoing effort to show that ℬ(k) is Hamiltonian.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1989), S. 59-68 
    ISSN: 1572-9273
    Keywords: 06A10 ; Poset ; minimal cutset ; chain complete ; special points ; regular posets ; Menger's theorem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract If P is a poset, the associated PT-order is the quasi order ⊴ in which a ⊴ b holds if every maximal chain of P which passes through a also passes through b. P is special if whenever A is a chain in P and a=sup A or inf A, then there is b ∈ A such that b ⊴ a. It is proved that if P is chain complete and special then the set of ⊴-maximal elements is ⊴-dominating and contains a minimal cutset. As corollaries of this, we give partial answers to (i) a question of Rival and Zaguia by showing that if P is regular and special every element is in a minimal cutset and (ii) a question of Brochet and Pouzet by showing that if P is chain complete and special then it has the Menger property.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 145-167 
    ISSN: 1572-9273
    Keywords: 06A10 ; 08A40 ; 08B10 ; 08C05 ; 08C15 ; Order-primal ; clone ; congruence-distributive ; duality ; category equivalence ; near-unanimity function
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A finite, nontrivial algebra is order-primal if its term functions are precisely the monotone functions for some order on the underlying set. We show that the prevariety generated by an order-primal algebra P is relatively congruence-distributive and that the variety generated by P is congruence-distributive if and only if it contains at most two non-ismorphic subdirectly irreducible algebras. We also prove that if the prevarieties generated by order-primal algebras P and Q are equivalent as categories, then the corresponding orders or their duals generate the same order variety. A large class of order-primal algebras is described each member of which generates a variety equivalent as a category to the variety determined by the six-element, bounded ordered set which is not a lattice. These results are proved by considering topological dualities with particular emphasis on the case where there is a monotone near-unanimity function.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 249-266 
    ISSN: 1572-9273
    Keywords: 05C99 ; 06A10 ; Covering graph ; partially ordered set
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We give a construction of lattices whose covering graphs can be oriented as a graded order with bottom v for any vertex v in the lattice.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 329-339 
    ISSN: 1572-9273
    Keywords: 06A10 ; 60C05 ; Partially ordered set ; random order ; dimension
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A relationship is established between (partially) ordered sets of dimension 2 chosen randomly on a labelled set, chosen randomly by isomorphism type, or generated by pairs of random linear orderings. As a consequence we are able to determine the limiting probability (in each of the above sample spaces) that a two-dimensional order is rigid, is uniquely realizable, or has uniquely orientable comparability graph; all these probabilities lie strictly between 0 and 1. Finally, we show that the number of 2-dimensional (partial) orderings of a labelled n-element set is $$(1 + o(1))n!^2 /(2\sqrt e ).$$ .
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 353-359 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68C15 ; Linear extension ; jump number
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An ordered set P is called K-free if it does not contain a four-element subset {a, b, c, d} such that a 〈 b is the only comparability among these elements. In this paper we present a polynomial algorithm to find the jump number of K-free ordered sets.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1990), S. 313-318 
    ISSN: 1572-9273
    Keywords: 06A10 ; Partial order ; linear extension ; majority cycle
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For points x and y in a poset (X, 〉) let x〉 p y mean that more linear extensions of the poset have x above y than y above x. It has been known for some time that 〉 p can have cycles when the height of the poset is two or more. Moreover, the smallest posets with a 〉 p cycle have nine points and heights of 2, 3 and 4. We show here that height-1 posets can also have 〉 p cycles. Our smallest example for this phenomenon has 15 points.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1990), S. 351-366 
    ISSN: 1572-9273
    Keywords: 05A17 ; 06A10 ; Young's lattice ; matching ; partially ordered set
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract If the level sets of a ranked partially ordered set are totally ordered, the greedy match between adjacent levels is defined by successively matching each vertex on one level to the first available unmatched vertex, if any, on the next level. Aigner showed that the greedy match produces symmetric chains in the Boolean algebra. We extend that result to partially ordered sets which are products of chains. It is widely thought that for Young's lattices corresponding to rectangles, the greedy match is complete. We show here that the greedy match is, in fact, complete for n×2, n×3 and n×4 rectangles but not for n×k rectangles if k≥5 and n is sufficiently large.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 5-9 
    ISSN: 1572-9273
    Keywords: 06A10 ; 05C25 ; 20B25 ; 20B27 ; Automorphism group ; comparability graph ; covering graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let G be a group and H a subgroup of G. It is shown that there exists a partially ordered set (X, ⩽) such that G is isomorphic to the group of all automorphisms of the comparability graph of (X, ⩽) and such that under this isomorphism H is mapped onto the group of all order-automorphisms of (X, ⩽). There also exists a partially ordered set (Y, ⩽) such that G is isomorphic to the group of all automorphisms of the covering graph of (Y, ⩽) and such that under this isomorphism H is mapped onto the group of all order-automorphisms of (Y, ⩽). In this representation X and Y can be taken to be finite if G is finite and of the same cardinality as G if G is infinite.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 267-273 
    ISSN: 1572-9273
    Keywords: 06A10 ; Linear extension ; realization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A k-realization of an ordered set P is a sequence of k linear orderings of the underlying set of P, whose intersection is (the order relation of) P. We determine the status of the number of k-realizations with respect to comparability invariance, and we show that among all orders on the set {1, 2, ..., n}, the antichain has the most k-realizations, for any k〉1. The latter intuitively reasonable result rests ultimately on an observation related to comparability invariance for numbers of linear extensions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 349-352 
    ISSN: 1572-9273
    Keywords: 68C15 ; 06A10 ; Posets ; preemptive ; scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Optimal preemptive schedules of jobs with unit completion times and given precedence constraints may require arbitrarily many short intervals of work on a single task.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Order 8 (1991), S. 63-75 
    ISSN: 1572-9273
    Keywords: 06A10 ; Infinite ordered set ; spanned ; maximal chain ; disjoint family ; cutset-number
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We say that an ordered set P is spanned by a family C of chains if P=(P, ⩽) is the transitive closure of ∪{(C, ≤ | C) C ∈ C. It is shown that there is a function h: ω→ω such that if P is spanned by k〈ω chains, then P has a finite cutset-number ⩽h(k) (i.e. for any x∈P, there is a finite set F of size |F|⩽h(k)−1, such that the elements of F are incomparable with x and {x}∪F meets every maximal chain of P). The function h is exponentially bounded but eventually dominates any polynomial function, even if it is only required that there are at most h(k) pairwise disjoint maximal chains in P, whenever P is spanned by k〈ω chains.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Order 9 (1992), S. 367-396 
    ISSN: 1572-9273
    Keywords: 06A05 ; 06A10 ; 06A99 ; Ordering ; axiomatization ; closure properties ; transitivity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A set of six axioms for sets of relations is introduced. All well-known sets of specific orderings, such as linear and weak orderings, satisfy these axioms. These axioms impose criteria of closedness with respect to several operations, such as concatenation, substitution and restriction. For operational reasons and in order to link our results with the literature, it is shown that specific generalizations of the transitivity condition give rise to sets of relations which satisfy these axioms. Next we study minimal extensions of a given set of relations which satisfy the axioms. By this study we come to the fundamentals of orderings: They appear to be special arrangements of several types of disorder. Finally we notice that in this framework many new sets of relations have to be regarded as a set of orderings and that it is not evident how to minimize the number of these new sets of orderings.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Order 9 (1992), S. 163-175 
    ISSN: 1572-9273
    Keywords: Primary 06A07 ; secondary 05C70 ; Partial order ; interval ; stability ; covering ; Sperner property ; symmetric chains ; NP-completeness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Given a finite ranked posetP, let α(P) be the maximum size of a subset ofP such that no two elements of it belong simultaneously to some interval ofP and let ϱ(P) be the minimum number of intervals covering all elements ofP. We say thatP has the strong interval stability property (resp. the strong interval covering property) if for each subposetP′ induced by consecutive levels ofP, i.e.,P′=P (l)∪...∪P (u), one has α(P′)=max{|P (l)|, |P (u)|} (resp. ϱ(P′)=max{|P (l)|, |P (u)|}). We prove these properties for several classes of posets and discuss some general facts concerning the numbers α(P) and ϱ(P), e.g., NP-completeness and min-max relations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Positivity 1 (1997), S. 319-330 
    ISSN: 1572-9281
    Keywords: delay equations ; stability ; positive solutions ; spectral growth condition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We prove stability for a semilinear delay equation, whose nonlinearity is majorized by a linear positive operator. The key ingredients are a spectral condition, positivity of solutions to the linear problem, and lattice properties of the Banach space.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    ISSN: 1572-9281
    Keywords: asymptotic stability ; dichotomic maps ; retarded functional differential equation ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper deals with the study of the stability of nonautonomous retarded functional differential equations using the theory of dichotomic maps. After some preliminaries, we prove the theorems on simple and asymptotic stability. Some examples are given to illustrate the application of the method. Main results about asymptotic stability of the equation $$x'(t) = - b(t)x(t - r)$$ and of itsnonlinear generalization $$x'(t) = b(t)f(x(t - r))$$ are established.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Journal of computational analysis and applications 2 (2000), S. 293-308 
    ISSN: 1572-9206
    Keywords: parabolic equations ; ADI scheme ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An ADI scheme for solving three-dimensional parabolic equations withfirst-order derivatives and variable coefficients has been developed basedon our previous papers and the idea of the modified upwind differencescheme. This ADI scheme is second-order accurate and unconditionallystable. Further, a small parameter can be chosen which makes it suitablefor simulating fast-transient phenomena or for computations on fine spatialmeshes. The method is illustrated with numerical examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 5 (1993), S. 625-671 
    ISSN: 1572-9222
    Keywords: Scalar reaction-diffusion equation ; singular perturbation methods ; internal layer ; Neumann layer ; stability ; 35K57 ; 35B25 ; 35B35
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The multiple existences and their stability properties of stationary solutions with a single transition layer in some scalar reaction-diffusion equation are shown. Each solution is constructed by using classical singular perturbation methods and its stability property is determined by a simple algebraic quantity, say index, appearing in the construction of a solution.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 6 (1994), S. 639-658 
    ISSN: 1572-9222
    Keywords: Symmetry ; parabolic equations ; positive solutions ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Symmetry properties of positive solutions of a Dirichlet problem for a strongly nonlinear parabolic partial differential equation in a symmetric domainD ⊂ R n are considered. It is assumed that the domainD and the equation are invariant with respect to a group {Q} of transformations ofD. In examples {Q} consists of reflections or rotations. The main result of the paper is the theorem which states that any compact inC(D) negatively invariant set which consists of positive functions consists ofQ-symmetric functions. Examples of negatively invariant sets are (in autonomous case) equilibrium points, omega-limit sets, alpha-limit sets, unstable sets of invariant sets, and global attractors. Application of the main theorem to equilibrium points gives the Gidas-Ni-Nirenberg theorem. Applying the theorem to omega-limit sets, we obtain the asymptotical symmetrization property. That means that a bounded solutionu(t) asr→∞ approaches subspace of symmetric functions. One more result concerns properties of eigenfunctions of linearizations of the equations at positive equilibrium points. It is proved that all unstable eigenfunctions are symmetric.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1985), S. 235-247 
    ISSN: 1572-9273
    Keywords: 06A10 ; Chain ; antichain ; cutset
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A subset A of an ordered set P is a cutset if each maximal chain of P meets A; if, in addition, A is an antichain call it an antichain cutset. Our principal result is a characterization, by means of a ‘forbidden configuration’, of those finite ordered sets, which can be expressed as the union of antichain cutsets.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1985), S. 317-331 
    ISSN: 1572-9273
    Keywords: 06A10 ; 60C05 ; Partially ordered set ; probabilistic methods ; dimension
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Letk andn be positive integers and fix a setS of cardinalityn; letP k (n) be the (partial) order onS given by the intersection ofk randomly and independently chosen linear orders onS. We begin study of the basic parameters ofP k (n) (e.g., height, width, number of extremal elements) for fixedk and largen. Our object is to illustrate some techniques for dealing with these ‘random orders’ and to lay the groundwork for future research, hoping that they will be found to have useful properties not obtainable by known constructions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1985), S. 371-375 
    ISSN: 1572-9273
    Keywords: 06A10 ; Poset ; chain ; antichain ; cutset
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is shown that ifP is a poset containing noN, then every minimal cutset inP is an antichain, that the converse also holds whenP is finite, and that this converse fails in general.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1984), S. 35-46 
    ISSN: 1572-9273
    Keywords: 06A10 ; Ordered set ; chain ; antichains ; width ; cutset
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An ordered set (P,≤) has the m cutset property if for each x there is a set Fx with cardinality less than m, such that each element of Fx is incomparable to x and {x} ∪ Fx meets every maximal chain of (P,≤). Let n be least, such that each element x of any P having the m cutset property belongs to some maximal antichain of cardinality less than n. We specify n for m 〈 w. Indeed, n-1=m= width P for m=1,2,n=5 if m=3 and n⩾ℵ1 if m ≥4. With the added hypothesis that every bounded chain has a supremum and infimum in P, it is shown that for 4⩽m⩽ℵ0, n=ℵ0. That is, if each element x has a finite cutset Fx, each element belongs to a finite maximal antichain.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1984), S. 7-19 
    ISSN: 1572-9273
    Keywords: 06A10 ; 05C20 ; 68C25 ; Partial order ; linear extension ; jump number ; line digraph ; cyclomatic number ; spanning branching ; Eulerian digraph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The purpose of this paper is to present a graph-theoretic approach to the jump number problem for N-free posets which is based on the observation that the Hasse diagram of an N-free poset is a line digraph. Therefore, to every N-free poset P we can assign another digraph which is the root digraph of the Hasse diagram of P. Using this representation we show that the jump number of an N-free poset is equal to the cyclomatic number of its root digraph and can be found (without producing any linear extension) by an algorithm which tests if a given poset is N-free. Moreover, we demonstrate that there exists a correspondence between optimal linear extensions of an N-free poset and spanning branchings of its root digraph. We provide also another proof of the fact that optimal linear extensions of N-free posets are exactly greedy linear extensions. In conclusion, we discuss some possible generalizations of these results to arbitrary posets.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1984), S. 83-92 
    ISSN: 1572-9273
    Keywords: 06A10 ; Ordered sets ; exponentiation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Recently there has been significant progress in the study of powers of ordered sets. Much of this work has concerned cancellation laws for powers and uses these two steps. First, logarithmic operators are introduced to transform cancellation problems for powers into questions involving direct product decompositions. Second, refinement theorems for direct product decompositions are brought to bear. Here we present two results with the aim of highlighting these steps.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Order 11 (1994), S. 197-210 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68C25 ; On-line algorithm ; lattice of maximal antichains
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider the on-line computation of the lattice of maximal antichains of a finite poset $$\tilde P$$ . This on-line computation satisfies what we call the “linear extension hypothesis”: the new incoming vertex is always maximal in the current subposet of $$\tilde P$$ . In addition to its theoretical interest, this abstraction of the lattice of antichains of a poset has structural properties which give it interesting practical behavior. In particular, the lattice of maximal antichains may be useful for testing distributed computations, for which purpose the lattice of antichains is already widely used. Our on-line algorithm has a run time complexity of $$\mathcal{O}((\left| P \right| + \omega ^2 (P))\omega (P)\left| {MA(P)} \right|),$$ , where |P| is the number of elements of the poset, $$\tilde P$$ , |MA(P)| is the number of maximal antichains of $$\tilde P$$ and ω(P) is the width of $$\tilde P$$ . This is more efficient than the best off-line algorithms known so far.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Order 11 (1994), S. 309-316 
    ISSN: 1572-9273
    Keywords: 90B35 ; 06A10 ; Scheduling ; communication delays ; parallel processors ; precedence constraints
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We show that a greedy algorithm for scheduling unit time jobs on two machines with unit communication delays produces an optimal schedule when the precedence constraints are given by a rooted forest. We also give a min/max relationship for the length of such a schedule. The min/max result (for forests and two machines) shows that the addition of unit communication delays increases the optimal schedule length by at most one.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 25-40 
    ISSN: 1572-9273
    Keywords: 06A10 ; 05C20 ; 05C38 ; Order ; diagram ; graph ; orientation ; cycle
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study some equivalent and necessary conditions for a finite graph to be the covering graph of a (partially) ordered set. For each κ≥1, M. Aigner and G. Prins have introduced a notion of a vertex colouring, here called κ-good colouring, such that a 1-good colouring is the usual concept and graphs that have a 2-good colouring are precisely covering graphs. We present some inequalities for the corresponding chromatic numbers χκ, especially for x 2. There exist graphs that satisfy these inequalities for κ=2 but are not covering graphs. We show also that x 2 cannot be bounded by a function of x=x 1. A construction of Nešetřil and Rödl is used to show that x 2 is not bounded by a function of the girth.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 387-402 
    ISSN: 1572-9273
    Keywords: 06A10 ; Poset ; linear extension ; correlation ; universal correlation ; Graham, Yao, and Yao inequality ; xyz inequality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Posets $$A,{\text{ }}B \subseteq X{\text{ x }}X$$ are said to be correlated with respect to another poset R on X (we write A↑ R B) if P(R∪A) P(R∪B)≤P(R∪A∪B) P(R). Here P(S) is the probability that a randomly chosen bijection from X to the totally ordered set with |X| elements is a linear extension of S. We study triples (A, B, R) such that A ↑ R B holds for all extensions S of R (we write A $$\begin{array}{*{20}c} \uparrow \\ \uparrow \\ \end{array}$$ R B). Two well-known correlation inequalities, the xyz inequality and an inequality of Graham, Yao, and Yao, can be considered as giving cases when this relation holds. We show when the Graham, Yao, and Yao inequality holds strictly. Our main result is a classification of all R such that (a, b) $$\begin{array}{*{20}c} \uparrow \\ \uparrow \\ \end{array}$$ R (c, d) holds, where a, b, c, d are elements of X.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Order 3 (1986), S. 15-20 
    ISSN: 1572-9273
    Keywords: 06A10 ; Partially ordered set
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let P be a partially ordered set. Define k = k (P) = max p∈ |{x ∈ P : p 〈 x or p = x}|, i.e., every element is comparable with at most k others. Here it is proven that there exists a constant c (c 〈 50) such that dim P 〈 ck(log k)2. This improves an earlier result of Rödl and Trotter (dim P ≤2 k 2+2). Our proof is nonconstructive, depending in part on Lovász' local lemma.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 269-274 
    ISSN: 1572-9273
    Keywords: 06A10 ; Partial order ; fixed point ; comparability graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We show that the fixed point property is comparability invariant for finite ordered sets; that is, if P and Q are finite ordered sets with isomorphic comparability graphs, then P has the fixed point property if and only if Q does. In the process we give a characterization of comparability invariants which can also be used to give shorter proofs of some known results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1988), S. 21-22 
    ISSN: 1572-9273
    Keywords: 06A10 ; Dimension ; width ; chain-covering number
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A partially ordered set with no infinite antichains may have arbitrarily large dimension.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Order 3 (1986), S. 21-38 
    ISSN: 1572-9273
    Keywords: 06A10 ; Ladder ; cutset ; 2-cutset property ; chain ; antichain
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An ordered set P is said to have the 2-cutset property if for every element x of P there is a subset S of P whose elements are noncomparable to x, such that |S|≤2 and such that every maximal chain in P meets {x}∪S. It is shown that if P has the 2-cutset property and has width n then P contains a ladder of length [1/2(n−3)].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Order 4 (1988), S. 315-318 
    ISSN: 1572-9273
    Keywords: 06A10 ; Circle containment order ; poset
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A partially ordered set is called acircle containment order provided one can assign to each element of the poset a circle in the plane so thatx≤y iff the circle assigned tox is contained in the circle assigned toy. It has been conjectured that every finite three-dimensional partially ordered set is a circle containment order. We show that the infinite three dimensional posetZ 3 isnot a circle containment order.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1988), S. 173-186 
    ISSN: 1572-9273
    Keywords: 06A10 ; Ordered set ; retract ; variety ; obstruction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We use the technique of ‘χ-Embeddings’ to study retracts and varieties of ordered sets. We investigate the class of all ordered sets $$Q$$ which are retract of every ordered set in which $$Q$$ is ‘χ-Embedded’.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1989), S. 369-380 
    ISSN: 1572-9273
    Keywords: 06A10 ; Poset ; linear extension ; semiorder ; 1/3–2/3 conjecture ; partially ordered set
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A well-known conjecture of Fredman is that, for every finite partially ordered set (X, 〈) which is not a chain, there is a pair of elements x, y such that P(x〈y), the proportion of linear extensions of (X, 〈) with x below y, lies between 1/3 and 2/3. In this paper, we prove the conjecture in the special case when (X, 〈) is a semiorder. A property we call 2-separation appears to be crucial, and we classify all locally finite 2-separated posets of bounded width.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1989), S. 31-37 
    ISSN: 1572-9273
    Keywords: 05A05 ; 06A10 ; Cutset ; Boolean lattice
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An informative new proof is given for the theorem of Nowakowski that determines for all n and k the minimum size of a cutset for an element A with |A|=k of the Boolean algebra B n of all subsets of {1,...,n}, ordered by inclusion. An inequality is obtained for cutsets for A that is reminiscent of Lubell's inequality for antichains in B n. A new result that is provided by this approach is a list of all minimum cutsets for A.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1989), S. 349-361 
    ISSN: 1572-9273
    Keywords: 05C10 ; 06A10 ; Convex Hasse representations ; Kuratowski type results for Hasse diagrams
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A plane Hasse representation of an acyclic oriented graph is a drawing of the graph in the Euclidean plane such that all arcs are straight-line segments directed upwards and such that no two arcs cross. We characterize completely those oriented graphs which have a plane Hasse representation such that all faces are bounded by convex polygons. From this we derive the Hasse representation analogue, due to Kelly and Rival of Fary's theorem on straight-line representations of planar graphs and the Kuratowski type theorem of Platt for acyclic oriented graphs with only one source and one sink. Finally, we describe completely those acyclic oriented graphs which have a vertex dominating all other vertices and which have no plane Hasse representation, a problem posed by Trotter.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1989), S. 265-275 
    ISSN: 1572-9273
    Keywords: 05C75 ; O5C99 ; 06A10 ; Upper bound graph ; multigraph ; poset ; chordal graph ; interval graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The study of upper bound graphs of posets can be extended naturally to multigraphs. This paper characterizes such upper bound multigraphs, shows they determine the associated posets up to isomorphism, and extends results of D. Scott to characterize posets having chordal or interval upper bound multigraphs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1984), S. 113-126 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68E05 ; Sorting ; comparison ; information theoretic bound ; linear extension
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We show that any finite partially ordered setP (not a total order) contains a pair of elementsx andy such that the proportion of linear extensions ofP in whichx lies belowy is between 3/11 and 8/11. A consequence is that the information theoretic lower bound for sorting under partial information is tight up to a multiplicative constant. Precisely: ifX is a totally ordered set about which we are given some partial information, and ife(X) is the number of total orderings ofX compatible with this information, then it is possible to sortX using no more thanC log2 e (X) comparisons whereC is approximately 2.17.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1984), S. 159-172 
    ISSN: 1572-9273
    Keywords: 06A05 ; 06A10 ; Ordered sets ; ideals ; better quasi-order
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study the possible order types of chains of ideals in an ordered set. Our main result is this. Given an indecomposable countable order type α, there is a finite listA 1 α , ...,A n α of ordered sets such that for every ordered setP the setJ(P) of ideals ofP, ordered by inclusion, contains a chain of type α if and only ifP contains a subset isomorphic to one of theA 1 #x03B1; , ...,A n α . The finiteness of the list relies on the notion of better quasi-ordering introduced by Nash-Williams and the properties of scattered chains obtained by Laver.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1988), S. 235-237 
    ISSN: 1572-9273
    Keywords: 06A10 ; Circle containment order ; poset
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A partially ordered set P is called a circle containment order provided one can assign to each x∈P a circle C x so that $$x \leqslant y \Leftrightarrow C_x \subseteq C_y $$ . We show that the infinite three-dimensional poset N 3 is not a circle containment order and note that it is still unknown whether or not [n]3 is such an order for arbitrarily large n.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 101-102 
    ISSN: 1572-9273
    Keywords: 06A10 ; Dimension of a poset ; direct product ; strict product
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is shown that the dimension of a poset is the smallest cardinal number λ such that there is an embedding of the poset into a strict product of λ linear orders.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 133-143 
    ISSN: 1572-9273
    Keywords: 06A10 ; Order ; diagram ; slope ; degree ; cover ; bend ; crooked
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A natural and practical criterion in the preparation of diagrams of ordered sets is to minimize the number of different slopes used for the edges. For any diagram this is at least the maximum number of upper covers and of lower covers of any element. While this maximum degree is not always enough we show that it is as long as any edge joining a covering pair may be bent, to produce a crooked diagram.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1989), S. 1-14 
    ISSN: 1572-9273
    Keywords: 06A10 ; Fixed point ; irreducible element ; dismantlability ; cutset ; retraction ; crown
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract There exist exactly eleven (up to isomorphism and duality) ordered sets of size ≤10 with the fixed point property and containing no irreducible elements.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1989), S. 39-47 
    ISSN: 1572-9273
    Keywords: 06A10 ; Inclusion orders ; circle orders ; angle orders
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A poset is a circle order if its points can be mapped into circular disks in the plane so that x〈y in the poset precisely when x's circular disk is properly included in y's; the poset is an angle order if its points can be mapped into unbounded angular regions that preserve 〈 by proper inclusion. It is well known that many finite angle orders are not circle orders, but has been open as to whether every finite circle order is an angle order. This paper proves that there are finite circle orders that are not angle orders.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1989), S. 91-99 
    ISSN: 1572-9273
    Keywords: 08A40 ; 06A10 ; Clones ; crowns ; tences ; generators
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we study the clones of all order preserving operations for crowns and fences. By presenting explicit generating sets, we show that these clones are finitely generated. The case of crowns is particularly interesting because they admit no order preserving near unanimity operations. Various related questions are also discussed. For example, we give a new proof of a theorem of Duffus and Rival which states that crowns are irreducible.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1989), S. 235-240 
    ISSN: 1572-9273
    Keywords: 06A10 ; 52A37 ; Order ; sphere ; partially ordered set ; space-time
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Ann-sphere order is a finite partially ordered set representable by containment ofn-spheres in Euclidean (n+1)-space. We present a sequence {P i } of ordered sets such that eachP i is ann-sphere order only forn≥i; one consequence is that we are able to determine the dimension of a Euclidean space-time manifold from the finite suborders of its causality order.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Set-valued analysis 5 (1997), S. 73-88 
    ISSN: 1572-932X
    Keywords: differential inclusion ; invariance ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The properties of invariance, stability, asymptotic stability and attainability of a given compact set $$K \subset \mathbb{R}^n $$ with respect to a differential inclusion, have weak and strong versions: the weak version requires existence of a trajectory with the corresponding property, while the strong one requires this property for all trajectories. The following statement is proven in the paper (under slight restrictions) for each of the above-mentioned properties: if K has the weak property with respect to $$\dot x \in F(x) $$ , then there is a (regulation) mapping G such that G(x) ⊂ F(x) ∀ x and G has the strong property with respect to $${\dot x}$$ ε G(x). In addition, certain regularity of the set of solutions of the last inclusion is claimed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Set-valued analysis 5 (1997), S. 365-375 
    ISSN: 1572-932X
    Keywords: set-valued mappings ; vector optimization ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We establish optimization results for set-valued mappings, with the image space given by a topological vector space partially ordered by a cone. Moreover, we obtain stability results relative to parametrized optimization problems. We use a weak semicontinuity concept related to the order structure of the image space and show how compactness assumptions used in previous papers can be lightened.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 27 (1990), S. 343-369 
    ISSN: 1572-9338
    Keywords: Bifurcation ; singularities ; continuation ; parametric nonlinear programming ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Bifurcation and continuation techniques are introduced as a class of methods for investigating the parametric nonlinear programming problem. Motivated by the Fritz John first-order necessary conditions, the parametric programming problem is first reformulated as a closed system of nonlinear equations which contains all Karush-Kuhn-Tucker and Fritz John points, both feasible and infeasible solutions, and relative minima, maxima, and saddle points. Since changes in the structure of the solution set and critical point type can occur only at singularities, necessary and sufficient conditions for the existence of a singularity are developed in terms of the loss of a complementarity condition, the linear dependence constraint qualification, and the singularity of the Hessian of the Lagrangian on a tangent space. After a brief introduction to elementary bifurcation theory, some simple singularities in this parametric problem are analyzed for both branching and persistence of local minima. Finally, a brief introduction to numerical continuation and bifurcation procedures is given to indicate how these facts can be used in a numerical investigation of the problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 56 (1995), S. 79-93 
    ISSN: 1572-9338
    Keywords: Multistage stochastic programs ; optimization in Banach spaces ; stability ; approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Multistage stochastic programs are regarded as mathematical programs in a Banach spaceX of summable functions. Relying on a result for parametric programs in Banach spaces, the paper presents conditions under which linearly constrained convex multistage problems behave stably when the (input) data process is subjected to (small) perturbations. In particular, we show the persistence of optimal solutions, the local Lipschitz continuity of the optimal value and the upper semicontinuity of optimal sets with respect to the weak topology inX. The linear case with deterministic first-stage decisions is studied in more detail.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Computational & mathematical organization theory 5 (1999), S. 5-30 
    ISSN: 1572-9346
    Keywords: network models ; organization theory ; rule following ; self organized ; stability ; work teams ; work routine
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Self-organized rule-following systems are increasingly relevant objects of study in organization theory due to such systems&2018; capacity to maintain control while enabling decentralization of authority. This paper proposes a network model for such systems and examines the stability of the networks&2018; repetitive behavior. The networks examined are Ashby nets, a fundamental class of binary systems: connected aggregates of nodes that individually compute an interaction rule, a binary function of their three inputs. The nodes, which we interpret as workers in a work team, have two network inputs and one self-input. All workers in a given team follow the same interaction rule. We operationalize the notion of stability of the team&2018;s work routine and determine stability under small perturbations for all possible rules these teams can follow. To study the organizational concomitants of stability, we characterize the rules by their memory, fluency, homogeneity, and autonomy. We relate these measures to work routine stability, and find that stability in ten member teams is enhanced by rules that have low memory, high homogeneity, and low autonomy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 12 (2000), S. 117-167 
    ISSN: 1572-9222
    Keywords: singular perturbation ; standing pulses ; stability ; Hopf bifurcation ; reaction-diffusion system
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Bifurcation phenomena from standing pulse solutions of the problem $$\varepsilon \tau u_t = \varepsilon ^2 u_{xx} + f(u,v),{\text{ }}v_t = v_{xx} + g(u,v)$$ is considered. ε(〉0) is a sufficiently small parameter and τ is a positive one. It is shown that there exist two types of destabilization of standing pulse solutions when τ decreases. One is the appearance of travelling pulse solutions via the static bifurcation and the other is that of in-phase breathers via the Hopf bifurcation. Furthermore which type of destabilization occurs first with decreasing τ is discussed for the piecewise linear nonlinearities f and g.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 5 (1993), S. 189-218 
    ISSN: 1572-9222
    Keywords: Equivariant bifurcation ; symmetry ; singularity ; equivariant jets and transversality ; normal forms ; universal unfolding ; stability ; structural stability ; 58F14 ; 58E07 ; 58C27
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The theoretical machinery from singularity theory introduced by Golubitsky, Stewart, and Schaeffer, to study equivariant bifurcation problems, is completed and expanded while generalized to the multiple parameter context. In this setting the finite determinacy theorems or normal forms, the stability of equivariant bifurcation problems, and the structural stability of the universal unfolding are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 6 (1994), S. 447-486 
    ISSN: 1572-9222
    Keywords: Free boundary problems ; gasless combustion ; stability ; Hopf bifurcation ; 35R35 ; 35B40 ; 80A25
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we analyze a simple free boundary model associated with solid combustion and some phase transition processes. There is strong evidence that this “one-phase” model captures all major features of dynamical behavior of more realistic (and complicated) combustion and phase transition models. The principal results concern the dynamical behavior of the model as a bifurcation parameter (which is related to the activation energy in the case of combustion) varies. We prove that the basic uniform front propagation is asymptotically stable against perturbations for the bifurcation parameter above the instability threshold and that a Hopf bifurcation takes place at the threshold value. Results of numerical simulations are presented which confirm that both supercritical and subcritical Hofp bifurcation may occur for physically reasonable nonlinear kinetic functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 9 (1997), S. 463-505 
    ISSN: 1572-9222
    Keywords: Difference equations ; random perturbation ; averaging ; diffusion approximation ; randomly perturbed iterations ; stability ; 3SR60 ; 60H15 ; 60J99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let (X, ℬ) and (Y,C) be two measurable spaces withX being a linear space. A system is determined by two functionsf(X): X→ X andϕ:X×Y→X, a (small) positive parameterε and a homogeneous Markov chain {y n } in (Y,C) which describes random perturbations. States of the system, say {x n ɛ ∈X, n=0, 1,⋯}, are determined by the iteration relations:x n+1 ɛ =f(x n ɛ )+ɛϕ(x n ɛ ,Yn+1) forn≥0, wherex 0 ɛ =x 0 is given. Here we study the asymptotic behavior of the solutionx n ɛ asε → 0 andn → ∞ under various assumptions on the data. General results are applied to some problems in epidemics, genetics and demographics.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 165-171 
    ISSN: 1572-9273
    Keywords: 06A10 ; 60C05 ; Partially ordered set ; diameter ; random structures
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let P k (n) be the (partial) order determined by intersecting k random linear orderings of a set of size n; equivalently, let P k (n) consist of n points chosen randomly and independently from the unit cube in ℝ k , with the induced product order. We show for each fixed k〉1, that with probability approaching 1 as n→∞, the comparability graph of P k (n) is connected and has diameter 3.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 129-144 
    ISSN: 1572-9273
    Keywords: 06A10 ; Poset ; linear extension ; correlation ; universal correlation ; Winkler's Theorem ; universal negative correlation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Posets A, B⫇X×X, with X finite, are said to be universally correlated (A↑B) if, for all posets R over X, (i.e., all posets R⫇Y×Y with X⫇Y), we have P(R∪A) P(R∪B)≤P(R∪A∪B) P(R). Here P(R∪A), for instance, is the probability that a randomly chosen bijection from Y to the totally ordered set with |Y| elements is a linear extension of R∪A. We show that A↑B iff, for all posets R over X, P(R∪A) P(R∪B)≤P(R∪A∪B) P(R∪(A∩B)). Winkler proved a theorem giving a necessary and sufficient condition for A↑B. We suggest an alteration to his proof, and give another condition equivalent to A↑B. Daykin defined the pair (A, B) to be universally negatively correlated (A B) if, for all posets R over X, P(R∪A) P(R∪B)≥P(R∪A∪B) P(R∪(A∩B)). He suggested a condition for A↓B. We give a counterexample to that conjecture, and establish the correct condition. We write A↓B if, for all posets R over X, P(R∪A) P(R∪B)≥P(R∪A∪B) P(R). We give a necessary and sufficient condition for A↓B. We also give constructive techniques for listing all pairs (A, B) satisfying each of the relations A↑B, A↓B, and A↓B.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 321-322 
    ISSN: 1572-9273
    Keywords: 06A10 ; 05C99 ; Covering graph ; order orientation ; extremal problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Every graph G may be transformed into a covering graph either by deletion of edges or by subdivision. Let Π E (G) and Π V (G) denote corresponding minimal numbers. We prove Π E (G) = Π V (G) for every graph G.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 1-8 
    ISSN: 1572-9273
    Keywords: 06A10 ; Poset ; N-free poset ; linear extension ; Jump number ; matroid ; greedy algorithm ; Rado-Edmonds theorem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let L=x 1 x 2...x n be a linear extension of a poset P. Each pair (x i , x i+1) such that x i ≮ x i+1in P is called a jump of L. It is well known that for N-free posets a natural ‘greedy’ procedure constructing linear extensions yields a linear extension with a minimum number of jumps. We show that there is a matroid corresponding to any N-free poset and apply the Rado-Edmonds Theorem to obtain another proof of this result.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 61-67 
    ISSN: 1572-9273
    Keywords: 06A10 ; Ordered set ; multifunction ; fixed point ; chain-completeness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Sufficient conditions for the fixed point property for products of two partially ordered sets are proved. These conditions are formulated in terms of multifunctions (functions with non-empty sets as values).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 119-122 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68C25 ; Chordal bipartite graph ; elimination scheme ; crown
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We prove that a bipartite graph is chordal if and only if it has an elimination scheme. This leads to a polynomial algorithm to recognize whether an ordered set is cycle-free.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 145-164 
    ISSN: 1572-9273
    Keywords: 06A05 ; 06A10 ; Ordered sets ; linear extension ; greedy dimensions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Every linear extension L: [x 1〈x 2〈...〈x m ] of an ordered set P on m points arises from the simple algorithm: For each i with 0≤i〈m, choose x i+1 as a minimal element of P−{x j :j≤i}. A linear extension is said to be greedy, if we also require that x i+1 covers x i in P whenever possible. The greedy dimension of an ordered set is defined as the minimum number of greedy linear extensions of P whose intersection is P. In this paper, we develop several inequalities bounding the greedy dimension of P as a function of other parameters of P. We show that the greedy dimension of P does not exceed the width of P. If A is an antichain in P and |P−A|≥2, we show that the greedy dimension of P does not exceed |P−A|. As a consequence, the greedy dimension of P does not exceed |P|/2 when |P|≥4. If the width of P−A is n and n≥2, we show that the greedy dimension of P does not exceed n 2+n. If A is the set of minimal elements of P, then this inequality can be strengthened to 2n−1. If A is the set of maximal elements, then the inequality can be further strengthened to n+1. Examples are presented to show that each of these inequalities is best possible.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 243-248 
    ISSN: 1572-9273
    Keywords: 06A10 ; Ordered set ; chain ; antichain ; width ; cutset
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The partially ordered set P is an (α, β, γ) ordered set if the width of P≥α, the length of any chain of P≤β and the cut-set number ≤γ. We will prove that if P is an (α, β, γ) ordered set then P contains a ‘simple’ (α, β, γ) ordered set and use this result to prove that if P has the 3 cutset property, then width of P ≤ length of P+3.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Order 3 (1986), S. 245-255 
    ISSN: 1572-9273
    Keywords: 06A10 ; 60C05 ; Poset ; diagram ; covering graph ; random graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For a graph G, we define c(G) to be the minimal number of edges we must delete in order to make G into a covering graph of some poset. We prove that, if p=n -1+η(n) ,where η(n) is bounded away from 0, then there is a constant k 0〉0 such that, for a.e. G p , c(G p )≥k 0 n 1+η(n) .In other words, to make G p into a covering graph, we must almost surely delete a positive constant proportion of the edges. On the other hand, if p=n -1+η(n) , where η(n)→0, thenc(G p )=o(n 1+η(n) ), almost surely.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1988), S. 245-255 
    ISSN: 1572-9273
    Keywords: 05C55 ; 05C70 ; 06A10 ; Decomposition ; Ramsey theory ; graph ; finite set system ; partially ordered set ; monotone sequence ; Δ-system ; chain ; antichain ; sub-k coloring
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Every partially ordered set P on at least (1+o(1))n 3 elements can be decomposed into subposets of size n that are ‘almost’ chains or antichains. This lower bound on P is asymptotically best possible. Similar results are presented for other types of combinatorial structures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1988), S. 305-315 
    ISSN: 1572-9273
    Keywords: 06A10 ; Ordered set ; maximal chain ; cutset ; Menger's theorem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is shown that, if an ordered set P contains at most k pairwise disjoint maximal chains, where k is finite, then every finite family of maximal chains in P has a cutset of size at most k. As a corollary of this, we obtain the following Menger-type result that, if in addition, P contains k pairwise disjoint complete maximal chains, then the whole family, M (P), of maximal chains in P has a cutset of size k. We also give a direct proof of this result. We give an example of an ordered set P in which every maximal chain is complete, P does not contain infinitely many pairwise disjoint maximal chains (but arbitrarily large finite families of pairwise disjoint maximal chains), and yet M (P) does not have a cutset of size 〈x, where x is any given (infinite) cardinal. This shows that the finiteness of k in the above corollary is essential and disproves a conjecture of Zaguia.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1990), S. 389-400 
    ISSN: 1572-9273
    Keywords: 08B10 ; 06A10 ; 08A40 ; Monotone clone ; congruence-modularity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We investigate the relationship between the local shape of an ordered set P=(P; ≤) and the congruence-modularity of the variety V generated by an algebra A=(P; F) each of whose operations is order-preserving with respect to P. For example, if V is k-permutable (k≥2) then P is an antichain; if P is both up and down directed and V is congruence-modular, then V is congruence-distributive; if A is a dual discriminator algebra, then either P is an antichain or a two-element chain. We also give a useful necessary condition on P for V to be congruence-modular. Finally a class of ordered sets called braids is introduced and it is shown that if P is a braid of length 1, in particular if P is a crown, then the variety V is not congruence-modular.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1989), S. 345-348 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68C15 ; Preemptive scheduling ; interval order
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem, for preemptive scheduling (a job can be interrupted to work on more important tasks, and completed at a later time, subject to the usual scheduling constraints.) The m-machine preemptive scheduling problem is shown to have a polynomial algorithm, for both unit time and variable execution times as well, when the precedence constraints are given by an interval order.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Order 7 (1990), S. 275-282 
    ISSN: 1572-9273
    Keywords: 06A10 ; 20K15 ; 20K30 ; Partially ordered set ; torsion-free abelian group
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Certain p-local orders in n-dimensional division algebras over the rational numbers occur as endomorphism rings of torsion-free abelian groups of rank n if and only if an associated finite poset P has a strict faithful representation of dimension less than |P| over the field with p elements. In this note we obtain a simple characterization of those finite posets which do not admit such a representation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Order 6 (1989), S. 245-263 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68E05 ; Bipartite graph ; Bruhat order ; elementary operations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Consider two partially ordered setsP, Q and a number of edges connecting some of the points ofP with some of the points ofQ. This yields a bipartite graph. Some pairs of the edges may cross each other because their endpoints atP andQ are oppositely ordered. A natural decrossing operation is to exchange the endpoints of these edges incident atQ, say. This is called a switch. A left lift of an edge means to replace its starting point atP by a larger starting point. A right lift is defined symmetrically for the endpoints atQ. The operation of adding an edge cannot, informally, be explained better. Assume we are given two bipartite graphs π, σ on the node setPσQ. We show that for certain pairs (P, Q) of finite posets, a neat necessary and sufficient criterion can be given in order that σ is obtainable from π by the sequence of elementary operations just defined. A recent characterization of the Bruhat order of the symmetric group follows as a special case.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Order 12 (1995), S. 189-210 
    ISSN: 1572-9273
    Keywords: 06A10 ; Boolean ordered set ; distributive ordered set ; ideal ; prime ideal ; maximal ideal ; representation by sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Boolean ordered sets generalize Boolean lattices, and distributive ordered sets generalize distributive lattices. Ideals, prime ideals, and maximal ideals in ordered sets are defined, and some well-known theorems on Boolean lattices, such as the Glivenko-Stone theorem and the Stone representation theorem, are generalized to Boolean ordered sets. A prime ideal theorem for distributive ordered sets is formulated, and the Birkhoff representation theorem is generalized to distributive ordered sets. Fundamental are the embedding theorems for Boolean ordered sets and for distributive ordered sets.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 9-23 
    ISSN: 1572-9273
    Keywords: 06A10 ; 68C25 ; Jump number ; substitution decomposition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Consider the linear extensions of a partial order. A jump occurs in a linear extension if two consecutive elements are unrelated in the partial order. The jump number problem is to find a linear extension of the ordered set which contains the smallest possible number of jumps. We discuss a decomposition approach for this problem from an algorithmic point of view. Based on this some new classes of partial orders are identified, for which the problem is polynomially solvable.
    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...