Related papers: Calculating Greene's function via root polytopes a…
Kim, Kim, and Neggers (2019) defined probability functions on a poset, by listing some very natural conditions that a function \(\pi: P \times P \to [0,1]\) should satisfy in order to capture the intuition of "the likelihood that \(a\)…
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…
Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…
Let $\{b(n):n\in\N\}$ be the sequence of coefficients in the Taylor expansion of a rational function $R(X)\in\Q(X)$ and suppose that b(n) is a perfect $d^{\rm th}$ power for all large n. A conjecture of Pisot states that one can choose a…
A new method for non-perturbative calculation of Green functions in quantum mechanics and quantum field theory is proposed. The method is based on an approximation of Schwinger-Dyson equation for the generating functional by exactly soluble…
In this paper we consider an aggregation model f: X1 x ... x Xn --> Y for arbitrary sets X1, ..., Xn and a finite distributive lattice Y, factorizable as f(x1, ..., xn) = p(u1(x1), ..., un(xn)), where p is an n-variable lattice polynomial…
We develop the theory of weighted P-partitions, which generalises the theory of P-partitions from labelled posets to weighted labelled posets. We define the related generating functions in the natural way and compute their product,…
Homogeneous and inhomogeneous biharmonic equation are considered on the $n$-dimensional unit sphere. The Green function is given as a series of Gegenbauer polynomials. In the paper, explicit representations of the Green function are found…
Given a finite poset $P$, we associate a simple graph denoted by $G_P$ with all connected order ideals of $P$ as vertices, and two vertices are adjacent if and only if they have nonempty intersection and are incomparable with respect to set…
This study is devoted to the polynomial representation of the matrix $p$th root functions. The Fibonacci-H\"orner decomposition of the matrix powers and some techniques arisen from properties of generalized Fibonacci sequences, notably the…
Problems of finite-temperature quantum statistical mechanics can be formulated in terms of imaginary (Euclidean) -time Green's functions and self-energies. In the context of realistic Hamiltonians, the large energy scale of the Hamiltonian…
In this paper, we present a $q$-analogue of the polynomial reduction which was originally developed for hypergeometric terms. Using the $q$-Gosper representation, we describe the structure of rational functions that are summable when…
We examine hypergeometric functions in the finite field, p-adic and classical settings. In each setting, we prove a formula which splits the hypergeometric function into a sum of lower order functions whose arguments differ by roots of…
In this article, we present a combinatorial formula for computing the Wedderburn decomposition of the rational group algebra associated with an ordinary metacyclic $p$-group $G$, where $p$ is any prime. We also provide a formula for…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
In this work we present a three step procedure for generating a closed form expression of the Green's function on both closed and open finite quantum graphs with general self-adjoint matching conditions. We first generalize and simplify the…
The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…
In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…