Related papers: Continued Fractions and Unique Additive Partitions
A set partition $\sigma$ of $[n]=\{1,\cdots ,n\}$ contains another set partition $\omega$ if a standardized restriction of $\sigma$ to a subset $S\subseteq[n]$ is equivalent to $\omega$. Otherwise, $\sigma$ avoids $\omega$. Sagan and Goyt…
Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…
Enumeration of pattern-avoiding objects is an active area of study with connections to such disparate regions of mathematics as Schubert varieties and stack-sortable sequences. Recent research in this area has brought attention to colored…
We extend a result of Han\v{c}l, Kolouch and Nair on the irrationality and transcendence of continued fractions. We show that for a sequence $\{\alpha_n\}$ of algebraic integers of bounded degree, each attaining the maximum absolute value…
We consider the real number $\sigma$ with continued fraction expansion $[a_0, a_1, a_2,\ldots] = [1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,16,\ldots]$, where $a_i$ is the largest power of $2$ dividing $i+1$. We compute the irrationality measure of…
Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…
In this paper, we show that both 12312-avoiding partitions and 12321-avoiding partitions of the set $[n+1]$ are in one-to-one correspondence with Schr\"oder paths of semilength $n$ without peaks at even level. As a consequence, the refined…
Klazar defined and studied a notion of pattern avoidance for set partitions, which is an analogue of pattern avoidance for permutations. Sagan considered partitions which avoid a single partition of three elements. We enumerate partitions…
Continued fractions whose elements are polynomial sequences have been carefully studied mostly in the cases where the degree of the numerator polynomial is less than or equal to two and the degree of the denominator polynomial is less than…
The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…
Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. We study the difference between the number of summands in the partition of two consecutive integers. In particular, let…
The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…
Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…
In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…
Andrews and El Bachraoui recently studied integer partitions where the smallest part is repeated a specified number of times and any other parts are distinct. Their results included two ``surprising identities'' for which they requested…
Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…
Continued fractions with prescribed structures on sequences of their partial quotients have been intensively studied in the literature. As far as an integer sequence, especially a randomly generated one is concerned, an attractive question…
Let $x$ be a periodic continued fraction with the initial block $0$ and the repeating block $c_1,\ldots,c_n$. So $x$ is a quadratic irrational of the form $x=a+\sqrt b$, where $a$, $b$ are rational numbers, $b>0$, $b$ not a square. The…
A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the…