Browsing 2007, Studia Mathematica 6 by Title
Now showing items 6-13 of 13
-
Iterative roots of homeomorphisms possessing periodic points
(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. -
On sets associated to conditional equation of exponential function
(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. -
On type sequences and Arf rings
(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 ... -
Randomly $C_n ∪ C_m$ graphs
(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 ... -
Some properties of i-connected sets
(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
(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
(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
(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.