Related papers: Generalized Riemann Functions, Their Weights, and …
It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph $D=(V,A)$, a cost function $w: A\rightarrow \{0,1\}$ and a natural…
Partition- and moment functions for a general (not necessarily Gaussian) functional measure that is perturbed by a Gibbs factor are calculated using generalized Feynman graphs. From the graphical calculus, a new notion of Wick ordering…
The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first…
We define a divisor theory for graphs and tropical curves endowed with a weight function on the vertices; we prove that the Riemann-Roch theorem holds in both cases. We extend Baker's Specialization Lemma to weighted graphs.
In this paper, we fully answer the above question through a key algebraic condition on graph functions, called \textit{permutation compatibility}, that relates permutations of weights and features of the graph to functional constraints. We…
In a recent paper, Beniamini and Nisan gave a closed-form formula for the unique multilinear polynomial for the Boolean function determining whether a given bipartite graph $G \subseteq K_{n,n}$ has a perfect matching, together with an…
This paper proposes a reformulation of the Riemann Xi function in order to investigate its properties. The reformulated function, which depicts the Xi function as the weighted sum of incomplete gamma functions, is validated, and a number of…
We prove a connection between Schmidt-rank and weight of quadratic forms. This provides a new tool for the classification of graph states based on entanglement. Our main tool arises from a reformulation of previously known results…
In this paper, we investigate the Bartholdi zeta function on a connected simple digraph with $n_V$ vertices and $n_E$ edges. We derive a functional equation for the Bartholdi zeta function $\zeta_G(q,u)$ on a regular graph $G$ with respect…
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…
Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…
Recently, Baker and Norine {Advances in Mathematics, 215(2): 766-788, 2007} found new analogies between graphs and Riemann surfaces by developing a Riemann-Roch machinery on a finite graph $G$. In this paper, we develop a general…
We consider the problem of graph-matching on a network of 3D shapes with uncertainty quantification. We assume that the pairwise shape correspondences are efficiently represented as \emph{functional maps}, that match real-valued functions…
We propose a novel random walk-based algorithm for unbiased estimation of arbitrary functions of a weighted adjacency matrix, coined universal graph random features (u-GRFs). This includes many of the most popular examples of kernels…
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…
This paper is concerned with long-time interest of us, especially, the author, in realizing graphs as Reeb graphs of real algebraic functions of certain nice classes. The Reeb graph of a differentiable function is the set consisting of all…
This is a survey on weight enumerators, zeta functions and Riemann hypothesis for linear and algebraic-geometry codes.
In [19] it was explained how one can naturally associate a Deitmar scheme (which is a scheme defined over the field with one element, $\mathbb{F}_1$) to a so-called "loose graph" (which is a generalization of a graph). Several properties of…
In this paper we develop a general approach to dimer models analogous to Krichever's scheme in the theory of integrable systems. We start with a Riemann surface and the simplest generic meromorphic functions on it and demonstrate how to…
The recently introduced $\{k\}$-packing function problem is considered in this paper. Special relation between a case when $k=1$, $k\ge 2$ and linear programming relaxation is introduced with sufficient conditions for optimality. For…