173,418 research outputs found

    Avoiding 3/2-powers over the natural numbers

    Full text link
    In this paper we answer the following question: what is the lexicographically least sequence over the natural numbers that avoids 3/2-powers?Comment: 9 page

    Ramsey Theory Problems over the Integers: Avoiding Generalized Progressions

    Full text link
    Two well studied Ramsey-theoretic problems consider subsets of the natural numbers which either contain no three elements in arithmetic progression, or in geometric progression. We study generalizations of this problem, by varying the kinds of progressions to be avoided and the metrics used to evaluate the density of the resulting subsets. One can view a 3-term arithmetic progression as a sequence x,fn(x),fn(fn(x))x, f_n(x), f_n(f_n(x)), where fn(x)=x+nf_n(x) = x + n, nn a nonzero integer. Thus avoiding three-term arithmetic progressions is equivalent to containing no three elements of the form x,fn(x),fn(fn(x))x, f_n(x), f_n(f_n(x)) with fn∈Ftf_n \in\mathcal{F}_{\rm t}, the set of integer translations. One can similarly construct related progressions using different families of functions. We investigate several such families, including geometric progressions (fn(x)=nxf_n(x) = nx with n>1n > 1 a natural number) and exponential progressions (fn(x)=xnf_n(x) = x^n). Progression-free sets are often constructed "greedily," including every number so long as it is not in progression with any of the previous elements. Rankin characterized the greedy geometric-progression-free set in terms of the greedy arithmetic set. We characterize the greedy exponential set and prove that it has asymptotic density 1, and then discuss how the optimality of the greedy set depends on the family of functions used to define progressions. Traditionally, the size of a progression-free set is measured using the (upper) asymptotic density, however we consider several different notions of density, including the uniform and exponential densities.Comment: Version 1.0, 13 page

    Anti-Powers in Infinite Words

    Get PDF
    In combinatorics of words, a concatenation of kk consecutive equal blocks is called a power of order kk. In this paper we take a different point of view and define an anti-power of order kk as a concatenation of kk consecutive pairwise distinct blocks of the same length. As a main result, we show that every infinite word contains powers of any order or anti-powers of any order. That is, the existence of powers or anti-powers is an unavoidable regularity. Indeed, we prove a stronger result, which relates the density of anti-powers to the existence of a factor that occurs with arbitrary exponent. As a consequence, we show that in every aperiodic uniformly recurrent word, anti-powers of every order begin at every position. We further show that every infinite word avoiding anti-powers of order 33 is ultimately periodic, while there exist aperiodic words avoiding anti-powers of order 44. We also show that there exist aperiodic recurrent words avoiding anti-powers of order 66.Comment: Revision submitted to Journal of Combinatorial Theory Series

    On sets of integers which contain no three terms in geometric progression

    Full text link
    The problem of looking for subsets of the natural numbers which contain no 3-term arithmetic progressions has a rich history. Roth's theorem famously shows that any such subset cannot have positive upper density. In contrast, Rankin in 1960 suggested looking at subsets without three-term geometric progressions, and constructed such a subset with density about 0.719. More recently, several authors have found upper bounds for the upper density of such sets. We significantly improve upon these bounds, and demonstrate a method of constructing sets with a greater upper density than Rankin's set. This construction is optimal in the sense that our method gives a way of effectively computing the greatest possible upper density of a geometric-progression-free set. We also show that geometric progressions in Z/nZ behave more like Roth's theorem in that one cannot take any fixed positive proportion of the integers modulo a sufficiently large value of n while avoiding geometric progressions.Comment: 16 page

    On partitions avoiding 3-crossings

    Full text link
    A partition on [n][n] has a crossing if there exists i_1<i_2<j_1<j_2i\_1<i\_2<j\_1<j\_2 such that i_1i\_1 and j_1j\_1 are in the same block, i_2i\_2 and j_2j\_2 are in the same block, but i_1i\_1 and i_2i\_2 are not in the same block. Recently, Chen et al. refined this classical notion by introducing kk-crossings, for any integer kk. In this new terminology, a classical crossing is a 2-crossing. The number of partitions of [n][n] avoiding 2-crossings is well-known to be the nnth Catalan number C_n=(2nn)/(n+1)C\_n={{2n}\choose n}/(n+1). This raises the question of counting kk-noncrossing partitions for k≥3k\ge 3. We prove that the sequence counting 3-noncrossing partitions is P-recursive, that is, satisfies a linear recurrence relation with polynomial coefficients. We give explicitly such a recursion. However, we conjecture that kk-noncrossing partitions are not P-recursive, for k≥4k\ge 4

    Identifying all abelian periods of a string in quadratic time and relevant problems

    Full text link
    Abelian periodicity of strings has been studied extensively over the last years. In 2006 Constantinescu and Ilie defined the abelian period of a string and several algorithms for the computation of all abelian periods of a string were given. In contrast to the classical period of a word, its abelian version is more flexible, factors of the word are considered the same under any internal permutation of their letters. We show two O(|y|^2) algorithms for the computation of all abelian periods of a string y. The first one maps each letter to a suitable number such that each factor of the string can be identified by the unique sum of the numbers corresponding to its letters and hence abelian periods can be identified easily. The other one maps each letter to a prime number such that each factor of the string can be identified by the unique product of the numbers corresponding to its letters and so abelian periods can be identified easily. We also define weak abelian periods on strings and give an O(|y|log(|y|)) algorithm for their computation, together with some other algorithms for more basic problems.Comment: Accepted in the "International Journal of foundations of Computer Science

    Patterns in Inversion Sequences I

    Full text link
    Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying interpretation that relates a vast array of combinatorial structures. In this paper, we introduce the notion of patterns in inversion sequences. A sequence (e1,e2,…,en)(e_1,e_2,\ldots,e_n) is an inversion sequence if 0≤ei<i0 \leq e_i<i for all i∈[n]i \in [n]. Inversion sequences of length nn are in bijection with permutations of length nn; an inversion sequence can be obtained from any permutation π=π1π2…πn\pi=\pi_1\pi_2\ldots \pi_n by setting ei=∣{j ∣ jπi}∣e_i = |\{j \ | \ j \pi_i \}|. This correspondence makes it a natural extension to study patterns in inversion sequences much in the same way that patterns have been studied in permutations. This paper, the first of two on patterns in inversion sequences, focuses on the enumeration of inversion sequences that avoid words of length three. Our results connect patterns in inversion sequences to a number of well-known numerical sequences including Fibonacci numbers, Bell numbers, Schr\"oder numbers, and Euler up/down numbers
    • …
    corecore