Related papers: Variational Splines and Paley--Wiener Spaces on Co…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…

The goal of the paper is to establish cubature formulas on combinatorial graphs. Two types of cubature formulas are developed. Cubature formulas of the first type are exact on spaces of variational splines on graphs. Since badlimited…

Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…

Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…

In this paper we discuss the problem of decomposition for unbounded $2\times 2$ operator matrices by a pair of complementary invariant graph subspaces. Under mild additional assumptions, we show that such a pair of subspaces decomposes the…

For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…

In the Clifford algebra setting the present study develops three reproducing kernel Hilbert spaces of the Paley-Wiener type, namely the Paley-Wiener spaces, the Hardy spaces on strips, and the Bergman spaces on strips. In particular, we…

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

We study the discrete version of the $p$-Laplacian. Based on its variational properties we discuss some features of the associated parabolic problem. Our approach allows us in turn to obtain interesting information about positivity and…

An earlier work of the author's showed that it was possible to adapt the Alekseev-Meinrenken Chern-Weil proof of the Duflo isomorphism to obtain a completely combinatorial proof of the Wheeling isomorphism. That work depended on a certain…

We prove relations between the number of $k$-connected components of a graph, Crapo's invariant $\beta(M)$ of a matroid, and Speyer's polynomial $g_M(t)$. These yield a simple interpretation of $g_M'(-1)$ when $M$ is graphic or cographic.…

This paper begins by reviewing numerous theoretical advancements in the field of multivariate splines, primarily contributed by Professor Larry L. Schumaker. These foundational results have paved the way for a wide range of applications and…

We provide a general framework to study invariant properties of various gradient-like and Laplace-like differential operators naturally associated to geometric structures on $\mathbb{R}^n$, which encompass Euclidean, Minkowski,…

Interpreting graph neural networks (GNNs) is difficult because message passing mixes signals and internal channels rarely align with human concepts. We study superposition, the sharing of directions by multiple features, directly in the…

In this paper, we construct a bijective mapping between a biquadratic spline space over the hierarchical T-mesh and the piecewise constant space over the corresponding crossing-vertex-relationship graph (CVR graph). We propose a novel…

For a given infinite connected graph $G=(V,E)$ and an arbitrary but fixed conductance function $c$, we study an associated graph Laplacian $\Delta_{c}$; it is a generalized difference operator where the differences are measured across the…

Feature learning in the presence of a mixed type of variables, numerical and categorical types, is an important issue for related modeling problems. For simple neighborhood queries under mixed data space, standard practice is to consider…

We study the local approximation properties in hierarchical spline spaces through multiscale quasi-interpolation operators. This construction suggests the analysis of a subspace of the classical hierarchical spline space (Vuong et al.,…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…