Related papers: Uniform convergence of hypergeometric series
In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…
We propose to study the tropical geometry specifically arising from convergent Hahn series in multiple indeterminates. One application is a new view on stable intersections of tropical hypersurfaces. Another one is perturbations of rank one…
This paper is concerned with the homogenization of Dirichlet problem of elliptic systems in a bounded, smooth domain of finite type. Both the coefficients of the elliptic operator and the Dirichlet boundary data are assumed to be periodic…
We show that the Heun confluent equation admits infinitely many solutions in terms of the confluent generalized hypergeometric functions. For each of these solutions a characteristic exponent of a regular singularity of the Heun confluent…
Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms are of…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler…
In the uniformity testing task, an algorithm is provided with samples from an unknown probability distribution over a (known) finite domain, and must decide whether it is the uniform distribution, or, alternatively, if its total variation…
This article describes the REDUCE package ZEILBERG implemented by Gregor St\"olting and the author. The REDUCE package ZEILBERG is a careful implementation of the Gosper and Zeilberger algorithms for indefinite, and definite summation of…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
This paper investigates the geometric constraints imposed on a domain by overdetermined problems for partial differential equations. Serrin's symmetry results are extended to overdetermined problems with potentially degenerate ellipticity…
We consider the Dirichlet problem for elliptic systems with periodically distributed inclusions whose conduction parameter exhibits a significant contrast compared to the background media. We develop a unified method to quantify the…
A finite-dimensional Hilbert space is usually described in terms of an orthonormal basis, but in certain approaches or applications a description in terms of a finite overcomplete system of vectors, called a finite tight frame, may offer…
In this paper we establish existence, nonexitence and regularity of positive solutions for a class of singular quasilinear elliptic systems subject to (super-) homogeneous condition. The approach is based on sub-supersolution methods for…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
We apply verified numerics to the Nirenberg problem, proving that a genuine solution exists near two given computer-generated approximate solutions. This proves existence of a solution for a particular prescribed curvature that was…
We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…
We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of…
We further investigate the uniform regularity property of collections of sets via primal and dual characterizing constants. These constants play an important role in determining convergence rates of projection algorithms for solving…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…