English
Related papers

Related papers: On Cycles of Generalized Collatz Sequences

200 papers

The Hultman numbers enumerate permutations whose cycle graph has a given number of alternating cycles (they are relevant to the Bafna-Pevzner approach to genome comparison and genome rearrangements). We give two new interpretations of the…

Probability · Mathematics 2011-11-15 Nikita Alexeev , Peter Zograf

Let X be an Abelian surface and C a holomorphic curve in X representing a primitive homology class. The space of genus g curves in the class of C is g dimensional. We count the number of such curves that pass through g generic points and we…

Algebraic Geometry · Mathematics 2007-05-23 Jim Bryan , Naichung Conan Leung

In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…

Combinatorics · Mathematics 2012-12-06 Mourad Rahmani

We generalize Sczech's Eisenstein cocycle for $\mathrm{GL}(n)$ over totally real extensions of $\mathbb{Q}$ to finite extensions of imaginary quadratic fields. By evaluating the cocycle on certain cycles, we parametrize complex values of…

Number Theory · Mathematics 2020-01-23 Jorge Flórez , Cihan Karabulut , Tian An Wong

We consider GL_n(F_q)-analogues of certain factorization problems in the symmetric group S_n: rather than counting factorizations of the long cycle (1, 2, ..., n) given the number of cycles of each factor, we count factorizations of a…

Combinatorics · Mathematics 2016-06-16 Joel Brewster Lewis , Alejandro H. Morales

In this paper, we report the nature of transition to generalized synchronization (GS) in a system of two coupled scalar piecewise linear time-delay systems using the auxiliary system approach. We demonstrate that the transition to GS occurs…

Chaotic Dynamics · Physics 2009-11-13 D. V. Senthilkumar , M. Lakshmanan

We use a construction which we call generalized cylinders to give a new proof of the fundamental theorem of hypersurface theory. It has the advantage of being very simple and the result directly extends to semi-Riemannian manifolds and to…

Differential Geometry · Mathematics 2019-01-08 Christian Baer , Paul Gauduchon , Andrei Moroianu

Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the "not later than" relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally…

Logic in Computer Science · Computer Science 2011-09-01 Ryszard Janicki , Dai Tri Man Le

Many of the 2-adic properties of the 3x+1 map generalize to the analogous mx+r map, where m and r are odd integers. We introduce the corresponding autoconjugacy map, prove some simple properties of it and make some further conjectures in…

Number Theory · Mathematics 2012-06-05 Alec Edgington

A de Bruijn sequence of order $k$ over a finite alphabet is a cyclic sequence with the property that it contains every possible $k$-sequence as a substring exactly once. Orthogonal de Bruijn sequences are collections of de Bruijn sequences…

Information Theory · Computer Science 2025-02-25 Yuan-Pon Chen , Jin Sima , Olgica Milenkovic

The purpose of this study is to show how to get a necessary criterion for prime numbers with the help of special matrices. My special interest lies in the empirical research of these matrices and their patterns, structures and symmetries.…

General Mathematics · Mathematics 2016-08-09 Jonas Kaiser

This article deals with a quantum-mechanical system which generalizes the ordinary isotropic harmonic oscillator system. We give the coefficients connecting the polar and Cartesian bases for D=2 and the coefficients connecting the Cartesian…

Quantum Physics · Physics 2011-04-15 Y. M. Hakobyan , M. Kibler , G. S. Pogosyan , A. N. Sissakian

Some aspects of differential and integral calculi on generalized grassmann (paragrassmann) algebras are considered. The integration over paragrassmann variables is applied to evaluate the partition function for the $Z_{p+1}$ Potts model on…

q-alg · Mathematics 2009-10-30 A. P. Isaev

In 1996, in his last paper, Erd\H{o}s asked the following question that he formulated together with Faudree: is there a positive $c$ such that any $(n+1)$-regular graph $G$ on $2n$ vertices contains at least $c 2^{2n}$ distinct…

Combinatorics · Mathematics 2025-04-01 Nemanja Draganić , Peter Keevash , Alp Müyesser

In this current study, the most apparent aspect is to submit a new geometric sequence space. We investigate its topological properties , inclusion relations, Geometric statistical convergence and Geometric property of Orlicz function and .…

Functional Analysis · Mathematics 2022-11-02 Saubhagyalaxmi Singh

A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…

Combinatorics · Mathematics 2023-01-02 Keiichi Shigechi

The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of paths and cycles, respectively. In the first part of the work we provide a formula for the number of edges of the Hasse diagram of the…

Discrete Mathematics · Computer Science 2015-09-14 Pietro Codara , Ottavio M. D'Antona

We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…

Number Theory · Mathematics 2015-03-19 Jerico B. Bacani , Julius Fergy T. Rabago

A universal cycle is a cyclic sequence in which each object of a combinatorial family appears exactly once as a contiguous window. While such cycles are well understood for many discrete structures and linear subspaces, the case of affine…

Combinatorics · Mathematics 2026-05-20 Ming-Hsuan Kang , Shin-Hsun Chou

In this study, we propose a flexible construction of complementary sequences (CSs) that can contain zero-valued elements. To derive the construction, we use Boolean functions to represent a polynomial generated with a recursion. By applying…

Information Theory · Computer Science 2021-08-05 Alphan Sahin , Rui Yang