127 A GENERALIZATION OF BAIRE CATEGORY IN A
... Theorem 4.1 is established for an ordered space in each of the versions [1, 3, 7]. In each case the proof is pretty much the same, and analogous to the proof of the Baire category version performed in R. What is essential in the linear case is that no point has character (τ, γ) where both τ and γ ar ...
... Theorem 4.1 is established for an ordered space in each of the versions [1, 3, 7]. In each case the proof is pretty much the same, and analogous to the proof of the Baire category version performed in R. What is essential in the linear case is that no point has character (τ, γ) where both τ and γ ar ...
Total weight choosability of graphs
... induced colouring φf is proper, i.e., for any edge xx0 of G, φf (x) 6= φf (x0 ). The real number assigned to an edge is called the weight of the edge. Instead of real numbers, one can use elements of some other field as weights. For simplicity, the weights are restricted to real numbers in this pap ...
... induced colouring φf is proper, i.e., for any edge xx0 of G, φf (x) 6= φf (x0 ). The real number assigned to an edge is called the weight of the edge. Instead of real numbers, one can use elements of some other field as weights. For simplicity, the weights are restricted to real numbers in this pap ...
Indecomposable permutations with a given number of cycles
... of the asymptotic limit of this function when n and m tend to infinity keeping m In a second part of the paper we restrict these permutations to be involutions with no fixed points and take as parameter the number of left-to-right maxima instead of the number of cycles, note that these two statistic ...
... of the asymptotic limit of this function when n and m tend to infinity keeping m In a second part of the paper we restrict these permutations to be involutions with no fixed points and take as parameter the number of left-to-right maxima instead of the number of cycles, note that these two statistic ...
