Related papers: Sampling in paley-wiener spaces on combinatorial g…
Paley-Wiener theorem for frames for Hilbert spaces, Banach frames, Schauder frames and atomic decompositions for Banach spaces are known. In this paper, we derive Paley-Wiener theorem for p-approximate Schauder frames for separable Banach…
An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence…
The Fourier coefficients F(t) of a function f on a compact symmetric space U/K are given by integration of f against matrix coefficients of irreducible representations of U. The coefficients depend on a spectral parameter t, which…
Homogeneous spaces are de Branges' Hilbert spaces of entire functions with the property that certain weighted rescaling transforms induce isometries of the space into itself. A classical example of a homogeneous space is the Paley-Wiener…
Here we give a new approach to the Paley--Wiener theorem in a Mellin analysis setting which avoids the use of the Riemann surface of the logarithm and analytical branches and is based on new concepts of "polar-analytic function" in the…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…
We establish a characterization of the Hardy spaces on the homogeneous groups in terms of the Littlewood-Paley functions. The proof is based on vector-valued inequalities shown by applying the Peetre maximal function.
The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like representation termed parse tree or cotree. In this paper,…
We consider the Weyl quantization on a flat non-standard symplectic vector space. We focus mainly on the properties of the Wigner functions defined therein. In particular we show that the sets of Wigner functions on distinct symplectic…
The family of visibility algorithms were recently introduced as mappings between time series and graphs. Here we extend this method to characterize spatially extended data structures by mapping scalar fields of arbitrary dimension into…
Graphs are used to represent and analyze data in domains as diverse as physics, biology, chemistry, planetary science, and the social sciences. Across domains, random graph models relate generative processes to expected graph properties,…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…
Continuing the analysis in a unified scheme for treating generalized superselection sectors based upon the notion of selection criteria for states of relevance in quantum physics, we extend the Doplicher-Roberts superselection theory for…
We use Seiberg--Witten-like relations in the topological recursion framework to obtain virtual Euler characteristics for uni- and multicellular maps for ensembles of classic orthogonal polynomials and for ensembles related to nonorientable…
Graph vertex sampling set selection aims at selecting a set of ver-tices of a graph such that the space of graph signals that can be reconstructed exactly from those samples alone is maximal. In this context, we propose to extend sampling…
New identities on traces of representations of the Hecke algebra on the spaces of paths on graphs are presented. These identities are relevant in the computation of partition functions with fixed boundary conditions and of two-point…
This paper establishes Paley-Wiener perturbation theorems for probabilistic frames. The classical Paley-Wiener perturbation theorem shows that if a sequence is close to a basis in a Banach space, then this sequence is also a basis. Similar…
A set $W\subseteq V(G)$ is called a resolving set, if for each two distinct vertices $u,v\in V(G)$ there exists $w\in W$ such that $d(u,w)\neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$…