Related papers: Kirszbraun extension on connected finite graph
Let $r_1,\ldots,r_s:\mathbb{Z}_{n\geqslant 0}\to\mathbb{C}$ be linearly recurrent sequences whose associated eigenvalues have arguments in $\pi\mathbb{Q}$ and let $F(z):=\sum_{n\geqslant 0}f(n)z^n$, where $f(n)\in\{r_1(n),\ldots,$…
An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically…
Chebfun and related software projects for numerical computing with functions are based on the idea that at each step of a computation, a function $f(x)$ defined on an interval $[a,b]$ is "rounded" to a prescribed precision by constructing a…
We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.
In this paper, we investigate the spectral properties of the closed neighborhood corona product of graphs, which was introduced by Harishchandra S. Ramane et al.~\cite{ramane2021polynomials} (cf. Polynomials Associated with Closed…
Spanner constructions focus on the initial design of the network. However, networks tend to improve over time. In this paper, we focus on the improvement step. Given a graph and a budget $k$, which $k$ edges do we add to the graph to…
On a connected finite graph, we propose an evolution of weights including Ollivier's Ricci flow as a special case. During the evolution process, on each edge, the speed of change of weight is exactly the difference between the Wasserstein…
We introduce a large class of mappings, called enriched contractions, which includes, amongst many other contractive type mappings, the Picard-Banach contractions and some nonexpansive mappings. We show that any enriched contraction has a…
We define and study rational discrete analytic functions and prove the existence of a coisometric realization for discrete analytic Schur multipliers.
There is a well-known zeta function of the $\mathbb{Z}$-dynamical system generated by an element of the symmetric group. By considering this zeta function as a model, we can construct a new zeta function of an element of the braid group.In…
We explain the exact meaning of a statement we made in a previous paper on invariants, namely that a complex-valued function of the data of the functional equation of an $L$-function is an invariant if and only if it is stable under the…
For a function that is analytic on and around an interval, Chebyshev polynomial interpolation provides spectral convergence. However, if the function has a singularity close to the interval, the rate of convergence is near one. In these…
We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…
Twin-width is a structural width parameter introduced by Bonnet, Kim, Thomass\'e and Watrigant [FOCS 2020]. Very briefly, its essence is a gradual reduction (a contraction sequence) of the given graph down to a single vertex while…
A graphon is a limiting object used to describe the behaviour of large networks through a function that captures the probability of edge formation between nodes. Although the merits of graphons to describe large and unlabelled networks are…
In recent years it has turned out that shearlets have the potential to retrieve directional information so that they became interesting for many applications. Moreover the continuous shearlet transform has the outstanding property to stem…
We provide additional results in connection with Krein's formula, which describes the resolvent difference of two self-adjoint extensions A_1 and A_2 of a densely defined closed symmetric linear operator A with (possibly infinite) equal…
It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the…
In this paper we consider finite dimensional dynamical systems generated by a Lipschitz function. We prove a version of the Whitney's Extension Theorem on compact manifolds to obtain a version of the well-known Lambda Lemma for Lipschitz…
Classical Schur analysis is intimately connected to the theory of orthogonal polynomials on the circle [Simon, 2005]. We investigate here the connection between multipoint Schur analysis and orthogonal rational functions. Specifically, we…