Now showing items 10-13 of 13

    • Some properties of i-connected sets 

      Knop, Jadwiga; Wróbel, Małgorzata (2007)
      The so-called i-connected sets are considered. The relationships between i-connected sets in natural topology on the plane and i-connected sets in the Hashimoto topology are studied.
    • Some remarks on the domination between conjunctions and disjunctions 

      Drygaś, Paweł; Król, Anna (2007)
      There are diverse domination properties considered in linear programming, game theory, semigroup theory and graph theory. In this paper we present a class of conjunctions which dominate each triangular conorm. Moreover, ...
    • Submaximal Riemann-Roch expected curves and symplectic packing 

      Syzdek, Wioletta (2007)
      We study Riemann–Roch expected curves on $P^1 × P^1$ in the context of the Nagata–Biran conjecture. This conjecture predicts that for a sufficiently large number of points multiple points Seshadri constants of an ample ...
    • Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem 

      Novikov, Sergey (2007)
      There are proved upper explicit estimates of complexity of algorithms: for multi-peg Tower of Hanoi problem with the limited number of disks, for Reve’s puzzle and for 5-peg Tower of Hanoi problem with the free number of disks.