Related papers: Sampling in paley-wiener spaces on combinatorial g…
An analog of the Paley-Wiener isomorphism for the Hardy space with an invariant measure over infinite-dimensional unitary groups is described. This allows us to investigate on such space the shift and multiplicative groups, as well as,…
Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
In this paper, we study the conjugate phase retrieval for complex-valued \mbox{signals} residing on graphs, and explore its applications to shift-invariant spaces. Given a complex-valued graph signal $\bf f$ residing on the graph $\mathcal…
In this paper we address sampling and approximation of functions on combinatorial graphs. We develop filtering on graphs by using Schr\"odinger's group of operators generated by combinatorial Laplace operator. Then we construct a sampling…
Let $q=p^e$, where $p$ is a prime and $e\geq 1$ is an integer. For $m\geq 1$, let $P$ and $L$ be two copies of the $(m+1)$-dimensional vector spaces over the finite field $\mathbb{F}_q$. Consider the bipartite graph $W_m(q)$ with partite…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…
In this paper authors consider representations of graphs in Hilbert spaces applying a restriction of local scalarity on them. It enables to obtain a theory, similar to the classical theory of representations of graphs in vector spaces. In…
We develop the theory of frames and Parseval frames for finite-dimensional vector spaces over the binary numbers. This includes characterizations which are similar to frames and Parseval frames for real or complex Hilbert spaces, and the…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We develop real Paley-Wiener theorems for classes ${\mathcal S}_\omega$ of ultradifferentiable functions and related $L^{p}$-spaces in the spirit of Bang and Andersen for the Schwartz class. We introduce results of this type for the…
Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…
Let X = G/H be a reductive symmetric space and K a maximal compact subgroup of G. The image under the Fourier transform of the space of K-finite compactly supported smooth functions on X is characterized.
A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…
We formulate and prove a version of Paley-Wiener theorem for the inverse Fourier transform on non-compact Riemannian symmetric spaces and Heisenberg groups. The main ingredient in the proof is the Gutzmer's formula.
The aim of the article is to understand the combinatorics of snake graphs by means of linear algebra. In particular, we apply Kasteleyn's and Temperley--Fisher's ideas about spectral properties of weighted adjacency matrices of planar…
Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering,…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…