Related papers: On Traczyk's BCK-sequences

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

Let $n$ be a positive even integer, and let $a_1,...,a_n$ and $w_1, ..., w_n$ be integers satisfying $\sum_{k=1}^n a_k\equiv\sum_{k=1}^n w_k =0 (mod n)$. A conjecture of Bialostocki states that there is a permutation $\sigma$ on {1,...,n}…

We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular word, or necklace, is the equivalence class of a word under…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

In a Note in this Monthly, Klazar raised the question of whether the alternating sum of the Stirling numbers of the second kind $B^\pm(n)=\sum_{k=0}^n(-1)^kS(n,k)$ is ever zero for $n\neq 2$. In this article, we present an exposition of the…

We consider the following question: Which real sequences (a(n)) that satisfy a linear recurrence with constant coefficients are positive for sufficiently large n? We show that the answer is negative for both (a(n)) and (-a(n)), if the…

Let $\mathfrak S_{[i,j]}$ be the subgroup of the symmetric group $\mathfrak S_n$ generated by adjacent transpositions $(i,i+1), \dotsc, (j-1,j)$, assuming $1 \leq i < j \leq n$. We give a combinatorial rule for evaluating induced sign…

The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…

We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…

Let $\gamma_n$ be the permutation on $n$ symbols defined by $\gamma_n = (1\ 2\...\ n)$. We are interested in an enumerative problem on colored permutations, that is permutations $\beta$ of $n$ in which the numbers from 1 to $n$ are colored…

Given a set of $t$ words of length $n$ over a $k$-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-k-2)}$, for some $c>0$ depending on $k$ and $t$. This is…

During the past decade, there has been an extensive investigation of the computational complexity of the consistent answers of Boolean conjunctive queries under primary key constraints. Much of this investigation has focused on…

We prove under the Bombieri-Lang conjecture for surfaces that there is an absolute bound on the length of sequences of integer squares with constant second differences, for sequences which are not formed by the squares of integers in…

A nonnegative real function f is bell-shaped if it converges to zero at plus and minus infinity and the nth derivative of f changes sign n times for every n = 0, 1, 2, ... Similarly, a two-sided nonnegative sequence a(k) is bell-shaped if…

We prove a formula for the number of permutations in $S_n$ such that their first $n-k$ entries are increasing and their longest increasing subsequence has length $n-k$. This formula first appeared as a consequence of character polynomial…

Matthew de Brecht raised the question of whether countable frames are continuous lattices. We prove that the continuity of a countable frame implies the quasicontinuity of its corresponding spectrum in the dual specialization order. We…

In the year 1990, B\'ela Bollob\'as, Imre Leader and Andrew Radcliffe considered the following combinatorial problem: given three parameters k, n and q, find a set of k vertices in the binary n-cube which contains a maximal number of…

Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is…

We prove a logical implication between two old conjectures stated by Bapat and Sunder about the permanent of positive semidefinite matrices. Although Drury has recently disproved both conjectures, this logical implication yields a…