Related papers: Generalized Green functions and unipotent classes …

We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…

In this paper we prove the basic facts for pluricomplex Green functions on manifolds. The main goal is to establish properties of complex manifolds that make them analogous to relatively compact or hyperconvex domains in Stein manifolds.…

We consider the quantum partition function for a system of quantum spinors and then derive an equivalent (or dual) classical partition function for some scalar degrees of freedom. The coupling between scalars is non-trivial (e.g. a model on…

Using the functor of Baumslag rationalization of groups we construct a functor on the category of all (non necessarily simply connected) spaces that extends the classical rationalization of simply connected spaces. We study this functor and…

Alesker's theory of generalized valuations unifies smooth measures and constructible functions on real analytic manifolds, extending classical operations on functions and measures. Alesker showed that these operations agree with the…

We prove a Faa di Bruno formula for the Green function in the bialgebra of P-trees, for any polynomial endofunctor P. The formula appears as relative homotopy cardinality of an equivalence of groupoids.

Using Lusztig's geometric classification, we find the reducibility points of a standard module for the affine Hecke algebra, in the case when the inducing data is generic. This recovers the known result of Muic-Shahidi for representations…

We construct Green's function for second order elliptic operators of the form $Lu=-\nabla \cdot (\mathbf{A} \nabla u + \boldsymbol{b} u)+ \boldsymbol c \cdot \nabla u+ du$ in a domain and obtain pointwise bounds, as well as Lorentz space…

We show that probabilistic computable functions, i.e., those functions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene's partial recursive…

Summation formulas are obtained for products of associated Lagurre polynomials by means of the Green's function K for the Hamiltonian H = -{d^2\over dx^2} + x^2 + Ax^{-2}, A > 0. K is constructed by an application of a Mercer type theorem…

We provide an explicit characterization of the properties of primitive recursive functions that are decidable or semi-decidable, given a primitive recursive index for the function. The result is much more general as it applies to any c.e.…

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…

A explicit formula on semiclassical Green functions in mixed position and momentum spaces is given, which is based on Maslov's multi-dimensional semiclassical theory. The general formula includes both coordinate and momentum representations…

For families of smooth complex projective varieties we show that normal functions arising from algebraically trivial cycle classes are algebraic, and defined over the field of definition of the family. In particular, the zero loci of those…

In this Brief Report, we present an algorithm for calculating the elastic Lattice Greens Function of a regular lattice, in which defects are created by removing lattice points. The method is computationally efficient, since the required…

Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…

Arithmetic Kleinian groups are arithmetic lattices in PSL_2(C). We present an algorithm which, given such a group Gamma, returns a fundamental domain and a finite presentation for Gamma with a computable isomorphism.

We construct indecomposable cycles in the motivic cohomology group $H^3_{{\mathcal M}}(A,{\mathbb Q}(2))$ where $A$ is an Abelian surface over a number field or the function field of a base. When $A$ is the self product of the universal…

Uniform $L^1$ and lower bounds are obtained for the Green's function on compact K\"ahler manifolds. Unlike in the classic theorem of Cheng-Li for Riemannian manifolds, the lower bounds do not depend directly on the Ricci curvature, but only…