中文
相关论文

相关论文: Two exercises of Comtet and two identities of Rueh…

200 篇论文

Mathematical functions, which often appear in mathematical analysis, are referred to as special functions and have been studied over hundreds of years. Many books and dictionaries are available that describe their properties and serve as a…

经典分析与常微分方程 · 数学 2023-11-28 Yoshitaka Okuyama

In 1959, N. J. Fine showed that the sum of the multinomial coefficients corresponding to the partitions of a natural number $n$ into $r$ parts is a binomial coefficient: $$ \sum_{\substack{k_1 + k_2 + k_3 + {}\ldots = r \\ k_1 + 2k_2 + 3k_3…

组合数学 · 数学 2025-08-19 Dean Rubine

As a by-product of a finite-size Bethe Ansatz calculation in statistical mechanics, Doochul Kim has established, by an indirect route, three mathematical identities rather similar to the conjugate modulus relations satisfied by the elliptic…

统计力学 · 物理学 2008-11-26 R. J. Baxter

Mizuno provided 19 examples of generalized rank three Nahm sums with symmetrizer $\mathrm{diag}(1,1,2)$ which are conjecturally modular. We confirm their modularity by establishing Rogers--Ramanujan type identities of index $(1,1,2)$ for…

数论 · 数学 2024-02-12 Boxue Wang , Liuquan Wang

The Collatz conjecture (also known as the $3x+1$ problem) concerns the behavior of the discrete dynamical system on the positive integers defined by iteration of the so-called $3x + 1$ function. We investigate analogous dynamical systems in…

数论 · 数学 2016-10-11 Daniel Nichols

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…

组合数学 · 数学 2010-07-19 Emrah Kilic , Eugen J. Ionascu

We continue our study of a basic but seemingly intractable problem in integer partition theory, namely the conjecture that $p(n)$ is odd exactly $50\%$ of the time. Here, we greatly extend on our previous paper by providing a…

组合数学 · 数学 2018-03-28 Samuel D. Judge , Fabrizio Zanello

We consider Weil sums of binomials of the form $W_{F,d}(a)=\sum_{x \in F} \psi(x^d-a x)$, where $F$ is a finite field, $\psi\colon F\to {\mathbb C}$ is the canonical additive character, $\gcd(d,|F^\times|)=1$, and $a \in F^\times$. If we…

数论 · 数学 2015-03-18 Daniel J. Katz , Philippe Langevin

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…

组合数学 · 数学 2013-02-12 Milan Janjic

For each positive integer $n$, function $f$, and point $x$, the 1998 conjecture by Ghinchev, Guerragio, and Rocca states that the existence of the $n$-th Peano derivative $f_{(n)}(x)$ is equivalent to the existence of all $n(n+1)/2$…

经典分析与常微分方程 · 数学 2022-11-18 J. M. Ash , S. Catoiu , H Fejzic

Let $$ A_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j\choose 2j}\sum_{k=0}^{n-1} \sin(a+2k\pi/n) \cos^{2j}(a+2k\pi/n) $$ and $$ B_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j+1\choose 2j+1}\sum_{k=0}^{n-1} \sin(a+2k\pi/n) \cos^{2j+1}(a+2k\pi/n), $$ where $m\geq…

经典分析与常微分方程 · 数学 2023-01-02 Horst Alzer , Semyon Yakubovich

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…

经典分析与常微分方程 · 数学 2024-09-11 Titus Hilberdink

In 1972, J. S. Lew established a reasonable conjecture regarding an axiomatic characterization for the one-dimensional Riemann-Liouville integral. This conjecture was proved by Cartwright and McMullen in 1978. After that, little further…

经典分析与常微分方程 · 数学 2026-04-02 Daniel Cao Labora , Marc Jornet

A recent conjecture by C. Carlet on the sum-freedom of the binary multiplicative inverse function can be stated as follows: For each pair of positive integers $(n,k)$ with $3\le k\le n-3$, there is a $k$-dimensional $\Bbb F_2$-subspace $E$…

数论 · 数学 2025-05-01 Xiang-dong Hou , Shujun Zhao

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

概率论 · 数学 2023-02-09 Paweł J. Szabłowski

In this note we prove that \[ j!\,2^N \, \binom{N+j-1}{j} \, {}_2F_1\left(\begin{matrix}-j,-2j \\ -N-j+1 \end{matrix};-1\right) = \sum_{l=0}^N \binom{N}{l}\prod_{i=0}^{j-1}2(2i+1+l), \] where $ N $ and $ j $ are positive integers, which…

经典分析与常微分方程 · 数学 2024-01-19 Maxim L. Yattselev

Already in 1734 Euler found a short explicit formula for the value of Riemann zeta function Zeta(s) when the argument s equals a positive integer 2n where n=1,2,3,. No such formula exists for odd positive integer arguments of Zeta. The…

数论 · 数学 2012-12-11 Renaat Van Malderen

Recent work by Pain [1] proposed a systematic approach to evaluating binomial sums involving reciprocals of binomial coefficients via Beta integrals. In particular, a parametric extension (Proposition 6.1) was introduced and claimed to…

组合数学 · 数学 2026-04-09 Johar M. Ashfaque

Ruzsa's inequality states that $|A+A+A| \leq |A+A|^{3/2}$ for any finite set $A$ in a commutative group. Ruzsa has constructed examples showing that this inequality is sharp asymptotically, up to a constant factor. We prove an inverse…

组合数学 · 数学 2025-10-28 Swaroop Hegde

Fix an integer $h \geq 2$, and let $b_1, \ldots, b_h$ be (not necessarily distinct) positive integers with $\gcd(b_1, \ldots, b_h) = 1$. For any subset $A \subseteq \mathbb{N}$, let $r_A(n)$ denote the number of solutions $(k_1, \ldots,…

数论 · 数学 2026-05-06 Christian Táfula