相关论文: Continued Fractions and Unique Additive Partitions

In the present paper, we give sufficient conditions on the elements of the continued fractions $A$ and $B$ that will assure us that the continued fraction $A^B$ is a transcendental number. With the same condition, we establish a…

We study explicit continued fraction expansions for certain series. Some of these expansions have symmetry that generalizes some remarkable examples discovered independently by Kmosek and Shallit. Furthermore, we prove the following…

We consider an analogue of Nakada's $\alpha$-continued fraction transformation in the setting of continued fractions with odd partial quotients. More precisely, given $\alpha \in [\frac{1}{2}(\sqrt{5}-1),\frac{1}{2}(\sqrt{5}+1)]$, we show…

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

A regular continuant is the denominator $K$ of a terminating regular continued fraction, interpreted as a function of the partial quotients. We regard $K$ as a function defined on the set of all finite words on the alphabet $1<2<3<\dots$…

Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…

Recently a new class of continued fraction algorithms, the $(N,\alpha$)-expansions, was introduced for each $N\in\mathbb{N}$, $N\geq 2$ and $\alpha \in (0,\sqrt{N}-1]$. Each of these continued fraction algorithms has only finitely many…

Consider the sets of integers $A$ that avoid any arrangement of $g$ congruent $h$-subsets. Our findings refine and improve upon some results by Erd\H{o}s and Harzheim about these sets.

For a given quadratic irrational $\alpha$, let us denote by $D(\alpha)$ the length of the periodic part of the continued fraction expansion of $\alpha$. We prove that for a positive integer $d$, which is not a perfect square, the sequence…

Considering an arbitrary pair of distinct and non constant polynomials, $a$ and $b$ in $\mathbb{F}_2[t]$, we build a continued fraction in $\mathbb{F}_2((1/t))$ whose partial quotients are only equal to $a$ or $b$. In a previous work of the…

Permutations of the positive integers avoiding arithmetic progressions of length $5$ were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length $7$. We…

Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

We investigate properties of attainable partitions of integers, where a partition $(n_1,n_2, \dots, n_r)$ of $n$ is attainable if $\sum (3-2i)n_i\geq 0$. Conjecturally, under an extension of the Cohen and Lenstra heuristics by Holmin et.…

For every irrational real $\alpha$, let $M(\alpha) = \sup_{n\geq 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or $\infty$, if unbounded). The $2$-adic Littlewood conjecture (2LC) can be stated as…

In a 2022 paper, Dawsey, Just and the present author prove that the set of integer partitions, taken as a monoid under a partition multiplication operation I defined in my Ph.D. work, is isomorphic to the positive integers as a monoid under…

Within the replica framework we study analytically the instance space of the number partitioning problem. This classic integer programming problem consists of partitioning a sequence of N positive real numbers $\{a_1, a_2,..., a_N}$ (the…

Given a set A of non-negative integers and a set B of positive integers,we are interested in computing all sets C (of positive integers) that are minimal in the family of sets K (of positive integers) such that (i) K contains no elements…

We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form $x \overline{x}$), and we completely classify which possibilities can occur. We consider…

Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…