Results 241 to 250 of about 171,184 (277)
Some of the next articles are maybe not open access.

Three Identities in Combinatory Analysis

Journal of the London Mathematical Society, 1943
Es sei \[ x_n = 1 - x^n, \quad \bar x_n = 1 + x^n, \quad x_n!= \prod_{i=1}^n x_i, \quad \bar x_n! = \prod_{i=1}^n \bar x_i, \] \[ x_n^2 = x_{2n}, \quad x_n^2! = x_2x_4\ldots x_{2n}, \quad x! = x_\infty !,\quad \bar x! = \bar x_\infty!, \quad x^2! = x_\infty^2!, \] dann beweist der Verf.
openaire   +2 more sources

COMBINATORIAL IDENTITIES

Bulletin of the London Mathematical Society, 1971
Lajos Takacs, John Riordan
openaire   +2 more sources

Some Combinatorial Identities of Bernstein

SIAM Journal on Mathematical Analysis, 1978
For g a rational integer such that $\Delta = 4g^3 + 27$ is square-free, let w denote the real root of $u^3 + gu - 1 = 0$ and put $w^n = r_n + s_n w + t_n w^2 $, $w^{ - n} = x_n + y_n w + z_n w^2 $, $n \geqq 0$. Making use of the theory of units in an algebraic number field, Bernstein obtained quadratic relations involving the $r_n $ and $x_n $ as well ...
openaire   +1 more source

Two Combinatorial Identities

SIAM Review, 1995
Xinrong Ma, Tian-Ming Wang
openaire   +1 more source

Divided Differences and Combinatorial Identities

Studies in Applied Mathematics, 1991
We present an algebraic theory of divided differences which includes confluent differences, interpolation formulas, Liebniz's rule, the chain rule, and Lagrange inversion. Our approach uses only basic linear algebra. We also show that the general results about divided differences yield interesting combinatorial identities when we consider some suitable
openaire   +2 more sources

Inversion Techniques and Combinatorial Identities

1994
The purpose of this article is to emphasize the usefulness of inverse relations in order to derive (possibly) new identities from known ones. This method was made popular by \textit{J. Riordan} [``Combinatorial identities'' (1968; Zbl 0194.005)]. Suppose tht \((M_{nk})_{n,k\geq 0}\) and \((M^{-1}_{nk})_{n,k\geq 0}\) are (infinite-dimensional) lower ...
openaire   +3 more sources

A combinatorial identity with applications to forest graphs

Discrete Mathematics, 2021
A L Rebenko, Baptiste Savoie
exaly  

A Combinatorial Identity

SIAM Review, 1979
T. V. Narayana, M. Özsoyoglu
openaire   +1 more source

Home - About - Disclaimer - Privacy