Related papers: Variational Splines and Paley--Wiener Spaces on Co…
We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we…
We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
Discrete Lagrangian Systems on graphs are considered. Vector-valued closed differential 2-form on the space of solutions is constructed. This form takes values in the first homology group of the graph. This construction generalizes the…
This paper introduces new invariants of rigid vertex graph embeddings by using non-local combinatorial information that is available at each graphical node. The new non-local information that we use in this paper involves parity in the…
A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for…
Bounded composition operators in Paley-Wiener spaces have simple forms, and they are just operators composed through affine mappings of the complex plane. The purpose of this article is to explore some notions about bounded operators and…
A set of arbitrarily high-order WENO schemes for reconstructions on nonuniform grids is presented. These non-linear interpolation methods use simple smoothness indicators with a linear cost with respect to the order, making them easy to…
We generalize the notion of Lagrangian subspaces to self-orthogonal subspaces with respect to a (skew-)symmetric form, thus characterizing (skew-)self-adjoint and unitary operators by means of self-ortho-gonal subspaces. By orthogonality…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
It is shown that Paley-Wiener functions on Riemannian manifolds of bounded geometry can be reconstructed in a stable way from some countable sets of their inner products with certain distributions of compact support. A reconstruction method…
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.
Large-scale graph machine learning is challenging as the complexity of learning models scales with the graph size. Subsampling the graph is a viable alternative, but sampling on graphs is nontrivial as graphs are non-Euclidean. Existing…
A new global basis of B-splines is defined in the space of generalized quadratic splines (GQS) generated by Merrien subdivision algorithm. Then, refinement equations for these B-splines and the associated corner-cutting algorithm are given.…
In this paper we investigate the problem of interpolating a B-spline curve network, in order to create a surface satisfying such a constraint and defined by blending functions spanning the space of bivariate $C^1$ quadratic splines on…
Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and…
The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such…
We explore the connections between Green's functions for certain differential equations, covariance functions for Gaussian processes, and the smoothing splines problem. Conventionally, the smoothing spline problem is considered in a setting…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…