相关论文: Clocks are $e$-positive

We establish the $e$-positivity of cycle-chord graphs by using the composition method which is developed by Zhou and the author recently. Our method is simpler than the $(e)$-positivity approach which is used for handling cycle-chords with…

We prove Gebhard and Sagan's $(e)$-positivity of the line graphs of tadpoles in noncommuting variables. This implies the $e$-positivity of these line graphs. We then extend this $(e)$-positivity result to that of certain cycle-chord graphs,…

We describe a way to decompose the chromatic symmetric function as a positive sum of smaller pieces. We show that these pieces are $e$-positive for cycles. Then we prove that attaching a cycle to a graph preserves the $e$-positivity of…

We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…

We describe how the chromatic symmetric function of two graphs glued at a single vertex can be expressed as a matrix multiplication using certain information of the two individual graphs. We then prove new $e$-positivity results by using a…

We investigate the $e$-positivity and Schur positivity of the chromatic symmetric functions of some spider graphs with three legs. We obtain the positivity classification of all broom graphs and that of most double broom graphs. The methods…

In this paper, we identify a new family of $e$-positive graphs, called the trinacria graphs $T_{(b+2)b2}$, thereby providing a partial answer to Stanley's question on which graphs are $e$-positive. The trinacria graph $T_{abc}$ is the graph…

In the mid-1990s, Stanley and Stembridge conjectured that the chromatic symmetric functions of claw-free co-comparability (also called incomparability) graphs were e-positive. The quest for the proof of this conjecture has led to an…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

In 1995 Stanley conjectured that the chromatic symmetric functions of the graphs $P_{d,2}$, which we call triangular ladders, were $e$-positive. In this paper we confirm this conjecture, which is also an unsolved case of the celebrated…

Two particularly simple ideal clocks exhibiting intrinsic circular motion with the speed of light and opposite spin alignment are described. The clocks are singled out by singularities of an inverse Legendre transformation for relativistic…

A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…

Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph…

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…

Theories unifying gravity and other interactions suggest the possibility of spatial and temporal variation of physical ``constants''. Accuracy achieved for the atomic optical frequency standards (optical clocks) approaches the level when…

In this paper, we study positivity phenomena for the $e$-coefficients of Stanley's chromatic function of a graph. We introduce a new combinatorial object: the {\em correct} sequences of unit interval orders, and using these, in certain…

The operation of twinning a graph at a vertex was introduced by Foley, Ho\`ang, and Merkel (2019), who conjectured that twinning preserves $e$-positivity of the chromatic symmetric function. A counterexample to this conjecture was given by…

The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…

We give a closed formula for Lovasz theta number of the powers of cycle graphs and of their complements, the circular complete graphs. As a consequence, we establish that the circular chromatic number of a circular perfect graph is…

Being able to measure time, whether directly or indirectly, is a significant advantage for an organism. It allows for the timely reaction to regular or predicted events, reducing the pressure for fast processing of sensory input. Thus,…