Related papers: Generalized Green functions and unipotent classes …
When one tries to take into account the non-trivial vacuum structure of Quantum Field Theory, the standard functional-integral tools such as generating functionals or transitional amplitudes, are often quite inadequate for such purposes.…
In this paper, we prove an averaged version of an algebraicity conjecture in \cite{GKZ87} concerning the values of higher Green's function at CM points. Furthermore, we give the factorization of the ideal generated by such algebraic value…
We consider various collections of functions from the Baire space X into itself naturally arising in (effective) descriptive set theory and general topology, including computable (equivalently, recursive) functions, contraction mappings,…
We show that cluster algorithms for quantum models have a meaning independent of the basis chosen to construct them. Using this idea, we propose a new method for measuring with little effort a whole class of Green's functions, once a…
In this work we develop an algebraic theory of linear recurrence equations and systems with constant coefficients and reflection. We obtain explicit solutions and the Green's functions associated to different problems under general linear…
Lusztig proved the compatibility of induction functors and restriction functors for Lusztig's perverse sheaves. Fang-Lan-Xiao established a categorification of Green's formula and gave a sheaf-level proof of this compatibility for all…
The lattice computation of the one-particle irreducible ghost-gluon Green function in the Landau gauge is revisited with a set of large gauge ensembles. The large statistical ensembles enable a precise determination of this Green function…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
In this note, I would like to discuss an approach to the construction of Green's function on algebraic surfaces, indicated by Manin, towards the computation of the Green's function on surfaces using Schottky uniformization. We shall see…
The Green's function method is recognized to be a very powerful tool for modelling quantum transport in nanoscale electronic devices. As atomistic calculations are generally expensive, numerical methods and related algorithms have been…
We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.
In this paper we develop the functional calculus for elliptic operators on compact Lie groups without the assumption that the operator is a classical pseudo-differential operator. Consequently, we provide a symbolic descriptions of complex…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
In this paper we prove a uniform estimate for the gradient of the Green function on a closed Riemann surface, independent of its conformal class, and we derive compactness results for immersions with L2-bounded second fundamental form and…
The thermal Euclidean Green functions for Photons propagating in the Rindler wedge are computed employing an Euclidean approach within any covariant Feynman-like gauge. This is done by generalizing a formula which holds in the Minkowskian…
Green's function methods lead to ab initio, systematically improvable simulations of molecules and materials while providing access to multiple experimentally observable properties such as the density of states and the spectral function.…
An iterative formula for the Green polynomial is given using the vertex operator realization of the Hall-Littlewood function. Based on this, (1) a general combinatorial formula of the Green polynomial is given; (2) several compact formulas…
From perturbation theory, Green's functions are known for providing a simple and convenient access to the (complete) spectrum of atoms and ions. Having these functions available, they may help carry out perturbation expansions to any order…
We show that the definition of unipotent (resp. nilpotent) pieces for classical groups given by Lusztig (resp. Lusztig and the author) coincides with the combinatorial definition using closure relations on unipotent classes (resp. nilpotent…