If a non-periodic sequence $X$ is the image by a morphism of a fixed point of both a primitive substitution $σ$ and a primitive substitution $τ$, then the dominant eigenvalues of the matrices of $σ$ and of $τ$ are multiplicatively dependent. This is the way we propose to generalize Cobham's Theorem.
We introduce the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence, and we prove a variant of Cobham's theorem for the newly introduced class of sequences.
We make certain bounds in Krebs' proof of Cobham's theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic $a$-automatic sequence and an aperiodic $b$-automatic sequence, where $a$ and $b$ are multiplicatively independent. We also show that an automatic sequence cannot have arbitrarily large factors in common with a Sturmian sequence.
We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear as common factors of two automatic sequences defined over multiplicatively independent bases. This generalises the famous theorem of Cobham.
Cobham's theorem asserts that if a sequence is automatic with respect to two multiplicatively independent bases, then it is ultimately periodic. We prove a stronger density version of the result: if two sequences which are automatic with respect to two multiplicatively independent bases coincide on a set of density one, then they also coincide on a set of density one with a periodic sequence. We apply the result to a problem of Deshouillers and Ruzsa concerning the least nonzero digit of $n!$ in base $12$.
Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^ω(a))$ is the image of a fixed point of a morphism $f$ under another morphism $g$, then there exist a non-erasing morphism $σ$ and a coding $τ$ such that $w =τ(σ^ω(b))$. Based on the Perron theorem about asymptotic properties of powers of non-negative matrices, our main contribution is an in-depth study of the growth type of iterated morphisms when one replaces erasing m…
In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably understand the underlying structure behind the theorem.
We study a generalization of the classical Pentagonal Number Theorem and its applications. We derive new identities for certain infinite series, recurrence relations and convolution sums for certain restricted partitions and divisor sums. We also derive new identities for Bell polynomials.
In this paper, we describe and prove a generalization of both the classical Greene-Kleitman duality theorem for posets and the local version proved recently by Lewis-Lyu-Pylyavskyy-Sen in studying discrete solitons, using an approach more closely linked to the approach of the classical case.
In this paper, we provide a common generalization to the well-known Erdős-Ko-Rado Theorem, Frankl-Wilson Theorem, Alon-Babai-Suzuki Theorem, and Snevily Theorem on set systems with $\mathcal{L}$-intersections. As a consequence, we derive a result which strengthens substantially the well-known theorem on set systems with $k$-wise $\mathcal{L}$-intersections by F$\ddot{u}$redi and Sudakov [J. Combin. Theory, Ser. A (2004) 105: 143-159]. We will also derive similar results on $\mathcal{L}$-intersecting families of subspaces of an $n$-dimensional vector space over a finite field $\mathbb{F}_{q}$, …
In 2000, Kadell gave an orthogonality conjecture for a symmetric function generalization of the Zeilberger--Bressoud $q$-Dyson theorem or the $q$-Dyson constant term identity. This conjecture was proved by Károlyi, Lascoux and Warnaar in 2015. In this paper, by slightly changing the variables of Kadell's conjecture, we obtain another symmetric function generalization of the $q$-Dyson constant term identity. This new generalized constant term admits a simple product-form expression.
We generalize the Yao-Yao partition theorem by showing that for any smooth measure in $R^d$ there exist equipartitions using $(t+1)2^{d-1}$ convex regions such that every hyperplane misses the interior of at least $t$ regions. In addition, we present tight bounds on the smallest number of hyperplanes whose union contains the boundary of an equipartition of a measure into $n$ regions. We also present a simple proof of a Borsuk-Ulam type theorem for Stiefel manifolds that allows us to generalize the central transversal theorem and prove results bridging the Yao--Yao partition theorem and the cen…
In a recent paper, Dousse introduced a refinement of Siladić's theorem on partitions, where parts occur in two primary and three secondary colors. Her proof used the method of weighted words and $q$-difference equations. The purpose of this paper is to give a bijective proof of a generalization of Dousse's theorem from two primary colors to an arbitrary number of primary colors.
We prove a generalization of Frieman's $3k-3$ theorem for the sumset $$ Σ^{l}(A_1,\ldots,A_k)=\{a_{j_{1}}+\cdots+a_{j_{l}}:\,1\leq j_{1}<\cdots<j_{l}\leq k,\ a_{j_{s}}\in A_{j_{s}}\text{ for all }s\}. $$