arXiv subjects

Philip Feinsilver

Publications and source records attributed to Philip Feinsilver.

14 recordsLinked to original sources

arXiv2021

Canonical Polynomial Sequences: Inverse Pairs

For $V(z)$, analytic in a neighborhood of $0\in\mathbb{C}$, $V(0) = 0$, $V'(0)\ne0$, there is an associated sequence of polynomials, \textsl{canonical polynomials}, that is a generalized Appell sequence with lowering operator $V(d/dx)$. Correspondingly, the inverse function $Z(v)$ has an associated canonical polynomial sequence. The coefficients of the two sequences form two mutually inverse infinite matrices. We detail the operator calculus for the pair of systems, illustrating the duality of operators and variables between them. Examples are presented including a connection between Gegenbauer and Bessel polynomials. Touchard polynomials appear as well. Alternative settings would include an umbral calculus approach as well as the Riordan group. Here we use the approach through operator calculus.

math.FA↗

arXiv2020

Spectral Theorem approach to the Characteristic Function of Quantum Observables

Using the spectral theorem we compute the Quantum Fourier Transform (or Vacuum Characteristic Function) $\langle Φ, e^{itH}Φ\rangle$ of an observable $H$ defined as a self-adjoint sum of the generators of a finite-dimensional Lie algebra, where $Φ$ is a unit vector in a Hilbert space $\mathcal{H}$. We show how Stone's formula for computing the spectral resolution of a Hilbert space self-adjoint operator, can serve as an alternative to the traditional reliance on splitting (or disentanglement) formulas for the operator exponential.

math-ph↗

arXiv2017

Quantum Observables on a Completely Simple Semigroup

Completely simple semigroups arise as the support of limiting measures of random walks on semigroups. Such a limiting measure is supported on the kernel of the semigroup. Forming tensor powers of the random walk leads to a hierarchy of the limiting kernels. Tensor squares lead to quantum observables on the kernel. Recall that zeons are bosons modulo the basis elements squaring to zero. Using zeon powers leads naturally to quantum observables which reveal the structure of the kernel. Thus asymptotic information about the random walk is related to algebraic properties of the zeon powers of the random walk.

math.RA↗

arXiv2017

Zeons, Permanents, the Johnson scheme, and Generalized Derangements

Starting with the zero-square "zeon algebra" the connection with permanents is shown. Permanents of sub-matrices of a linear combination of the identity matrix and all-ones matrix leads to moment polynomials with respect to the exponential distribution. A permanent trace formula analogous to MacMahon's Master Theorem is presented and applied. Connections with permutation groups acting on sets and the Johnson association scheme arise. The families of numbers appearing as matrix entries turn out to be related to interesting variations on derangements. These generalized derangements are considered in detail as an illustration of the theory.

math.CO↗

arXiv2016

Krawtchouk-Griffiths Systems II: As Bernoulli Systems

We call Krawtchouk-Griffiths systems, KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial distribution. Here we present a Fock space construction with raising and lowering operators. The operators of "multiplication by X" are found in terms of boson operators and corresponding recurrence relations presented. The Riccati partial differential equations for the differentiation operators, Berezin transform and associated partial differential equations are found. These features provide the specifications for a Bernoulli system as a quantization formulation of multivariate Krawtchouk polynomials.

math.PR↗

arXiv2016

Krawtchouk-Griffiths Systems I: Matrix Approach

We call Krawtchouk-Griffiths systems, or KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial distribution. Our approach is to work directly with matrices comprising the values of the polynomials at points of a discrete grid based on the possible counting values of the underlying multinomial distribution. The starting point for the construction of a KG-system is a generating matrix satisfying the K-condition, orthogonality with respect to the basic probability distribution associated to an individual step of the multinomial process. The variables of the polynomials corresponding to matrices may be interpreted as quantum observables in the real case, or quantum variables in the complex case. The structure of the recurrence relations for the orthogonal polynomials is presented with multiplication operators as the matrices corresponding to the quantum variables. An interesting feature is that the associated random walks correspond to the Lie algebra of the representation of symmetric tensor powers of matrices.

math.RT↗

arXiv2016

Sums of squares of Krawtchouk polynomials, Catalan numbers, and some algebras over the Boolean lattice

Writing the values of Krawtchouk polynomials as matrices, we consider weighted partial sums along columns. For the general case, we find an identity that, in the symmetric case yields a formula for such partial sums. Complete sums of squares along columns involve "Super Catalan" numbers. We look as well for particular values (matrix entries) involving the Catalan numbers. Properties considered and developed in this work are applied to calculations of various dimensions that describe the structure of some *-algebras over the Boolean lattice based on inclusion/superset relations expressed algebraically using zeons [zero-square elements].

math.RA↗

arXiv2014

Krawtchouk transforms and Convolutions

We put together the ingredients for an efficient operator calculus based on Krawtchouk polynomials, including Krawtchouk transforms and corresponding convolution structure which provide an inherently discrete alternative to Fourier analysis. In this paper, we present the theoretical aspects and some basic examples.

math.FA↗

arXiv2011

On Krawtchouk Transforms

Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus formulation of the Krawtchouk transform that is suitable for computer implementation. A positivity result for the Krawtchouk transform is shown. Then our approach is compared with the use of the Krawtchouk transform in coding theory where it appears in MacWilliams' and Delsarte's theorems on weight enumerators. We conclude with a construction of Krawtchouk polynomials in an arbitrary finite number of variables, orthogonal with respect to the multinomial distribution.

cs.IT↗

arXiv2011

Representations of sl(2) in the Boolean lattice, and the Hamming and Johnson schemes

Starting with the zero-square "zeon algebra", the regular representation gives rise to a Boolean lattice representation of sl(2). We detail the su(2) content of the Boolean lattice, providing the irreducible representations carried by the algebra generated by the subsets of an n-set. The group elements are found, exhibiting the "special functions" in this context. The corresponding Leibniz rule and group law are shown. Krawtchouk polynomials, the Hamming and the Johnson schemes appear naturally. Applications to the Boolean poset and the structure of Hadamard-Sylvester matrices are shown as well.

math.CO↗

arXiv2009

The Generalized Road Coloring Problem and periodic digraphs

A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman's algorithm. Algebraic properties of periodic, strongly connected digraphs are studied in the semigroup context. An algebraic condition which characterizes periodic, strongly connected digraphs is determined in the context of periodic Markov chains.

math.CO↗

arXiv2007

Zeon Algebra, Fock Space, and Markov Chains

Fock spaces over zeons are introduced. Trace identities and a noncommutative "integration-by-parts" formula are developed. As an application, we find a new criterion, without involving powers of the transition matrix, for a Markov chain to be ergodic.

math-ph↗

arXiv2007

Krawtchouk matrices from classical and quantum random walks

Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic properties of these matrices provide a very interesting and accessible example in the approach to probability theory known as quantum probability. First it is noted how the Krawtchouk matrices are connected to the classical symmetric Bernoulli random walk. And we show how to derive Krawtchouk matrices in the quantum probability context via tensor powers of the elementary Hadamard matrix. Then connections with the classical situation are shown by calculating expectation values in the quantum case.

quant-ph↗

arXiv2007

Krawtchouk polynomials and Krawtchouk matrices

Krawtchouk matrices have as entries values of the Krawtchouk polynomials for nonnegative integer arguments. We show how they arise as condensed Sylvester-Hadamard matrices via a binary shuffling function. The underlying symmetric tensor algebra is presented. Our approach is used to solve Kac' formulation of the Ehrenfest urn model. Connections with quantum and classical random walks are shown as well as various extensions of the classical polynomials.

quant-ph↗