相关论文: On polynomial digraphs

We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We…

We consider the bialgebra of hypergraphs, a generalization of Schmitt's Hopf algebra of graphs, and show it has a cointeracting bialgebra. So one has a double bialgebra in the sense of L. Foissy, who recently proved there is then a unique…

In this work, we introduce the boundary polynomial of a graph $G$ as the ordinary generating function in two variables $B(G;x,y):= \displaystyle\sum_{S\subseteq V(G)} x^{|B(S)|}y^{|S|}$, where $B(S)$ denotes the outer boundary of $S$. We…

Let $K$ be an algebraically closed field and $\mathrm{M}(2,K)$ be the $2\times 2$ matrix algebra over $K$ and $\mathrm{GL}(2,K)$ be the invertible elements in $\mathrm{M}(2,K)$. We explore the image of polynomials with constants, namely…

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…

We review known results concerning powers and products of $(m,p)$-isometries with a view to providing elementary proofs based on properties of polynomials. We consider also the situation when $p=\infty$ where we find elements of graph…

In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…

We consider the space $P$ of generic complex 5-degree polynomials. Critical values of such polynomial, i.e. four points in the complex plane, either are vertices of a convex quadrangle $Q$, or vertices of a triangle $T$ with one point…

Tittmann, Averbouch and Makowsky [P. Tittmann, I. Averbouch, J.A. Makowsky, The enumeration of vertex induced subgraphs with respect to the number of components, European Journal of Combinatorics, 32 (2011) 954-974], introduced the subgraph…

The bivariate $P$- and $Q$-polynomial structures of association schemes based on attenuated spaces are examined using recurrence and difference relations of the bivariate polynomials which form the eigenvalues of the scheme. These…

We give a complete characterization of the positive trigonometric polynomials Q(\theta,\phi) on the bi-circle, which can be factored as Q(\theta,\phi)=|p(e^{i\theta},e^{i\phi})|^2 where p(z,w) is a polynomial nonzero for |z|=1 and |w|\leq…

We introduce a new bivariate polynomial ${\displaystyle J(G; x,y):=\sum\limits_{W \in V(G)} x^{|W|}y^{|N(W)|}}$ which contains the standard domination polynomial of the graph $G$ in two different ways. We build methods for efficient…

It is shown how a connected graph and a tree with partially prescribed spectrum can be constructed. These constructions are based on a recent result of Salez that every totally real algebraic integer is an eigenvalue of a tree. Our result…

Let $x,y\in(0,1]$ and let $A,B,C$ be disjoint nonempty subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbours in $B$, and every vertex in $B$ has at least $y|C|$ neighbours in $C$. We denote by $\phi(x,y)$ the…

This work explores new arithmetic and combinatorial structures arising from the interplay between Farey-type graphs, Fibonacci expansions, and operadic constructions. We introduce Fibonadic numbers, defined as an inverse limit under the…

The paper describes a new algorithm of construction of the nonlinear arithmetic triangle on the basis of numerical simulation and the binary system. It demonstrates that the numbers that fill the nonlinear arithmetic triangle may be…

We propose a study of the foliations of the projective plane induced by simple derivations of the polynomial ring in two indeterminates over the complex field. These correspond to foliations which have no invariant algebraic curve nor…

We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…