Related papers: Kirszbraun extension on connected finite graph
Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…
Spectral polynomial approximation of smooth functions allows real-time manipulation of and computation with them, as in the Chebfun system. Extension of the technique to two-dimensional and three-dimensional functions on hyperrectangles has…
The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…
The present paper studies a quantitative version of the transversality theorem. More precisely, given a continuous function $f\in \mathcal{C}([0,1]^d,\mathbb{R}^m)$ and a manifold $W\subset \mathbb{R}^m$ of dimension $p$, a sharpness result…
Andrews and Merca introduced and proved a $q$-series expansion for the partial sums of the $q$-series in Euler's pentagonal number theorem. Kolitsch, in 2022, introduced a generalization of the Andrews-Merca identity via a finite sum…
We calculate the knot invariant coming from the Teichm\"{u}ller TQFT [AK1]. Specifically we calculate the knot invariant for the complement of the knot $6_1$ both in the original [AK1] and the new formulation of the Teichm\"{u}ller TQFT…
A complex unit gain graph ($ \mathbb{T} $-gain graph), $ \Phi=(G, \varphi) $ is a graph where the gain function $ \varphi $ assigns a unit complex number to each orientation of an edge of $ G $ and its inverse is assigned to the opposite…
It is known that a real analytic CR function f on a real analytic, generic submanifold M in C^N can be holomorphically extended. A stronger result on a finite type, real analytic, generic submanifold M is found in which we assume f a…
The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.
The goal of the paper is to apply the general operator theoretic construction known as the Schur complement for computation of the spectrum of certain infinite graphs which can be viewed as finite graphs with the ray attached to them. The…
We prove a number of double-sided estimates relating discrete counterparts of several classical conformal invariants of a quadrilateral: cross-ratios, extremal lengths and random walk partition functions. The results hold true for any…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call…
We construct an extension of the Kontsevich integral of knots to knotted trivalent graphs, which commutes with orientation switches, edge deletions, edge unzips, and connected sums. In 1997 Murakami and Ohtsuki [MO] first constructed such…
This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erd\H{o}s, R\'{e}nyi, and S\'{o}s (1966). The proof relies on a closed-form expression for the Lov\'{a}sz $\vartheta$-function of…
We present a method using contour integration to derive definite integrals and their associated infinite sums which can be expressed as a special function. We give a proof of the basic equation and some examples of the method. The advantage…
In this article we show a tecnique based on the Weierstrass product for the sine and cosine function and the bisection formula for the cotangent function that leads to a generalization of the classical Shafer-Fink inequality $ \frac{3…
In 1998, Broersma and Tuinstra [J. Graph Theory \textbf{29} (1998), 227-237] proved that if $G$ is a connected graph satisfying $\sigma_2(G) \geq |G|-k+1$ then $G$ has a spanning $k-$ended tree. They also gave an example to show that the…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
We give a simple criterion so that a countable infinite direct sum of trace (evaluation) maps is a trace map. An application to the theory of self-adjoint extensions of direct sums of symmetric operators is provided; this gives an…