Related papers: Computing Green functions in small characteristic

In his classic book on symmetric functions, Macdonald describes a remarkable result by Green relating the character theory of the finite general linear group to transition matrices between bases of symmetric functions. This connection…

We investigate the Green functions G(x,x^{\prime}) of some second order differential operators on R^{d+1} with singular coefficients depending only on one coordinate x_{0}. We express the Green functions by means of the Brownian motion.…

We propose a scheme for the construction of one-particle Green's function (GF) of an interacting electronic system via statistical sampling on a quantum computer. Although the non-unitarity of creation and annihilation operators for the…

Groups definable in simple theories retain the chain conditions and decomposition properties known from stable groups, up to commensurability. In the small case, if a generic type of G is not foreign to some type q, there is a q-internal…

The computation of the cohomology for finite groups of Lie type in the describing characteristic is a challenging and difficult problem. In earlier work, the authors constructed an induction functor which takes modules over the finite group…

The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of $P:=\mathbf{F}[x_n,...,x_1]$, a polyonomial ring over the finite field $\mathbf{F}:=\mathbf{Z}_q$ of $q$…

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

Let $G$ be a finite Chevalley group. We are concerned with computing the values of the unipotent characters of $G$ by making use of Lusztig's theory of character sheaves. In this framework, one has to find the transformation between several…

Green's function plays a significant role in both theoretical analysis and numerical computing of partial differential equations (PDEs). However, in most cases, Green's function is difficult to compute. The troubles arise in the following…

In our previous paper, Green functions associated to complex reflection groups G(e,1,n) were discussed. It involved a combinatorial approach to the Green functions of classical groups of type B_n or C_n. In this paper, we introduce Green…

Recent work by a number of people has shown that complex reflection groups give rise to many representation-theoretic structures (e.g., generic degrees and families of characters), as though they were Weyl groups of algebraic groups.…

The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…

We show that a Green function solution can be given for a class of non-homogeneous nonlinear systems having relevance in quantum field theory. This in turn means that a quantum field theory in the strong coupling limit can be formulated and…

We determine the Lusztig restrictions on the space of class functions with a unipotent support on a finite reductive group. In particular we give a simple expression for the Lusztig restrictions of the generalized Green functions and we…

Let ${\mathbb{G}}$ be a simply connected ${\mathbb{Z}}_\ell$-spets, let $q$ be a prime power, prime to $\ell$ and let $S$ be the underlying Sylow $\ell$-subgroup. Firstly, motivated by known formulae for values of Deligne-Lusztig characters…

In this paper, we summarize the technique of using Green functions to solve electrostatic problems. We start by deriving the electric potential in terms of a Green function and a charge distribution. We then provide a variety of example…

Recently, general point interactions in one dimension has been used to model a large number of different phenomena in quantum mechanics. Such potentials, however, requires some sort of regularization to lead to meaningful results. The usual…

We show that for fields that are of characteristic 0 or algebraically closed of characteristic greater than 5, that certain classes of Leibniz algebras are 2-recognizeable. These classes are solvable, strongly solvable and super solvable.…

In this article we use linear algebra to improve the computational time for the obtaining of Green's functions of linear differential equations with reflection (DER). This is achieved by decomposing both the `reduced' equation (the ODE…

For a group $G$ acting over a set $X$, the set of all the $G$-equivariant functions, i.e., the set of functions which conmute with the action, ($g\cdot f(x)=g\cdot f(x), \forall g\in G, \forall x\in X$), is a monoid with the composition.…