Related papers: Some Tribonacci Conjectures
We give a generalization and a short mechanized proof of determinant conjectured by G. Kuperberg and J. Propp. Further generalizations and applications of the method to some q-analogues may be found in http://www.math.temple.edu/~tewodros
In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…
We prove that every Condorcet-consistent voting rule can be manipulated by a voter who completely reverses their preference ranking, assuming that there are at least 4 alternatives. This corrects an error and improves a result of [Sanver,…
We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal behavior of $c(n)$, where $c(n)$ counts the number of length-$n$ factors of the Thue-Morse word $\mathbf{t}$, up to cyclic rotation.
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
The `Congruence Conjecture' was developed by the second author in a previous paper. It provides a conjectural explicit reciprocity law for a certain element associated to an abelian extension of a totally real number field whose existence…
Based on the results people have obtained, we try to prove the Jacobian conjecture, but there is a gap in the proof.
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
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…
We outline an approach to prove the two dimensional Jacobian Conjecture using the theory of fractals.
The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…
We show that Vojta's conjecture for some rational surfaces is related to the $abc$ conjecture. More specifically, we prove that Vojta's conjecture on these surfaces implies a special case of the $abc$ conjecture, while the $abc$ conjecture…
Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…
The aim of this note is a proof of a recent conjecture of Kellner concerning the number of distinct prime factors of a particular product of primes. The proof uses profound results from analytic number theory, such as Granville-Ramar\'{e}'s…
Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…
The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…
We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in…
This paper proposes a totally constructive approach for the proof of Hilbert's theorem on ternary quartic forms. The main contribution is the ladder technique, with which the Hilbert's theorem is proved vividly.
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
Walnut is a software package that implements a mechanical decision procedure for deciding certain combinatorial properties of some special words referred to as automatic words or automatic sequences. Walnut is written in Java and is open…