Discrete and continuous frames can be considered as positive operatorvalued measures (POVMs) that have integral representations using rankone operators. However, not every POVM has an integral representation. One goal of this paper is to examine the POVMs that have finiterank integral representations. More precisely, we present a necessary and sufficient condition under which a positive operatorvalued measure $F: \Omega \to B(H)$ has an integral representation of the form $$F(E) =\sum_{k=1}^{m} \int_{E}\, G_{k}(\omega)\otimes G_{k}(\omega) d\mu(\omega)$$ for some weakly measurable maps $G_{k} \ (1\leq k\leq m) $ from a measurable space $\Omega$ to a Hilbert space $\mathcal{H}$ and some positive measure $\mu$ on $\Omega$. Similar characterizations are also obtained for projectionvalued measures. As special consequences of our characterization we settle negatively a problem of Ehler and Okoudjou about probability frame representations of probability POVMs, and prove that an integral representable probability POVM can be dilated to a integral representable projectionvalued measure if and only if the corresponding measure is purely atomic.
This content will become publicly available on May 21, 2023
On Parseval Frames of Kernel Functions in de Branges Spaces of Entire Vector Valued Functions
We consider the existence and structure properties of Parseval frames of kernel functions in vector valued de Branges spaces. We develop some sufficient conditions for Parseval sequences by identifying the main construction with Naimark dilation of frames. The dilation occurs by embedding the de Branges space of vector valued functions into a dilated de Branges space of vector valued functions. The embedding also maps the kernel functions associated with a frame sequence of the original space into a Riesz basis for the embedding space. We also develop some sufficient conditions for a dilated de Branges space to have the Kramer sampling property.
 Editors:
 Shoikhet, D.; Vajiac, E.
 Publication Date:
 NSFPAR ID:
 10314053
 Journal Name:
 New Directions in Function Theory: From Complex to Hypercomplex to NonCommutative
 Volume:
 286
 Sponsoring Org:
 National Science Foundation
More Like this


Vector space models for symbolic processing that encode symbols by random vectors have been proposed in cognitive science and connectionist communities under the names Vector Symbolic Architecture (VSA), and, synonymously, Hyperdimensional (HD) computing. In this paper, we generalize VSAs to function spaces by mapping continuousvalued data into a vector space such that the inner product between the representations of any two data points represents a similarity kernel. By analogy to VSA, we call this new function encoding and computing framework Vector Function Architecture (VFA). In VFAs, vectors can represent individual data points as well as elements of a function space (a reproducing kernel Hilbert space). The algebraic vector operations, inherited from VSA, correspond to welldefined operations in function space. Furthermore, we study a previously proposed method for encoding continuous data, fractional power encoding (FPE), which uses exponentiation of a random base vector to produce randomized representations of data points and fulfills the kernel properties for inducing a VFA. We show that the distribution from which elements of the base vector are sampled determines the shape of the FPE kernel, which in turn induces a VFA for computing with bandlimited functions. In particular, VFAs provide an algebraic framework for implementing largescalemore »

As the field of Topological Data Analysis continues to show success in theory and in applications, there has been increasing interest in using tools from this field with methods for machine learning. Using persistent homology, specifically persistence diagrams, as inputs to machine learning techniques requires some mathematical creativity. The space of persistence diagrams does not have the desirable properties for machine learning, thus methods such as kernel methods and vectorization methods have been developed. One such featurization of persistence diagrams by Perea, Munch and Khasawneh uses continuous, compactly supported functions, referred to as "template functions," which results in a stable vector representation of the persistence diagram. In this paper, we provide a method of adaptively partitioning persistence diagrams to improve these featurizations based on localized information in the diagrams. Additionally, we provide a framework to adaptively select parameters required for the template functions in order to best utilize the partitioning method. We present results for application to example data sets comparing classification results between template function featurizations with and without partitioning, in addition to other methods from the literature.

Embedding properties of network realizations of dissipative reduced order models Jörn Zimmerling, Mikhail Zaslavsky,Rob Remis, Shasri Moskow, Alexander Mamonov, Murthy Guddati, Vladimir Druskin, and Liliana Borcea Mathematical Sciences Department, Worcester Polytechnic Institute https://www.wpi.edu/people/vdruskin Abstract Realizations of reduced order models of passive SISO or MIMO LTI problems can be transformed to tridiagonal and blocktridiagonal forms, respectively, via dierent modications of the Lanczos algorithm. Generally, such realizations can be interpreted as ladder resistorcapacitorinductor (RCL) networks. They gave rise to network syntheses in the rst half of the 20th century that was at the base of modern electronics design and consecutively to MOR that tremendously impacted many areas of engineering (electrical, mechanical, aerospace, etc.) by enabling ecient compression of the underlining dynamical systems. In his seminal 1950s works Krein realized that in addition to their compressing properties, network realizations can be used to embed the data back into the state space of the underlying continuum problems. In more recent works of the authors Krein's ideas gave rise to socalled nitedierence Gaussian quadrature rules (FDGQR), allowing to approximately map the ROM statespace representation to its full order continuum counterpart on a judicially chosen grid. Thus, the state variables can be accessed directly from themore »

Mixed monotonicity is a property of a system’s vector field that says that the vector field admits a decomposition function, in a lifted space, that has some order preserving properties. It is recently shown that this property allows one to efficiently overapproximate the system’s onestep reachable set with a hyperinterval, which is obtained by evaluating the vector field’s decomposition function at two points. Such decomposition functions are usually not unique and some decompositions may not be tight in the sense that the resulting hyperintervals are not the smallest ones that contain the exact onestep reachable set, which leads to conservative overapproximation. In this paper, we show that for a general class of functions, there exists a tight decomposition, which can be implicitly constructed as the solution of certain optimization problems. This implies that any function from Rn to Rm (hence any forward complete system) is mixedmonotone. However, the usefulness of the constructed tight decomposition functions is limited by the fact that it might not be possible to evaluate them efficiently. We show that under certain conditions, the tight decompositions can reduce to a function with explicit expression, which can be directly evaluated. This result suggests that it is not mixedmore »