Related papers: Abelian-square factors and binary words
In this paper we introduce and study a family of complexity functions of infinite words indexed by $k \in \ints ^+ \cup {+\infty}.$ Let $k \in \ints ^+ \cup {+\infty}$ and $A$ be a finite non-empty set. Two finite words $u$ and $v$ in $A^*$…
We prove that a fundamental group of codimension one nonnegative Ricci curvature C2-foliation of a closed Riemannian manifold is finitely generated and almost abelian, i.e. it contains abelian subgroup of finite index. In particular, we…
In this short note, we prove a conjecture recently posed by Alekseyev, Amdeberhan, Shallit, and Vukusic on the 3-adic valuation of a cubic binomial sum.
In this paper, we present a further generalization of the bi- periodic Fibonacci quaternions and octonions. We give the generating function, the Binet formula, and some basic properties of these quaternions and octonions. The results of…
Francis Castro, et al [2] computed the exact divisibility of families of exponential sums associated to binomials $F(X) = aX^{d_1} + bX^{d_2}$ over $\mathbb{F}_p$, and a conjecture is presented for related work. Here we study this question.
We give a new proof of a_4\phi_3 summation due to G.E. Andrews and confirm another_4\phi_3 summation conjectured by him recently. Some variations of these two_4\phi_3 summations are also given.
In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…
We revisit a subexponential bound for the $abc$ conjecture due to the first author, and we establish a variation of it using linear forms in logarithms. As an application, we prove an unconditional subexponential bound towards the $4$-terms…
The binomial notation (w u) represents the number of occurrences of the word u as a (scattered) subword in w. We first introduce and study possible uses of a geometrical interpretation of (w ab) and (w ba) when a and b are distinct letters.…
We say that two finite words $u$ and $v$ are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian…
We combine two of Igusa's conjectures with recent semi-continuity results by Musta\c{t}\u{a} and Popa to form a new, natural conjecture about bounds for exponential sums. These bounds have a deceivingly simple and general formulation in…
We present and discuss a number of known results and open problems abelian squares in words on small alphabets.
In this article we study a generalization of Fibonomials, replacing the Fibonacci sequences by bivariate s-Fibonacci polynomial sequences. We call the obtained objects "Bivariate s-Fibopolynomials".
We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.
In this paper, we state a conjecture on the prime factorization of numbers of the form $n!+1$, explore its implications, and compare it with empirical evidence and established results based on the $abc$ conjecture.
In this paper, we study congruences on sums of products of binomial coefficients that can be proved by using properties of the Jacobi polynomials. We give special attention to polynomial congruences containing Catalan numbers, second-order…
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
We prove that, under the continuum hypothesis $\frak c=\aleph_1$, any ultraproduct II$_1$ factor $M= \prod_{\omega} M_n$ of separable finite factors $M_n$ contains more than $\frak c$ many mutually disjoint singular MASAs, in other words…
Given an abelian, CM extension K of any totally real number field k, we consider two conjectures `of Stark type'. The `Integrality Conjecture' concerns the image of a p-adic map `\mathfrak{s}_{K/k,S}' determined by the minus-part of the…
In 2011, Fici and Lipt\'ak introduced prefix normal words. A binary word is prefix normal if it has no factor (substring) that contains more occurrences of the letter 1 than the prefix of the same length. Among the open problems regarding…