Related papers: Generalized Riemann Functions, Their Weights, and …

Recently, we have established the generalized Li criterion equivalent to the Riemann hypothesis, viz. demonstrated that the sums over all non-trivial Riemann function zeroes k_n,a=Sum_(/rho)(1-(1-((/rho-a)/(/rho+a-1))^n) for any real a not…

Let ${\cal G}=(G,w) $ be a positive-weighted graph, that is a graph $G$ endowed with a function $w$ from the edge set of $G$ to the set of positive real numbers; for any distinct vertices $i,j $, we define $D_{i,j}({\cal G})$ to be the…

In this paper we investigate Hartman functions on a topological group $G$. Recall that $(\iota, C)$ is a group compactification of $G$ if $C$ is a compact group, $\iota: G\to C$ is a continuous group homomorphism and $\iota(G)$ is dense in…

We present the first applications of the recently established by us (arXiv:1304.7895; Ukrainian Math. J. - 2014. -66. - P. 371-383) generalized Li's criterion equivalent to the Riemann Hypothesis. This criterion is the statement that the…

Given a `genus' function $g=g(n)$, we let $\mathcal{E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in a surface of Euler genus at most $g(n)$. Let the random graph $R_n$…

Finding the mean of sampled data is a fundamental task in machine learning and statistics. However, in cases where the data samples are graph objects, defining a mean is an inherently difficult task. We propose a novel framework for…

The expressivity of Graph Neural Networks (GNNs) is dependent on the aggregation functions they employ. Theoretical works have pointed towards Sum aggregation GNNs subsuming every other GNNs, while certain practical works have observed a…

We introduce a new Tauberian framework through the theory of "regular arithmetic functions". This allows us to establish a characterization of the Riemann hypothesis by linking the floor function to the distribution of nontrivial zeros of…

The Riemann zeta function and the distribution of its nontrivial zeros on the critical line remain central topics in analytic number theory and large-scale computation. This work develops a numerical framework that replaces classical…

Our main result is a generalized Dillon-type theorem, giving graph-theoretic conditions which guarantee that a $p$-ary function in an even number of variables is bent, for $p$ a prime number greater than 2. The key condition is that the…

Graphons are symmetric measurable functions that arise from a sequence of graphs. A graphon variety is the a set of all graphons defined by a condition of the form $t(g, W) = 0$ for a fixed quantum graph $g$, where $t(.,.)$ is the…

Let $G$ be a graph, and $H\colon V(G)\to 2^\mathbb{N}$ a set function associated with $G$. A spanning subgraph $F$ of $G$ is called an $H$-factor if the degree of any vertex $v$ in $F$ belongs to the set $H(v)$. This paper contains two…

This paper presents a new approach towards the Riemann Hypothesis. On iterative expansion of integration term in functional equation of the Riemann zeta function we get sum of two series functions. At the `non-trivial' zeros of zeta…

Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…

The middle graph $M(G)$ of a graph $G$ is the graph obtained by subdividing each edge of $G$ exactly once and joining all these newly introduced vertices of adjacent edges of $G$. A perfect Roman dominating function on a graph $G$ is a…

The Riemann theta function is a complex-valued function of g complex variables. It appears in the construction of many (quasi-) periodic solutions of various equations of mathematical physics. In this paper, algorithms for its computation…

We aim to deepen the theoretical understanding of Graph Neural Networks (GNNs) on large graphs, with a focus on their expressive power. Existing analyses relate this notion to the graph isomorphism problem, which is mostly relevant for…

Functional graphical models explore dependence relationships of random processes. This is achieved through estimating the precision matrix of the coefficients from the Karhunen-Loeve expansion. This paper deals with the problem of…

As well known, the study of Riemanns zeta function {\zeta}(s) involves the related entire function {\xi}(s). A close relative of {\zeta}(s) is the alternating zeta function {\eta}(s). Similar to {\zeta}(s), also {\eta}(s) has a…

Classically, a single weight on an interval of the real line leads to moments, orthogonal polynomials and tridiagonal matrices. Appropriately deforming this weight with times t=(t_1,t_2,...), leads to the standard Toda lattice and…