Related papers: Lollipop and lariat symmetric functions
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…
The Collatz conjecture states that repeated steps of $n\mathrm{\to }\mathrm{3}n\mathrm{+1}$ at odd numbers and $n\mathrm{\to }n\mathrm{/2}$ at even numbers amount to walks over root paths to the branching number $c=4$ in the `trivial'…
In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…
We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…
In this paper, we determine the achromatic and diachromatic numbers of some circulant graphs and digraphs each one with two lengths and give bounds for other circulant graphs and digraphs with two lengths. In particular, for the achromatic…
We consider the scalar integral associated to the 3-loop sunrise graph with a massless line, two massive lines of equal mass $M$, a fourth line of mass equal to $Mx$, and the external invariant timelike and equal to the square of the fourth…
In this work, we try to enunciate the Total chromatic number of some Cayley graphs like the Cayley graph on Symmetric group, Alternating group, Dihedral group with respect to some generating sets and some other regular graphs.
Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove…
In this paper we find chromatic numbers of distance graphs $G(n,3,2)$ for infinitely many n. Also we improve upper bound for $\chi(G(n,r,s))$ in large part of cases.
We describe some (countably many) classes K^{n,e} of finite graphs and prove that if lambda^{aleph_0}= lambda then every lambda^+-chromatic graph of cardinal lambda^+ contains, for some n, e, all members of K^{n,e} as subgraphs. On the…
The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial due to Stanley are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the…
The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of…
In this paper we prove that if an infinite circulant graph with $k$ distances has a perfect $2$-colouring with parameters $(b, c)$, then $b + c \leq 2k + \frac{b+c}{q^t}$ for all positive integers $t$ and primes $q$ satisfying…
We define a q-chromatic function on graphs, list some of its properties and provide some formulas in the class of general chordal graphs. Then we relate the q-chromatic function to the colored Jones function of knots. This leads to a…
Let $r\geq3$ and $G$ be an $r$-uniform hypergraph with vertex set $\left\{ 1,\ldots,n\right\} $ and edge set $E$. Let \[ \mu\left( G\right) :=\max {\textstyle\sum\limits_{\left\{ i_{1},\ldots,i_{r}\right\} \in E}} x_{i_{1}}\cdots x_{i_{r}},…
We investigate Legendrian graphs in $(\R^3, \xi_{std})$. We extend the classical invariants, Thurston-Bennequin number and rotation number to Legendrian graphs. We prove that a graph can be Legendrian realized with all its cycles Legendrian…
We show that no tree on twenty vertices with maximum degree ten has Schur positive chromatic symmetric function, thereby providing a counterexample to a conjecture from the paper "Schur and e-positivity of trees and cut vertices".
In this paper we study spectral zeta functions associated to finite and infinite graphs. First we establish a meromorphic continuation of these functions under some general conditions. Then we study special values in the case of standard…
Colored multiple zeta values are special values of multiple polylogarithms evaluated at Nth roots of unity. In this paper, we define both the finite and the symmetrized versions of these values and show that they both satisfy the double…
This article is built upon three main ideas. First, for a class of monomial ideals, it is proven that the multiplicity of an ideal equals the number of realizations of its codimension (an intuitive concept that we define later). Next, for…