Related papers: Certain Linear Combinations of Exponential Functio…
The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential…
It is shown by the author in [J. Lie Theory 29:4, 1045-1070, 2019] that for every connected linear complex Lie group the algebra of polynomials (regular functions) is dense in the algebra of holomorphic functions of exponential type.…
The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.
An analogue of Krein's extension theorem is proved for operator-valued positive definite functions on free groups. The proof gives also the parametrization of all extensions by means of a generalized type of Szego parameters. One singles…
In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…
A linear parameter must be consumed exactly once in the body of its function. When declaring resources such as file handles and manually managed memory as linear arguments, a linear type system can verify that these resources are used…
The observational characteristics of a linear structural equation model can be effectively described by polynomial constraints on the observed covariance matrix. However, these polynomials can be exponentially large, making them impractical…
Let X be a locally compact Abelian group. We consider linear forms of independent random variables with values in X. In doing so, one of the coefficients of the linear forms is a random variable with a Bernoulli distribution. For some…
If $f$ is a symmetric complex-valued function on the $m$-fold Cartesian product of the set of non-negative reals and $A$ is a positive semi-definite $m\times m$ matrix with eigenvalues $\lambda_j$, we set…
The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…
This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…
Deciding the positivity of a sequence defined by a linear recurrence and initial conditions is, in general, a hard problem. When the coefficients of the recurrences are constants, decidability has only been proven up to order 5. The…
For finite-dimensional linear semigroups which leave a proper cone invariant it is shown that irreducibility with respect to the cone implies the existence of an extremal norm. In case the cone is simplicial a similar statement applies to…
The notion \emph{Perron-Frobenius theory} usually refers to the interaction between three properties of operator semigroups: positivity, spectrum and long-time behaviour. These interactions gives rise to a profound theory with plenty of…
We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
We exhibit a lower-triangular matrix of polynomials $T(a,c,d,e,f,g)$ in six indeterminates that appears empirically to be coefficientwise totally positive, and which includes as a special case the Eulerian triangle. We prove the…
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…