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

Menger's theorem is an important building block of numerous results in the study of graph structure. We consider a variant in terms of coarse geometry. We say that a set of graphs has the weak coarse Menger property if there exist functions…

In this work we prove that if an entire function $f(z)$ is of order strictly less than one and it has only negative zeros, then for each nonnegative integer $k,m$ the real function…

In a recent paper [5] a smooth function f : [0; 1] --> R with all derivatives vanishing at 0 has been considered and a global condition, showing that f is indeed identically 0, has been presented. The purpose of this note is to replace the…

A Roman dominating function for a (non-weighted) graph $G=(V,E)$, is a function $f:V\rightarrow \{0,1,2\}$ such that every vertex $u\in V$ with $f(u)=0$ has at least {one} neighbor $v\in V$ such that $f(v)=2$. The minimum weight $\sum_{v\in…

Four propositions are considered concerning the relationship between the zeros of two combinations of the Riemann zeta function and the function itself. The first is the Riemann hypothesis, while the second relates to the zeros of a…

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…

Let $F$ be a function from $\mathbb{F}_{p^n}$ to itself and $\delta$ a positive integer. $F$ is called zero-difference $\delta$-balanced if the equation $F(x+a)-F(x)=0$ has exactly $\delta$ solutions for all non-zero $a\in\mathbb{F}_{p^n}$.…

In this paper, we introduce new concepts of domination and packing functions in graphs, which generalize, respectively, the labelled dominating and packing functions defined by Lee and Chang in 2008, and Hinrichsen et al. in 2019. These…

Stanley [9] introduced the chromatic symmetric function ${\bf X}_G$ associated to a simple graph $G$ as a generalization of the chromatic polynomial of $G$. In this paper we present a novel technique to write ${\bf X}_G$ as a linear…

In 2020, Alexander Grigor'yan, Yong Lin and Shing-Tung Yau [4] introduced the Reidemeister torsion and the analytic torsion for digraphs by means of the path complex and the path homology theory. Based on the analytic torsion for digraphs…

This is an introduction to the geometry of compact Riemann surfaces, largely following the books Farkas-Kra, Fay, Mumford Tata lectures. 1) Defining Riemann surfaces with atlases of charts, and as locus of solutions of algebraic equations.…

The period polynomial $r_f(z)$ for a weight $k \geq 3$ newform $f \in S_k(\Gamma_0(N),\chi)$ is the generating function for special values of $L(s,f)$. The functional equation for $L(s, f)$ induces a functional equation on $r_f(z)$. Jin,…

The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…

We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

A graph $G=(V,E)$ is total weight $(k,k')$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers,…

In most of the network coding problems with $k$ messages, the existence of binary network coding solution over $\mathbb{F}_2$ depends on the existence of adequate sets of $k$-dimensional binary vectors such that each set comprises of…

Baker constructed basic meromorphic functions on the Jacobian variety of a hyperelliptic curve with two points at infinity. We call them Baker functions. The construction is based on the Abel-Jacobi map, which allows us to identify the…

The free energy of the Ginzburg-Landau theory satisfies a nonlinear functional differential equation which is turned into a recursion relation. The latter is solved graphically order by order in the loop expansion to find all connected…

We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…