Related papers: An Alternative Computational Approach to the Colla…
The Multiplicity Conjecture is a deep problem relating the multiplicity (or degree) of a Cohen-Macaulay standard graded algebra with certain extremal graded Betti numbers in its minimal free resolution. In the case of level algebras of…
We present a new alternating convolution formula for the super Catalan numbers which arises as a generalization of two known binomial identities. We prove a generalization of this formula by using auxiliary sums, recurrence relations, and…
A concise analytical formula is developed for the inverse of an invertible 3 x 3 matrix using a telescoping method, and is generalized to larger square matrices. The formula is confirmed using randomly generated matrices in Matlab
This paper presents some considerations about the Goldbach's conjecture (GC). The work is based on elementary results of the number theory and it provides a constructive method that permits, given an even integer, to find at least a pair of…
We introduce a new method in the attempt to prove the Jacobian conjecture. In the complex dimension 2 case, we apply this method to prove some new results related the Jacobian conjecture.
By creating a new method, the author proved the well-known world's baffling problems Goldbach conjecture, twin primes conjecture, the Proposition (C) and the Proposition $n^2+1$.
A proposed solution to the Riemann Hypothesis
Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to…
The article provides a counterexample to a conjecture by Blocki-Zwonek.
We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture is easier to explore because certain…
The cyclic insertion conjecture of Borwein, Bradley, Broadhurst and Lison\v{e}k states that by inserting all cyclic permutations of some initial blocks of 2's into the multiple zeta value $ \zeta(1,3,\ldots,1,3) $ and summing, one obtains…
A multipermutation with $k$ copies each of $1\ldots n$ is Carlitz if neighbours are different. We enumerate these objects for $k=2,3,4$ and derive recurrences. In particular, we prove and improve a conjectured recurrence for $k=3$, stated…
The famous 3x + 1 problem of L. Collatz needs no introduction; however, this paper concerns a lesser-known, but similarly unresolved, precursor problem : the Original Collatz Conjecture, or OCC. We demonstrate that the core arithmetic…
We prove a computable version of Hall's Harem Theorem and apply it to computable versions of Tarski's alternative theorem.
This document collects several approaches attempted in proving the Chen-Raspaud Conjecture for k = 3. Each approach is detailed with full proofs and explanations of why it failed. This compilation aims to provide insights and a foundation…
By using properties of Markov homogeneous chains and Banach measure in $\mathrm{N}$, it is proved that a relative frequency of even numbers in the sequence of $n$-th coordinates of all Collatz sequences is equal to the number…
Following up on earlier work, I suggest why there are no mappings to infinity under the Collatz conjecture, nor under other mappings of the generalization $3n+p$, where $p$ is odd.
This paper shows that how to approximate general fuzzy number by using convolution method.
In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…
We give an endorsement for Cornacchia's famous algorithm. Thus we do not claim anything new but an approach which is supposed to be simpler than those of previous works written with the same aim.