中文
相关论文

相关论文: Continued Fractions and Unique Additive Partitions

200 篇论文

We look at a class of transcendental real numbers xi which, together with their square, satisfy some extremal property of simultaneous approximation by rational numbers with the same denominator. We give a sufficient condition for such a…

数论 · 数学 2013-01-07 Damien Roy

Recently, Schneider and Schneider defined a new class of partitions called sequentially congruent partitions, in which each part is congruent to the next part modulo its index, and they proved two partition bijections involving these…

组合数学 · 数学 2022-08-10 Ezekiel Cochran , Madeline Locus Dawsey , Emma Harrell , Samuel Saunders

In this paper, we will first summarize known results concerning continued fractions. Then we will limit our consideration to continued fractions of quadratic numbers. The second author described periods and sometimes precise form of…

组合数学 · 数学 2023-08-17 Lubomíra Balková , Aranka Hrušková

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

组合数学 · 数学 2024-12-11 Michael Neubauer , Harmony Vargas

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

A subset $U$ of a set $S$ with a binary operation is called {\it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of…

组合数学 · 数学 2007-06-26 Nandor Sieben

This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…

组合数学 · 数学 2026-01-16 Lorenzo Campioni

A partition of a positive integer $n$ is a non-increasing sequence of positive integers which sum to $n$. A recently studied aspect of partitions is the minimal excludant of a partition, which is defined to be the smallest positive integer…

数论 · 数学 2025-07-08 Judy Ann Donato

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

组合数学 · 数学 2017-05-16 Shishuo Fu , Dazhao Tang

For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets…

数论 · 数学 2016-08-22 Sándor Z. Kiss , Csaba Sándor

For integers $m \geq 2$, we study divergent continued fractions whose numerators and denominators in each of the $m$ arithmetic progressions modulo $m$ converge. Special cases give, among other things, an infinite sequence of divergence…

数论 · 数学 2019-01-01 Douglas Bowman , James Mc Laughlin

Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…

组合数学 · 数学 2021-10-27 George E. Andrews , Shane Chern , Zhitai Li

The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…

综合数学 · 数学 2007-05-23 Ashok Kumar Gupta , Ashok Kumar Mittal

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

组合数学 · 数学 2012-07-16 Noga Alon

In 2000 Klazar introduced a new notion of pattern avoidance in the context of set partitions of $[n]=\{1,\ldots, n\}$. The purpose of the present paper is to undertake a study of the concept of Wilf-equivalence based on Klazar's notion. We…

组合数学 · 数学 2023-06-22 Jonathan Bloom , Dan Saracino

This paper aims to introduce high school students to the intriguing world of continued fractions, a mathematical concept that provides a unique representation of numbers. The study focuses on the exploration and development of the…

历史与综述 · 数学 2025-01-03 Athanasios Paraskevopoulos

A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…

组合数学 · 数学 2016-01-27 Armin Straub

We establish a fractal transference principle for continued fraction expansions over the field of Laurent series. Let $S$ be an infinite subset of the set of all polynomials over a finite field of $q$ elements of positive degree with growth…

动力系统 · 数学 2026-04-23 Yuto Nakajima

We characterize sequences of positive integers $(a_1,a_2,\ldots,a_n)$ for which the $2\times2$ matrix $\left( \begin{array}{cc} a_n&-1 1&0 \end{array} \right) \left( \begin{array}{cc} a_{n-1}&-1 1&0 \end{array} \right) \cdots \left(…

组合数学 · 数学 2018-05-23 Valentin Ovsienko

The study of patterns in permutations in a very active area of current research. Klazar defined and studied an analogous notion of pattern for set partitions. We continue this work, finding exact formulas for the number of set partitions…

组合数学 · 数学 2007-05-23 Bruce E. Sagan