中文
相关论文

相关论文: The number of fixed points of Wilf's partition inv…

200 篇论文

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

数论 · 数学 2021-09-27 Szabolcs Tengely , Maciej Ulas

Let $\alpha>1$ be an irrational number. We establish asymptotic formulas for the number of partitions of $n$ into summands and distinct summands, chosen from the Beatty sequence $(\lfloor\alpha m\rfloor)_{m\in\mathbb{N}}$. This improves…

数论 · 数学 2021-04-06 Nian Hong Zhou

Let $f$ be a pseudo-Anosov homeomorphism on a closed, oriented surface. We give an effective construction of Markov partitions for $f$ based on a simple combinatorial criterion deciding when an immersed graph bounds a Markov partition. This…

动力系统 · 数学 2025-11-26 Inti Cruz Diaz

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

数论 · 数学 2016-05-10 George E. Andrews , Matthias Beck , Neville Robbins

Assume $\mathsf{M}_n$ is the $n$-dimensional permutation module for the symmetric group $\mathsf{S}_n$, and let $\mathsf{M}_n^{\otimes k}$ be its $k$-fold tensor power. The partition algebra $\mathsf{P}_k(n)$ maps surjectively onto the…

表示论 · 数学 2018-10-03 Georgia Benkart , Tom Halverson

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

组合数学 · 数学 2018-05-22 Toufik Mansour , Madjid Mirzavaziri , Daniel Yaqubi

Euler's classic partition identity states that the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts. We develop a new generalization of this identity, which yields a previous…

Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…

数论 · 数学 2018-05-15 F. V. Weinstein

We prove an exact formula for OEIS A000119, which counts partitions into distinct Fibonacci numbers. We also establish an exact formula for its mean value, and determine the asymptotic behaviour.

数论 · 数学 2020-09-18 Sam Chow , Tom Slattery

Let $j\geq 3$ be any fixed integer and $f$ be a primitive holomorphic cusp form of even integral weight $\kappa\geq 2$ for the full modular group $SL(2,\mathbb{Z})$. We write $\lambda_{{\rm{sym}^j }f}(n)$ for the $n^\text{th}$ normalized…

数论 · 数学 2026-01-27 Kampamolla Venkatasubbareddy

The inverse problem for representation functions takes as input a triple (X,f,L), where X is a countable semigroup, f : X --> N_0 \cup {\infty} a function, L : a_1 x_1 + ... + a_h x_h an X-linear form and asks for a subset A \subseteq X…

数论 · 数学 2007-12-31 Peter Hegarty

We study a distributed particle filter proposed by Boli\'c et al.~(2005). This algorithm involves $m$ groups of $M$ particles, with interaction between groups occurring through a "local exchange" mechanism. We establish a central limit…

统计方法学 · 统计学 2016-05-20 Kari Heine , Nick Whiteley

$\beta(1,0)$-trees provide a convenient description of rooted non-separable planar maps. The involution $h$ on $\beta(1,0)$-trees was introduced to prove a complicated equidistribution result on a class of pattern-avoiding permutations. In…

组合数学 · 数学 2012-10-10 Sergey Kitaev , Anna de Mier

Let $f$ be an arithmetic function satisfying some simple conditions. The aim of this paper is to establish an asymptotical formula for the quantity \[ S_f(x):=\sum_{n\leq x}\frac{f([x/n])}{[x/n]} \] as $x\rightarrow\infty$, where $[t]$ is…

数论 · 数学 2023-03-02 Jing Ma , Ronghui Wu

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

组合数学 · 数学 2007-05-23 S. Corteel , C. D. Savage

We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of…

组合数学 · 数学 2022-05-13 Damanvir Singh Binner

We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.

综合数学 · 数学 2021-02-24 Sumit Kumar Jha

A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…

数论 · 数学 2020-04-22 Melvyn B. Nathanson

A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal…

概率论 · 数学 2021-12-22 Jacopo Borga , Enrica Duchi , Erik Slivken

We study an asymptotic formula for counting integral points over an equation defined by a non-degenerated indefinite integral ternary quadratic form $f$ representing a non-zero integer $a$ such that $-a\cdot det(f)$ is square over a number…

数论 · 数学 2021-03-22 Fei Xu , Runlin Zhang
‹ 上一页 1 8 9 10 下一页 ›