中文
相关论文

相关论文: Generating Function for Pinsky's Combinatorial Sec…

200 篇论文

Let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set of $l$ consecutive numbers $\{k,k+1,\cdots, k+l-1\}$ appear in a set of $l$ consecutive positions. Let $p=\{p_j\}_{j=1}^\infty$ be a distribution on $\mathbb{N}$ with $p_j>0$. Let…

概率论 · 数学 2021-01-08 Ross G. Pinsky

If \(A \) is a set of natural numbers containing \(0 \), then there is a unique nonempty "reciprocal" set \(B \) of natural numbers (containing \(0 \)) such that every positive integer can be written in the form \(a + b \), where \(a \in A…

数论 · 数学 2014-09-11 Joshua Cooper , Alexander Riasanovsky

We show that the moment generating function of the Kullback-Leibler divergence (relative entropy) between the empirical distribution of $n$ independent samples from a distribution $P$ over a finite alphabet of size $k$ (i.e. a multinomial…

信息论 · 计算机科学 2020-10-06 Rohit Agrawal

A well-known result from Hardy and Ramanujan gives an asymptotic expression for the number of possible ways to express an integer as the sum of smaller integers. In this vein, we consider the general partitioning problem of writing an…

数学物理 · 物理学 2009-02-10 Michael Coons , Klaus Kirsten

A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the…

Let $\mathcal{A}(\ell,n) \subset S_n^{\ell}$ denote the set of all $\ell$-tuples $(\pi_1,\dots,\pi_{\ell})$, for $\pi_1,\dots,\pi_{\ell} \in S_n$ satisfying: $\forall i<j$ we have $\pi_i\pi_j=\pi_j\pi_i$. Considering the action of $S_n$ on…

组合数学 · 数学 2025-05-15 Shannon Starr

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

泛函分析 · 数学 2025-04-04 Michael Anshelevich , Anh Nguyen

We investigate the combinatorial sequences $A(M, n)$ introduced by W. G. Brown (1964) and W. T. Tutte (1980) appearing in enumeration of convex polyhedra. Their formula is $$A(M, n) = \frac{2 (2M+3)!}{(M+2)! M!}\,\frac{(4n+2M+1)!}{n! (3n +…

组合数学 · 数学 2023-06-19 K. A. Penson , K. Górska , A. Horzela , G. H. E. Duchamp

In 2003, Zhao discovered a curious congruence involving harmonic series and Bernoulli numbers: for any odd prime $p$, $$\sum_{\substack{i,j,k\ge 1\\\gcd(ijk,p)=1\\i+j+k=p}}\frac{1}{ijk}\equiv -2B_{p-3} \pmod{p},$$ where $B_n$ is the $n$-th…

数论 · 数学 2021-10-20 Shane Chern

We extend the reciprocity method of Jones and Remmel to study generating functions of the form $$\sum_{n \geq 0} \frac{t^n}{n!} \sum_{\sigma \in \mathcal{NM}_n(\Gamma)}x^{\mathrm{LRmin}(\sigma)}y^{1+\mathrm{des}(\sigma)}$$ where $\Gamma$ is…

组合数学 · 数学 2015-10-16 Quang T. Bach , Jeffrey B. Remmel

The whole enterprise of spin compositions can be recast as simple enumerative combinatoric problems. We show here that enumerative combinatorics (EC)\citep{book:Stanley-2011} is a natural setting for spin composition, and easily leads to…

数学物理 · 物理学 2018-01-23 Jerryman Appiahene Gyamfi , Vincenzo Barone

Let $k\geq 2$ be a positive integer. We study concentration results for the ordered representation functions $r^{\leq}_k(A,n) = \# \big\{ (a_1 \leq \dots \leq a_k) \in A^k : a_1+\dots+a_k = n \big\}$ and $r^{<}_k(A,n) = \# \big\{ (a_1 <…

数论 · 数学 2020-12-29 Gonzalo Cao-Labora , Juanjo Rué , Christoph Spiegel

We prove exact formulas for weighted $2k$th moments of the Riemann zeta function for all integer $k\geq 1$ in terms of the analytic continuation of an auto-correlation function. This latter enjoys several functional equations. One of them,…

数论 · 数学 2023-11-07 Sébastien Darses , Joseph Najnudel

Let $B_{k,i}(n)$ be the number of partitions of $n$ with certain difference condition and let $A_{k,i}(n)$ be the number of partitions of $n$ with certain congruence condition. The Rogers-Ramanujan-Gordon theorem states that…

组合数学 · 数学 2014-02-26 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi

A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the…

概率论 · 数学 2020-12-15 Dariusz Buraczewski , Bohdan Dovgay , Alexander Marynych

Using the Dirichlet theorem on the equidistribution of residue classes modulo $q$ and the Lemke Oliver-Soundararajan conjecture on the distribution of pairs of residues on consecutive primes, we show that the domain of convergence of the…

数论 · 数学 2018-07-04 Giuseppe Mussardo , Andre LeClair

A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…

概率论 · 数学 2015-11-13 Boris L. Granovsky , Dudley Stark

We introduce some new classes of words and permutations characterized by the second difference condition $\pi(i-1) + \pi(i+1) - 2\pi(i) \leq k$, which we call the $k$-convexity condition. We demonstrate that for any sized alphabet and…

组合数学 · 数学 2015-07-08 Christopher Coscia , Jonathan DeWitt

Let $k_i\in \mathbb N$ $(i\ge 1)$ satisfy $2\le k_1\le k_2\le \ldots $. Freiman's theorem shows that when $j\in \mathbb N$, there exists $s=s(j)\in \mathbb N$ such that all large integers $n$ are represented in the form…

数论 · 数学 2024-02-21 Joerg Bruedern , Trevor D. Wooley

In this paper we study combinatorial aspects of permutations of $\{1,\ldots,n\}$ and related topics. In particular, we prove that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$)…

组合数学 · 数学 2021-03-25 Zhi-Wei Sun