Related papers: Generalized 3x + 1 Mappings : counting cycles
In this note, we construct three new infinite families of surfaces of general type with canonical map of degree 2 onto a surface of general type. For one of these families the canonical system has base points.
A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite.…
We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem…
We mainly answer two open questions about finite multiple harmonic $q$-series on 3-2-1 indices at roots of unity, posed recently by H. Bachmann, Y. Takeyama, and K. Tasaka. Two conjectures regarding cyclic sums which generalize the given…
The Collatz conjecture (also known as the $3x+1$ problem) concerns the behavior of the discrete dynamical system on the positive integers defined by iteration of the so-called $3x + 1$ function. We investigate analogous dynamical systems in…
We will consider two special families of polynomial perturbations of the linear center. For the resulting perturbed systems, which are generalized Li\'enard systems, we provide the exact upper bound for the number of limit cycles that…
In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…
Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.
We show that central extensions of the mapping class group $M_g$ of the closed orientable surface of genus $g$ by $\Z$ are residually finite. Further we give rough estimates of the largest $N=N_g$ such that homomorphisms from $M_g$ to SU(N)…
This paper proposes a new gradient method to solve the large-scale problems. Theoretical analysis shows that the new method has finite termination property for two dimensions and converges R-linearly for any dimensions. Experimental results…
We construct two new families of basis for finite field extensions. Basis in the first family, the so-called elliptic basis, are not quite normal basis, but they allow very fast Frobenius exponentiation while preserving sparse…
By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…
Some properties of central extensions of 2+1 dimensional Galilei group are discussed. It is shown that certain families of extensions are isomorphic. An interpretation of new nontrivial cocycle is offered. A few bibliographical remarks are…
We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of…
The $2$-to-$1$ mapping over finite fields has a wide range of applications, including combinatorial mathematics and coding theory. Thus, constructions of $2$-to-$1$ mappings have attracted considerable attention recently. Based on…
This paper provides a set of cycling problems in linear programming. These problems should be useful for researchers to develop and test new simplex algorithms. As matter of the fact, this set of problems is used to test a recently proposed…
We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of…
We prove that any closed map between metrizable spaces can be extended to a closed map between completely metrizable spaces with the same extensional dimension.
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
In this paper we study the structure of the graphs associated with the iterations of the map $x \mapsto x+x^{-1}$ over finite fields of characteristic three.