Related papers: A note on monomials
In this work we continue to study the properties of polynomials of binomial type and their canonical continuations to the complex index by exploring the properties of transformation T:=1/dlog which acts on formal power series $f(x)$ of the…
Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…
The adjoint polynomial of $G$ is \[h(G,x)=\sum_{k=1}^n(-1)^{n-k}a_k(G)x^k,\] where $a_k(G)$ denotes the number of ways one can cover all vertices of the graph $G$ by exactly $k$ disjoint cliques of $G$. In this paper we show the the adjoint…
We present an algorithm to solve $- \lap u - f(x,u) = g$ with Dirichlet boundary conditions in a bounded domain $\Omega$. The nonlinearities are non-resonant and have finite spectral interaction: no eigenvalue of $-\lap_D$ is an endpoint of…
Assume $\alpha\geq p>1$. Consider the following $p$-th Yamabe equation on a connected finite graph $G$: $$\Delta_p\varphi+h\varphi^{p-1}=\lambda f\varphi^{\alpha-1},$$ where $\Delta_p$ is the discrete $p$-Laplacian, $h$ and $f>0$ are fixed…
For a class $\mathcal{G}$ of graphs, the objective of \textsc{Subgraph Complementation to} $\mathcal{G}$ is to find whether there exists a subset $S$ of vertices of the input graph $G$ such that modifying $G$ by complementing the subgraph…
Let $L_H$ denote the set of all normalized locally one-to-one and sense-preserving harmonic functions in the unit disc $\Delta$. It is well-known that every complex-valued harmonic function in the unit disc $\Delta$ can be uniquely…
We compare the capabilities of two approaches to approximating graph isomorphism using linear algebraic methods: the \emph{invertible map tests} (introduced by Dawar and Holm) and proof systems with algebraic rules, namely \emph{polynomial…
In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…
In this paper we consider nonlinear stationary fractional-in-space differential equations with order $1<\alpha<2$ on the metric star graph with three finite bonds. At the branched point of the star graph we put the weight continuity and the…
In the paper a theorem of Piccard's type is proved and, consequently, the continuity of $\mathcal{D}$-measurable polynomial functions of $n$-th order as well as $\mathcal{D}$-measurable $n$-convex functions is shown. The paper refers to the…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…
In this sequence of work we investigate polynomial equations of additive functions. We consider the solutions of equation \[ \sum_{i=1}^{n}f_{i}(x^{p_{i}})g_{i}(x)^{q_{i}}= 0 \qquad \left(x\in \mathbb{F}\right), \] where $n$ is a positive…
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
Given a finite simple graph G, let G' be its barycentric refinement: it is the graph in which the vertices are the complete subgraphs of G and in which two such subgraphs are connected, if one is contained into the other. If L(0)=0<L(1) <=…
In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y) = 0$ with variables $X$ and $Y$ over a finite field $\mathbb{F}_q$ of odd characteristic, we define a digraph by choosing the elements in…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
This is a sequel to [arXiv:1708.09092v2]. For an oriented trivalent graph $G$ without source or sink embedded in $S^3$, we prove that the $\mathfrak{gl}(1| 1)$-Alexander polynomial $\underline{\Delta}(G, c)$ defined by Viro satisfies a…