
	Where results make sense

Topic: Generalized Appell polynomials

In the News (Fri 17 Feb 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Sheffer sequence - Wikipedia, the free encyclopedia
		Two important subgroups are the group of Appell sequences, which are those sequences for which the operator Q is differentiation, and the group of sequences of binomial type, which are those that satisfy the identity
		The group of Appell sequences is abelian; the group of sequences of binomial type is not.
		The group of Appell sequences is a normal subgroup; the group of sequences of binomial type is not.
	en.wikipedia.org /wiki/Sheffer_sequence (437 words)

	GI (Site not responding. Last check: 2007-10-16)
		Generalized inverses and the maximal radius of regularity of a Fredholm operator.
		The maximum and minimum of a positive definite quadratic polynomial on a sphere are convex functions of the radius.
		On a generalization of an inequality of L. Kantorovich.
	www.math.temple.edu /~szyld/iic/GI.html (4148 words)

	[No title]
		The behavior of this Appell polynomials in the interval $(-1, 1)$ and outside the interval $(-1, 1)$ could also be studied.
		When defining Appell polynomials, it is important to add an additional condition, due to the constants which arise in the equations.
		The algorithm \emph{appelPoly(f,x,a,b,n),} where $(f,x)$ is a function of bounded variation and the variables $a$ and $b$ are the lower and upper limits of integration, and $n$ is the degree of the polynomials, computes the general Appell polynomials for a given function of bounded variation.
	www.maths.tcd.ie /EMIS/journals/EJDE/Volumes/Monographs/Monographs/Volumes/conf-proc/07/a1/alkahby-tex (2309 words)

	Generalized Appell polynomials - Wikipedia, the free encyclopedia
		results in the Sheffer sequence of polynomials, which include the general difference polynomials, such as the Newton polynomials.
		The generalized Appell polynomials have the explicit representation
		Huff, The type of the polynomials generated by f(xt) φ(t) (1947) Duke Mathematical Journal, 14 pp 1091-1104.
	en.wikipedia.org /wiki/Generalized_Appell_polynomials (259 words)

	Encyclopedia :: encyclopedia : Generalized game (Site not responding. Last check: 2007-10-16)
		In computational complexity theory, a generalized game is a game that has been generalized so that it can be played on a board of any size.
		For many generalized games which last for a number of moves polynomial in the size of the board, the problem of determining if there is a win for the first player in a given position is PSPACE-complete.
		For many generalized games which may last for a number of moves exponential in the size of the board, the problem of determining if there is a win for the first player in a given position is EXPTIME-complete.
	www.hallencyclopedia.com /Generalized_game (177 words)

	Search Results for polynomial*
		Polynomial approximation was neither discovered nor invented by J L Walsh (which may come as a surprise to some mathematicians).
		A polynomial time method in the length of the input n would be an algorithm which took time bounded by a fixed power of log n (the length of the input).
		This is tantamount to saying that the system of numbers and the system of polynomials have a common structure; and when once this fact is recognized it is a natural step to undertake the study of an abstract system whose nature is unspecified beyond the fact that it has this particular structure.
	www-groups.dcs.st-and.ac.uk /~history/Search/historysearch.cgi?SUGGESTION=polynomial*&CONTEXT=1 (6978 words)

	Springer Online Reference Works
		Bernoulli polynomials belong to the class of Appell polynomials, i.e.
		Bernoulli polynomials are employed to express the residual term of the Euler–MacLaurin formula, and for the expansion of functions into series.
		Bernoulli polynomials are employed in the integral representation of differentiable periodic functions
	eom.springer.de /B/b015650.htm (277 words)

	Publications
		A generalization of the ultraspherical polynomials, joint with R. Askey, in “Studies in Pure Mathematics,” P. Erdös (ed.), Birkhauser Verlag, Basel, 1983, pp.
		On sieved orthogonal polynomials I: Symmetric Pollaczek analogues, SIAM J. Math.
		On sieved orthogonal polynomials VI: Differential equations, joint with J. Bustoz and J. Wimp, Differential and Integral Equations 3 (1990), 757-766.
	www.math.ucf.edu /~ismail/publications.html (3887 words)

	Generating function - ExampleProblems.com
		The particular generating function that is most useful in a given context will depend upon the nature of the sequence and the details of the problem being addressed.
		Generating functions are often expressed in closed form as functions of a formal argument x.
		However, it must be remembered that generating functions are formal power series, and they will not necessarily converge for all values of x.
	www.exampleproblems.com /wiki/index.php?title=Generating_function&printable=yes (583 words)

	Generalizations of the umbral calculus
		The umbral calculus of [107] is restricted to the class of Sheffer polynomials.
		Viskov first extended the umbral calculus to so-called generalized Appell polynomials (or Boas-Buck polynomials) [129] and then went on to generalize this to arbitrary polynomials [130].
		Later, in [60], a theory was discovered which generalized simultaneously Roman and Rota's umbral calculi by embedding them in a logarithmic algebra containing both positive and negative powers of x, and logarithms.
	www.win.tue.nl /~sandro/hypersurvey/node10.html (505 words)

	Publications and other projects
		Abstract: Free Sheffer polynomials are a polynomial family in non-commuting variables with a resolvent-type generating function.
		Abstract: Given a basis for a polynomial ring, the coefficients in the expansion of a product of some of its elements in terms of this basis are called linearization coefficients.
		For the free Appell polynomials, a number of combinatorial and "diagram" formulas are proven, such as the formulas for their linearization coefficients.
	www.math.tamu.edu /~michael.anshelevich/pop.html (1677 words)

	3 PUBLICATIONS AND EDITING ACTIVITIES
		In this paper, it is shown, in the general case, that a multiple causes death model is equivalent to a competing independent risks model.
		Martingales arguments generalizing results of Stute and Wang (1993) are used to show the almost sure convergence of simple functionals of the predictable hazard measures and of the distributions of the latent or ''fictitious'' independent risks.
		When the observations are generated according to the classical double censoring model introduced by Turnbull (1974), the productlimit estimators represent close upper and lower bounds for Turnbull's estimator.
	www.stat.ucl.ac.be /ISrapport/rap01/rap2001/node4.html (6629 words)

	Citebase - Appell polynomials and their relatives (Site not responding. Last check: 2007-10-16)
		We show that stochastic processes with linear conditional expectations and quadratic conditional variances are Markov, and their transition probabilities are related to a three-parameter family of orthogonal polynomials which generalize the Meixner polynomials.
		Given a basis for a polynomial ring, the coefficients in the expansion of a product of some of its elements in terms of this basis are called linearization coefficients.
		In this paper we investigate the properties of the free Sheffer systems, which are certain families of martingale polynomials with respect to the free Levy processes.
	www.citebase.org /cgi-bin/citations?id=oai:arXiv.org:math/0311043 (1522 words)

	Notes - Broken Time Symmetry
		That's why we want to study more carefully the 'morphism' between the two 'representations': it may illuminate the general principles that underlie the transition from particle to stat mech viewpoints, and in particular, the exact nature of the 'loss' of information in the statistical viewpoint.
		The Bernoulli polynomials have a dual that is quite completely different: some generalized functions.
		So, once we found that the right eigenstates in 3.5.1 were Bernoulli polynomials, then we should have 'known' the result of 3.5.2: the 'dual' of a Bernoulli polynomial is given by the generalized functions that make the Euler-Maclaurin series possible.
	linas.org /theory/time-sym.html (910 words)

	[No title]
		A shift-invariant operator for univariate polynomials involves d and x, whereas a shift-invariant operator for multivariate polynomials involves the partial derivatives d[i] and the given variables xi.
		Otherwise, the expansion theorem expresses the answer in terms of the basic sequence for Q. This is calculated by use of the function bfo, and the optional arguments are passed to bfo.
		The result is the matrix expressing the polynomials in ps in terms of the polynomials in qs.
	www.cstp.umkc.edu /public/papers/place/maple/share/Umbral/Umbral.mhp (2760 words)

	The World of Generating Functions and Umbral Calculus
		The idea of a generating function is a powerful tool by which one may calculating the many sequences (even tables) of numbers which arise in combinatorics.
		The incidence algebra is a generalization of the algebra of upper triangular matrices.
		However, Further generalizations surely remain to be found, since for the moment a great part of the theory of orthogonal polynomials is outside of the scope of any of the current generalizations of the umbral calculus.
	pear.math.pitt.edu /mathzilla/Examples/genfn.xml (3632 words)

	v5n2
		In this paper, we analyze the property concerning to the conjugate of its new divergence and derive some properties of the sequence of convex functions, which is generated by the transformation obtained from the conjugate of its divergence.
		The sharpest bound is in terms of the one norm of the Appell polynomial which constitutes the coefficients of the derivative of the function to be approximated.
		In this article, with the help of concept of the harmonic sequence of polynomials, the well known Hermite-Hadamard's inequality for convex functions is generalied to the cases with bounded derivatives of n-th order, including the so-called n-convex functions, from which Hermite-Hadamard's inequality is extended and refined.
	rgmia.vu.edu.au /v5n2.html (952 words)

	Long-range dependence and Appell rank, Donatas Surgailis
		We show in all three cases that the limit distribution of $S^(G)_N$ is determined by the Appell rank of $G(x)$, or the lowest $k\geq 0$ such that $a_k = \partial^k E\{G(X_0+c)\}/\partial c^k_{c=0 \not= 0$.
		Giraitis,L. and Surgailis,D. Multivariate Appell polynomials and the central limit theorem.
		Giraitis,L. and Taqqu,M. Limit theorems for bivariate Appell polynomials I: Central limit theorems.
	projecteuclid.org /Dienst/UI/1.0/Display/euclid.aop/1019160127 (320 words)

	Generalized Appell Systems - Kondratiev, Silva, Streit (ResearchIndex) (Site not responding. Last check: 2007-10-16)
		Contents 1 Introduction 3 2 General theory 5 2.1 Some facts on nuclear triples : : : : : : : : : : : : : : : : : : : 5 2.2 Holomorphy on locally convex spaces : : : : : : : : : : : : : : 6...
		On Regular Generalized Functions in White Noise Analysis and..
		2 A biorthogonal analogy of the Hermite polynomials and the in..
	citeseer.ist.psu.edu /kondratiev97generalized.html (708 words)

	A Simpler Characterization of Sheffer Polynomials
		We illustrate this with three examples: the Hermite polynomials, the Laguerre polynomials and the Bernoulli polynomials of the second kind.
		of equation 4 are generalized translation operators in the sense of Levitan (see [8]).
		In [8], Levitan also gives a systematic exposition of the relation between generalized translation operators and Cauchy problems (i.e, partial differential equations with initial data).
	wam.inrialpes.fr /software/demos/Sheffer.html (1185 words)

	24 Oct History: This Date (Site not responding. Last check: 2007-10-16)
		General Don Carlos Buell is replaced because of his ineffective pursuit of the Confederates after the Battle of Perryville, Kentucky, on October 8.
		In November 1861, General George McClellan recommended Buell to replace William T. Sherman as commander of the Department of the Ohio.
		In 1880 Appell defined a series of functions satisfying the condition that the derivative of the nth function is n times the (n - 1)th function.
	www.jcanu.hpg.ig.com.br /history/h4oct/h4oct24.html (11138 words)

	Murad S. Taqqu -- Articles
		``Convergence in distribution of sums of bivariate Appell polynomials with long-range dependence'' (with Norma Terrin).
		``Wavelets, generalized white noise and fractional integration: the synthesis of fractional Brownian motion'' (with Yves Meyer and Fabrice Sellan).
		``Generators of long-range dependent processes: A survey'' (with Jean-Marc Bardet, Gabriel Lang, Georges Oppenheim and Anne Philippe).
	math.bu.edu /people/murad/articles.html (3537 words)

	December 1999 New Acquisitions
		Stochastic overlapping generations models, market structure and optimality.
		Enforceable contracts under generalized information of the court.
		Generic full information revelation and finiteness of equilibria in Bayesian games.
	www.econ.umn.edu /~econlib/gfrdec99.html (2553 words)

	Abstracts Wavelets 2003 (Site not responding. Last check: 2007-10-16)
		Generalized wavelets and wavelets on manifolds (spatio-temporal, sphere)
		Abstract: The modelling of thermoelastic effects and phase transition generated in steel C 1080 produced by cooling is presented.
		The talk assumes no specialized background and is accessible to a general audience.
	free.hostdepartment.com /j/jam2kp1/abstracts.htm (1458 words)

	Curriculum Vitae (Site not responding. Last check: 2007-10-16)
		A note on generalized Appell polynomials (with J. Goldberg), American Mathematical Monthly, vol.
		Generalized Appell connection sequences (with J. Goldberg), Journal of Mathematical Analysis and Applications, vol.
		Generalized Appell connection sequences II, Journal of Mathematical Analysis and Applications, vol.
	www-personal.umd.umich.edu /~jwbrown/vita.htm (429 words)

	v6n1
		In this article, a generalisation of Sard's inequality for Appell polynomials is obtained.
		In this paper, we establish some generalizations of weighted trapezoid inequality for mappings of bounded variation, and give several applications for r-moment, the expectation of a continuous random variable and the Beta mapping.
		We give an elementary proof for an inequality involving the generalized elementary symmetric means.
	rgmia.vu.edu.au /v6n1.html (750 words)

	Claude Lefevre (Site not responding. Last check: 2007-10-16)
		For the generalized D/M/1queue, the length T of the first busy period is viewed as the time of first-crossing of a Poisson trajectory with a given upper boundary.
		The distribution of T, which is continuous, can then be expressed elegantly in terms of Appell polynomials.
		For the generalized M/D/1queue (possibly with arrivals by batches), the length T is the time of first-crossing of a Poisson trajectory (resp.
	eudoxos.math.uoa.gr /~web/confer/statconference/abstrct/lefevr.htm (128 words)

	Polynomial sequence - Wikipedia, the free encyclopedia
		In mathematics, a polynomial sequence is a sequence of polynomials indexed by the nonnegative integers 0, 1, 2, 3,..., in which each index is equal to the degree of the corresponding polynomial.
		Various special polynomial sequences are known by eponyms; among these are:
		This page was last modified 08:09, 14 May 2006.
	en.wikipedia.org /wiki/Polynomial_sequence (75 words)

	[No title] (Site not responding. Last check: 2007-10-16)
		Below are some titles of the reports related to orthogonal polynomials, special functions and integral transforms.
		Prizva, Generalization of classical orthogonal polynomials of discrete variable E.
		Manzyi, Decomposition of the ratio of Appell hypergeometric functions F_3 into the ramified chain fraction The 8th Conference is to be held in May 2000.
	www.math.yorku.ca /~muldoon/siamopsf/reports/krav.html (267 words)

	Statistics (Site not responding. Last check: 2007-10-16)
		A connection of polynomials of binomial type with renewal sequences can be found in [113].
		Probabilistic aspects of Lagrange inversion and polynomials of binomial type can be found in [115].
		Various probabilistic representations of Sheffer polynomials can be found in [22].
	www.win.tue.nl /~sandro/hypersurvey/node5.html (151 words)

Try your search on: Qwika (all wikis)