Results 61 to 70 of about 18,239 (195)
Degenerate poly-Bernoulli polynomials arising from degenerate polylogarithm
Recently, degenerate polylogarithm functions were introduced by Kim and Kim. In this paper, we introduce degenerate poly-Bernoulli polynomials by means of the degenerate polylogarithm functions and investigate some their properties.
Taekyun Kim +4 more
doaj +1 more source
D-log and formal flow for analytic isomorphisms of n-space [PDF]
Given a formal map $F=(F_1...,F_n)$ of the form $z+\text{higher}$ order terms, we give tree expansion formulas and associated algorithms for the D-Log of F and the formal flow F_t.
Wright, David, Zhao, Wenhua
core +2 more sources
Abstract We investigate the effect of logic multiplicity on organizational performance and hypothesize that logics may impact performance in view of their sheer number. We further propose that the market logic embedded in the for‐profit legal form can positively moderate the impact of multiple logics on performance.
Francesca Capo +3 more
wiley +1 more source
The Bernoulli polynomials for natural x were first considered by J.Berno\-ulli (1713) in connection with the problem of summation of the powers of consecutive positive integers. For arbitrary $x$ these polynomials were studied by L.Euler.
O. Shishkina
doaj
Congruences for Bernoulli numbers and Bernoulli polynomials
The Bernoulli numbers and polynomials are defined by \(B_0=1\), \(\sum^{n-1}_{k=0}{n\choose k} B_k= 0\) \((n=2,3,\dots)\) and \(B_n(x)= \sum^n_{k=0}{n\choose k} B_{n-k} x^k\), respectively. Two basic congruences for Bernoulli numbers are the Kummer congruences (used in the theory of Fermat's last theorem) and the von Staudt-Clausen theorem. There exist
openaire +1 more source
Identification and Estimation of Large Network Games with Private Link Information
ABSTRACT We study the identification and estimation of large network games in which individuals choose continuous actions while holding private information about their links and payoffs. Extending the framework of Galeotti et al., we build a tractable empirical model of such network games and show that the parameters in individual payoffs are ...
Hülya Eraslan, Xun Tang
wiley +1 more source
Congruences concerning Bernoulli numbers and Bernoulli polynomials
Let \(B_n(x)\), resp. \(B_n\), denote the classical Bernoulli polynomial, resp. number. In the paper under review the author proves some generalizations of Kummer's congruence by determining \[ \frac{B_{k(p-1)+b}(x)}{(k(p-1)+b)}\pmod{p^n} \] where \(p\) is an odd prime, \(x\) a \(p\)-integral rational number and \(p-1\nmid b\), while Kummer considered ...
openaire +1 more source
A Conversation With David Bellhouse
Summary David Richard Bellhouse was born in Winnipeg, Manitoba, on 19 July 1948. He studied actuarial mathematics and statistics at the University of Manitoba (BA, 1970; MA, 1972) and completed his PhD at the University of Waterloo, Ontario, in 1975. After being an Assistant Professor for 1 year at his alma mater, he joined the University of Western ...
Christian Genest
wiley +1 more source
On the 𝑞-Bernoulli Numbers and Polynomials with Weight 𝜶
We present a systemic study of some families of higher-order 𝑞-Bernoulli numbers and polynomials with weight 𝛼. From these studies, we derive some interesting identities on the 𝑞-Bernoulli numbers and polynomials with weight 𝛼.
T. Kim, J. Choi
doaj +1 more source
Special Numbers and Polynomials Including Their Generating Functions in Umbral Analysis Methods
In this paper, by applying umbral calculus methods to generating functions for the combinatorial numbers and the Apostol type polynomials and numbers of order k, we derive some identities and relations including the combinatorial numbers, the Apostol ...
Yilmaz Simsek
doaj +1 more source

