相关论文: Continued Fractions and Unique Additive Partitions

Pattern avoidance in the symmetric group $S_n$ has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work has generalized these results to $S_n\wr C_c$, the objects…

We consider two classes of $q$-continued fraction whose odd and even parts are limit 1-periodic for $|q|>1$, and give theorems which guarantee the convergence of the continued fraction, or of its odd- and even parts, at points outside the…

Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.

If the odd and even parts of a continued fraction converge to different values, the continued fraction may or may not converge in the general sense. We prove a theorem which settles the question of general convergence for a wide class of…

If $a_1, a_2, ..., a_k$ and $n$ are positive integers such that $n = a_1 + a_2 + ... + a_k$, then the sum $a_1 + a_2 + ... + a_k$ is said to be a \emph{partition of $n$} of \emph{length $k$}, and $a_1, a_2, ..., a_k$ are said to be the…

We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…

Main result: If a C*-algebra is simple, $\sigma$-unital, has finitely many extremal traces, and has strict comparison of positive elements by traces, then its multiplier also has strict comparison of positive elements by traces. The same…

In the preceding decade, Andrews and Newman resurrected the concept of a `minimal excludant' of a partition ($mex$, for short), namely, the least positive missing integer in a partition. Subsequently, several authors have not only studied…

Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…

This paper completes the classification of maximal unrefinable partitions, extending a previous work of Aragona et al. devoted only to the case of triangular numbers. We show that the number of maximal unrefinable partitions of an integer…

Motivated by the optimal continued fractions studied independently by Selenius and Bosma, we define and introduce algorithms producing superoptimal continued fraction expansions of irrationals. The convergents of these expansions…

A set $M$ of nonzero integers is said to split a finite abelian group $G$ if there exists a subset $S\subseteq G$ such that $M\cdot S = G\setminus\{0\}$. Such a splitting is called purely singular if every prime divisor of $|G|$ divides…

For positive integers $n, L$ and $s$, consider the following two sets that both contain partitions of $n$ with the difference between the largest and smallest parts bounded by $L$: the first set contains partitions with smallest part $s$,…

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…

Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly characterizes the number of partitions with designated summands…

Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a…

We initiate the study of the sets $H(c)$, $0<c<1$, of real $x$ for which the sequence $(kx)_{k\geq1}$ (viewed mod 1) consistently hits the interval $[0,c)$ at least as often as expected (i. e., with frequency $\geq c$). More formally, \[…

West's stack-sorting map involves a stack which avoids the permutation $21$ consecutively. Defant and Zheng extended this to a consecutive-pattern-avoiding stack-sorting map $SC_\sigma$, where the stack must always avoid a given permutation…

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…