Chromatic symmetric functions from the modular law

In this article we show how to compute the chromatic quasisymmetric function of indifference graphs from modular law introduced in [19]. We provide an algorithm which works for any that satisfies law, such as unicellular LLT polynomials. When graph has bipartite complement it reduces a planar network, case, prove coefficients elementary basis are positive unimodal polynomials and characterize them certain q-hit numbers (up factor). Finally, discuss logarithmic concavity function.