中文
相关论文

相关论文: Generalized Nested Summation of Powers of Natural …

200 篇论文

We extend the construction of so-called encapsulated global summation-by-parts operators to the general case of a mesh which is not boundary conforming. Owing to this development, energy stable discretizations of nonlinear and variable…

数值分析 · 数学 2023-05-30 Tomas Lundquist , Andrew Winters , Jan Nordström

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

组合数学 · 数学 2020-10-13 Mirko D'Ovidio , Anna Chiara Lai , Paola Loreti

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…

组合数学 · 数学 2017-05-24 Julien Leroy , Michel Rigo , Manon Stipulanti

For any integer $x$, let $T_x$ denote the triangular number $\frac{x(x+1)}{2}$. In this paper we give a complete characterization of all the triples of positive integers $(\alpha, \beta, \gamma)$ for which the ternary sums $\alpha x^2…

数论 · 数学 2011-01-19 Wai Kiu Chan , Anna Haensch

We use representations and differentiation algorithms of posets, in order to obtain results concerning unsolved problems on figurate numbers. In particular, we present criteria for natural numbers which are the sum of three octahedral…

数论 · 数学 2008-06-17 Agustin Moreno C

We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.

综合数学 · 数学 2008-03-10 William B. Everett

In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…

数论 · 数学 2023-05-25 Ben Kane , Zichen Yang

We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…

数论 · 数学 2018-08-31 Rustem R. Aidagulov , Max A. Alekseyev

An abstract mathematical framework is presented in this paper as a unification of several deformed or generalized algebra proposed recently in the context of generalized statistical theories intended to treat certain complex thermodynamic…

The Numerical Assembly Technique is extended to investigate arbitrary planar frame structures with the focus on the computation of natural frequencies. This allows us to obtain highly accurate results without resorting to spatial…

数值分析 · 数学 2022-04-26 Thomas Kramer , Michael Helmut Gfrerer

The distribution of the sum of r-th power of standard normal random variables is a generalization of the chi-squared distribution. In this paper, we represent the probability density function of the random variable by an one-dimensional…

经典分析与常微分方程 · 数学 2018-06-25 Tamio Koyama

In this paper, we investigate two methods to express the natural powers of $2$ as sums over integer partitions. First we consider a formula by N. J. Fine that allows us to express a binomial coefficient in terms of multinomial coefficients…

数论 · 数学 2020-09-15 Mircea Merca

We evaluate the nested sum $\sum_{a_{n - 1} = c}^{a_n } {\sum_{a_{n - 2} = c}^{a_{n - 1} } { \cdots \sum_{a_0 = c}^{a_1 } {x^{a_0 } } } }$ where $a_n$ and $c$ are any integers and $x$ is a real or complex variable. Consequently, we evaluate…

数论 · 数学 2022-09-09 Kunle Adegoke

It is demonstrated how an explicit expression of the (partial) sum of Tetranacci numbers can be found and proved using generating functions and the Hadamard product. We also provide a Binet-type formula for generalized Fibonacci numbers, by…

数论 · 数学 2020-01-22 Helmut Prodinger , Sarah J. Selkirk

We consider the $k$-nested sum of integer powers, $F(n,m,k)$, defined as repeated partial sums of the classical Faulhaber polynomials. We provide an explicit recurrence relation relating $F(n,m,k)$ to sums of lower power $m-1$ and higher…

组合数学 · 数学 2025-11-21 Alexander R. Povolotsky

Several formulations have long existed in the literature in the form of continuous mixtures of normal variables where a mixing variable operates on the mean or on the variance or on both the mean and the variance of a multivariate normal…

概率论 · 数学 2020-03-31 Reinaldo B. Arellano-Valle , Adelchi Azzalini

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

数论 · 数学 2012-10-03 Ayah Almousa , Melanie Matchett Wood

We investigate here sums of triangular numbers $f(x):=\sum_i b_i T_{x_i}$ where $T_n$ is the $n$-th triangular number. We show that for a set of positive integers $S$ there is a finite subset $S_0$ such that $f$ represents $S$ if and only…

数论 · 数学 2009-09-15 Ben Kane

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…

组合数学 · 数学 2021-11-17 Quinn Minnich

A four-term recurrence relation for squared spherical Bessel functions is shown to yield closed-form expressions for several types of finite weighted sums of these functions. The resulting sum rules, which may contain an arbitrarily large…

经典分析与常微分方程 · 数学 2018-07-23 L G Suttorp , A J van Wonderen