Related papers: A variant of Collatz's Conjecture over Binary Poly…

We introduce and discuss a variant of Schanuel conjecture in the framework of the Carlitz exponential function over Tate algebras and allied functions. Another purpose of the present paper is to widen the horizons of possible investigations…

We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…

In this article, we give two different proofs of why the Collatz Conjecture is false.

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

An observation on Hall-Littlewood polynomials.

In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.

We describe recent advances in the study of random analogues of combinatorial theorems.

The Collatz conjecture implies that an iterated function sequence under a certain linear operator, beginning with a certain complex valued function, must converge to a certain complex function.

In 1971, Ruzsa conjectured that if $f:\ \mathbb{N}\rightarrow\mathbb{Z}$ with $f(n+k)\equiv f(n)$ mod $k$ for every $n,k\in\mathbb{N}$ and $f(n)=O(\theta^n)$ with $\theta<e$ then $f$ is a polynomial. In this paper, we investigate the…

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

We estimate the proportion of function fields satisfying certain conditions which imply a function-field analogue of the Fontaine-Mazur conjecture. As a byproduct, we compute the fraction of abelian varieties (or even Jacobians) over a…

We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed…

Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the…

We prove a recent conjecture by Ulas on reducible polynomial substitutions.

We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…

We reduce the Nowicki conjecture on the Weitzenb\"ock derivation of polynomial algebras to well-known problem of the classical invariant theory.

We prove a series of Stephan's conjectures concerning Pascal triangle modulo 2 and give a polynomial generalization.

We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…

We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…

There have been a number of recent works on the theory of period polynomials and their zeros. In particular, zeros of period polynomials have been shown to satisfy a "Riemann Hypothesis" in both classical settings and for cohomological…