Related papers: Generalized Riemann Functions, Their Weights, and …
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…
In this paper, we reformulate the Bakry-\'Emery curvature on a weighted graph in terms of the smallest eigenvalue of a rank one perturbation of the so-called curvature matrix using Schur complement. This new viewpoint allows us to show…
There is a natural way to assign both graph and digraph to every poset. Furthermore, any graph has its chromatic function, while any digraph has its Redei-Berge function. On the level of posets, these two functions are almost identical.…
We investigate the existence of Boolean degree $d$ functions on the Grassmann graph of $k$-spaces in the vector space $\mathbb{F}_q^n$. For $d=1$ several non-existence and classification results are known, and no non-trivial examples are…
The Riemann $\Xi(z)$ function (even in $z$) admits a Fourier transform of an even kernel $\Phi(t)=4e^{9t/2}\theta''(e^{2t})+6e^{5t/2}\theta'(e^{2t})$. Here $\theta(x):=\theta_3(0,ix)$ and $\theta_3(0,z)$ is a Jacobi theta function, a…
We define a tau function for a generic Riemann-Hilbert problem posed on a union of non-intersecting smooth closed curves with jump matrices analytic in their neighborhood. The tau function depends on parameters of the jumps and is expressed…
We calculate a certain mean-value of meromorphic functions by using specific ergodic transformations, which we call affine Boolean transformations. We use Birkhoff's ergodic theorem to transform the mean-value into a computable integral…
Let $H$ be a planar graph. By a classical result of Robertson and Seymour, there is a function $f:\mathbb{N} \to \mathbb{R}$ such that for all $k \in \mathbb{N}$ and all graphs $G$, either $G$ contains $k$ vertex-disjoint subgraphs each…
Consider a finite and simple graph $G=(V,E)$ with maximum degree $\Delta$. A strong Roman dominating function over the graph $G$ is understood as a map $f : V (G)\rightarrow \{0, 1,\ldots , \left\lceil \frac{\Delta}{2}\right\rceil+ 1\}$…
We present some novelties on the Riemann zeta function. Using an extended formula created for the polylogarithm in a previous paper, $\mathrm{Li}_{k}(e^{z})$, the zeta function's Dirichlet series is analytically continued from $\Re(k)>1$ to…
Persistence diagrams are efficient descriptors of the topology of a point cloud. As they do not naturally belong to a Hilbert space, standard statistical methods cannot be directly applied to them. Instead, feature maps (or representations)…
We develop a new framework for investigating linear equivalence of divisors on graphs using a generalization of Gioan's cycle--cocycle reversal system for partial orientations. An oriented version of Dhar's burning algorithm is introduced…
Given a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2\}$ is a total Roman $\{2\}$-dominating function if: (1) every vertex $v\in V$ for which $f(v)=0$ satisfies that $\sum_{u\in N(v)}f(u)\geq 2$, where $N(v)$ represents the open…
In this work we prove that an entire function $f(z)$ has only negative zeros if and only if its order is strictly less $1$, its root sequence is real-part dominating and there exists an nonnegative integer $m$ the real function…
Graph kernels are widely used for measuring the similarity between graphs. Many existing graph kernels, which focus on local patterns within graphs rather than their global properties, suffer from significant structure information loss when…
In the present paper, we introduced the extended bicomplex plane $\bar{\mathbb{T}}$, its geometric model: the bicomplex Riemann sphere, and the bicomplex chordal metric that enables us to talk about the convergence of the sequences of…
A Roman dominating function of a graph $G=(V,E)$ is a labeling $f: V \rightarrow{} \{0 ,1, 2\}$ such that for each vertex $u \in V$ with $f(u) = 0$, there exists a vertex $v \in N(u)$ with $f(v) =2$. A Roman dominating function $f$ is a…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
In this paper we find a complete characterization of plateaued Boolean functions in terms of the associated Cayley graphs. Precisely, we show that a Boolean function $f$ is $s$-plateaued (of weight $=2^{(n+s-2)/2}$) if and only if the…
A {\it semi-proper orientation} of a given graph $G$ is a function $(D,w)$ that assigns an orientation $D(e)$ and a positive integer weight $ w(e)$ to each edge $e$ such that for every two adjacent vertices $v$ and $u$, $S_{(D,w)}(v) \neq…