Related papers: An Iterated Map for the Lebesgue Identity
Using the theory of quasiconformal mappings, we simplify the proof of the recent result by Taylor and Totik (see IMA Journal of Numerical Analysis 30 (2010) 462--486) on the behavior of the Lebesgue constants for interpolation points on a…
For large order, Laguerre polynomials can be approximated by Bessel functions near the origin. This can be used to turn many Laguerre identities into corresponding identities for Bessel functions. We will illustrate this idea with a number…
Iterative methods based on matrix splittings are useful in solving large sparse linear systems. In this direction, proper splittings and its several extensions are used to deal with singular and rectangular linear systems. In this article,…
We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon's combinatorial generalization of the Rogers-Ramanujan…
Iterated loop algebras are by definition obtained by repeatedly applying the loop construction, familiar from the theory of affine Kac-Moody Lie algebras, to a given base algebra. Our interest in this iterated construction is motivated by…
We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
This text grew out of notes I have used in teaching a one quarter course on integration at the advanced undergraduate level. My intent is to introduce the Lebesgue integral in a quick, and hopefully painless, way and then go on to…
We introduce a novel notion of pasting shapes for iterated Segal spaces which classify particular arrangements of composing cells in d-uple Segal spaces. Using this formalism, we then continue to prove a pasting theorem for these iterated…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.
Lebesgue curve is a space-filling curve that fills the unit square through linear interpolation. In this study, we generalise Lebesgue's construction to generate space-filling curves from any given planar substitution satisfying a mild…
We give an extension of Sister Celine's method of proving hypergeometric sum identities that allows it to handle a larger variety of input summands. We then apply this to several problems. Some give new results, and some reprove already…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
We use computer algebra to demonstrate the existence of a multilinear polynomial identity of degree 8 satisfied by the bilinear operation in every Lie-Yamaguti algebra. This identity is a consequence of the defining identities for…
We consider Lagrange interpolation on the set of finitely many intervals. This problem is closely related to the least deviating polynomial from zero on such sets. We will obtain lower and upper estimates for the corresponding Lebesgue…
In this paper we generalize notions of iterated integral with regard to an unpredictable process. We establish a formula of integration by parts, the existence of a continuous modification and give an expression of the increasing process.
Set similarity search is a problem of central interest to a wide variety of applications such as data cleaning and web search. Past approaches on set similarity search utilize either heavy indexing structures, incurring large search costs…
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…