Related papers: Extension to the Beraha-Kahane-Weiss Theorem with …
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…
We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…
The chapter aims to explore the application of graph theory and networks in the recommendation domain, encompassing the mathematical models that form the foundation for the algorithms and recommendation systems developed based on them. The…
The theory of DAHA-Jones polynomials is extended from torus knots to their arbitrary iterations (for any reduced root systems and weights), which incudes the polynomiality, duality and other properties of the DAHA superpolynomials.…
We study the chromatic symmetric function on graphs, and show that its kernel is spanned by the modular relations. We generalize this result to the chromatic quasisymmetric function on hypergraphic polytopes, a family of generalized…
We study Extremal Combinatorics problems where local properties are used to derive global properties. That is, we consider a given configuration where every small piece of the configuration satisfies some restriction, and use this local…
Polynomial filters, a kind of Graph Neural Networks, typically use a predetermined polynomial basis and learn the coefficients from the training data. It has been observed that the effectiveness of the model is highly dependent on the…
We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
The independence polynomial of a hypergraph is the generating function for its independent (vertex) sets with respect to their cardinality. This article aims to discuss several recurrence relations for the independence polynomial using some…
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
We prove an extension of the Bourgain-Sarnak-Ziegler theorem and then apply it to bound certain polynomial exponential sums with modular coefficients.
In this paper, we introduce the concept of the weighted (harmonic) chromatic polynomials of graphs and discuss some of its properties. We also present the notion of the weighted (harmonic) Tutte--Grothendieck polynomials of graphs and give…
The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying…