English
Related papers

Related papers: Continued Fractions and Unique Additive Partitions

200 papers

Given an integer $n$, we introduce the integral Lie ring of partitions with bounded maximal part, whose elements are in one-to-one correspondence to integer partitions with parts in $\{1,2,\dots, n-1\}$. Starting from an abelian subring, we…

Combinatorics · Mathematics 2023-03-10 Riccardo Aragona , Roberto Civino , Norberto Gavioli

In the present paper we show that there exist infinitely many consecutive square-free numbers of the form $[\alpha n]$, $[\alpha n]+1$, where $\alpha>1$ is irrational number with bounded partial quotient or irrational algebraic number.

Number Theory · Mathematics 2019-03-26 S. I. Dimitrov

We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…

Number Theory · Mathematics 2016-03-11 Andrew N. W. Hone

Let $\alpha_1, \cdots, \alpha_d$ be real numbers, and let $S$ be the set of integers $s$ so that $||\alpha_i s||_{\mathbb{R}/\mathbb{Z}}>\delta$ for some $i$ and some fixed $\delta>0$. We prove $S$ is not \enquote{$2$-large}, i.e. there is…

Combinatorics · Mathematics 2025-12-25 Ryan Alweiss

Building an infinite square-free word by appending one letter at a time while simultaneously avoiding the creation of squares is most likely to fail. When the alphabet has two letters this approach is impossible. When the alphabet has three…

Combinatorics · Mathematics 2013-10-29 Yasmine B. Sanderson

We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our…

Combinatorics · Mathematics 2020-04-29 Wenston J. T. Zang , Jiang Zeng

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

For any given real number $\alpha$ with bounded partial quotients, we construct explicitly continuum many real numbers $\beta$ with bounded partial quotients for which the pair $(\alpha, \beta)$ satisfies a strong form of the Littlewood…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

Every set of natural numbers determines a generating function convergent for $q \in (-1,1)$ whose behavior as $q \rightarrow 1^-$ determines a germ. These germs admit a natural partial ordering that can be used to compare sizes of sets of…

Combinatorics · Mathematics 2017-11-13 James Propp

The main purpose of this paper is to prove that the positive real numbers can be decomposed into finitely many disjoint pieces which are also closed under addition and multiplication. As a byproduct of the argument we determine all the…

Number Theory · Mathematics 2023-03-30 Gergely Kiss , Gábor Somlai , Tamás Terpai

We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…

Number Theory · Mathematics 2025-08-22 Cormac O'Sullivan

We study orbits of semigroups of $\text{SL}(2,\mathbb{Z})$, and demonstrate reciprocity obstructions: we show that certain such orbits avoid squares, but not as a consequence of obstructions inherited from an algebraic set, and not as a…

Number Theory · Mathematics 2025-12-24 James Rickards , Katherine E. Stange

We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we…

Combinatorics · Mathematics 2017-08-08 Alexander Berkovich , Ali K. Uncu

For a positive rational $\alpha$, call a set of distinct positive integers $\{a_1, a_2, \ldots, a_r\}$ an $\alpha$-partition of $n$, if the sum of the $a_i$ is equal to $n$ and the sum of the reciprocals of the $a_i$ is equal to $\alpha$.…

Number Theory · Mathematics 2025-07-25 Wouter van Doorn

In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-19 Stephen Dolan

Given $0<\alpha<1$, the Beatty sequence of density $\alpha$ is the sequence $B_{\alpha}=(\lfloor n/\alpha\rfloor)_{n\in\mathbb{N}}$. Beatty's theorem states that if $\alpha,\beta$ are irrational numbers with $\alpha+\beta=1$, then the…

Number Theory · Mathematics 2019-07-23 A. J. Hildebrand , Junxian Li , Xiaomin Li , Yun Xie

Let $\frak E$ denote be the ring of Eisenstein integers. Let $z\in \mathbb C$ and $p_n,q_n \in \frak E$ be such that $\{p_n/q_n\}$ is the sequence of convergents corresponding to the continued fraction expansion of $z$ with respect to the…

Number Theory · Mathematics 2017-03-23 S. G. Dani

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

Rings and Algebras · Mathematics 2017-03-22 Jason K. C. Polak

Recently, Xia introduced a deterministic variation $\phi_{\sigma}$ of Defant and Kravitz's stack-sorting maps for set partitions and showed that any set partition $p$ is sorted by $\phi^{N(p)}_{aba}$, where $N(p)$ is the number of distinct…

Combinatorics · Mathematics 2024-03-11 Yunseo Choi , Katelyn Gan , Andrew Li , Tiffany Zhu

An unfriendly partition of a graph $G = (V,E)$ is a function $c: V \to 2$ such that $|\{x\in N(v): c(x)\neq c(v)\}|\geq |\{x\in N(v): c(x)=c(v)\}|$ for every vertex $v\in V$, where $N(v)$ denotes its neighborhood. It was conjectured by…

Combinatorics · Mathematics 2023-04-06 Leandro Fiorini Aurichi , Lucas Real