Recent Submissions

  • Boundary value problem and functional equations for overlapping disks 

    Mityushev, Vladimir (2007)
    We compare applications of the method of functional equations to boundary value problem for circular multiply connected domains and to circular polygons generated by overlapping disks. The second part of the paper is devoted ...
  • Randomly $C_n ∪ C_m$ graphs 

    Híc, Pavel; Pokorný, Milan (2007)
    A graph G is said to be a randomly H graph if and only if any subgraph of G without isolated vertices, which is isomorphic to a subgraph of H, can be extended to a subgraph F of G such that F is isomorphic to H. In this ...
  • 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 ...
  • Fractional calculus and diffusive stress 

    Povstenko, Jurij (2007)
    The main ideas of fractional calculus are recalled. A quasi-static uncoupled theory of diffusive stresses based on the anomalous diffusion equation with fractional derivatives is formulated.
  • Iterative roots of homeomorphisms possessing periodic points 

    Solarz, Paweł (2007)
    In this paper we give necessary and sufficient conditions for the existence of orientation-preserving iterative roots of a homeomorphism with a nonempty set of periodic points. We also give a construction method for these roots.
  • 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, ...
  • 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.
  • 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.
  • On type sequences and Arf rings 

    Patil, D.P.; Tamone, G. (2007)
    In this article in Section 2 we give an explicit description to compute the type sequence $t_1, . . ., t_n$ of a semigroup $Γ$ generated by an arithmetic sequence (see 2.7); we show that the $i$-th term $t_i$ is equal to ...
  • On sets associated to conditional equation of exponential function 

    Bahyrycz, Anna (2007)
    In the present paper we give a description and properties of the system of cones over Q which are one of parameters determining the solutions of the conditional equation of exponential function.
  • Complementary means and double sequences 

    Toader, Gheorghe (2007)
    We look after the complementary means with respect to a weighted geometric mean of Stolarsky means in the family of Gini means and in the family of Stolarsky means.
  • Annales Academiae Paedagogicae Cracoviensis. 45. Studia Mathematica 6 

    Szemberg, Tomasz; Chmieliński, Jacek; Wilk, Władysław (Wydawnictwo Naukowe Akademii Pedagogicznej, Kraków, 2007)
    Annales Academiae Paedagogicae Cracoviensis Studia Mathematica (AAPC SM) has undergone radical changes during the last few months. These changes go in two directions. The first, the most visible one is that we go online. ...