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

A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A dart is a graph which vertices $a, b, c, d, e$ and edges $ab, bc, bd, be, cd, de$. Dart-free graphs have been actively studied in…

A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least 5 or the complement of one.…

The sets of $\cB$-free integers are considered with respect to (reversing) symmetries. It is well known that, for a large class of them, the centraliser of the associated $\cB$-free shift (otherwise known as its automorphism group) is…

We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…

Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…

We prove that every $n$-vertex graph with at least $\binom{n}{2} - (n - 4)$ edges has a fractional triangle decomposition, for $n \ge 7$. This is a key ingredient in our proof, given in a companion paper, that every $n$-vertex $2$-coloured…

We study a wide range of neutral atoms and ions suitable for ultra-precise atomic optical clocks with naturally suppressed black body radiation shift of clock transition frequency. Calculations show that scalar polarizabilities of clock…

A combination of three or more tones played together is called a chord. In the chromatic scale, chords which are consonant are of particular interest and can be divided into several groups, two main ones being the major and minor chords.…

A graph $G(V,E)$ is $\Gamma$-harmonious when there is an injection $f$ from $V$ to an Abelian group $\Gamma$ such that the induced edge labels defined as $w(xy)=f(x)+f(y)$ form a bijection from $E$ to $\Gamma$. We study $\Gamma$-harmonious…

The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…

We show there is a positivity property for Wightman functions which is analogous to the reflection positivity for the euclidean ones. The role of euclidean time reflections is played here by the wedge reflections, which change the sign of…

The gedanken experiment of the clock paradox is solved exactly using the general relativistic equations for a static homogeneous gravitational field. We demonstrate that the general and special relativistic clock paradox solutions are…

An ultrastable optical clock based on neutral atoms trapped in an optical lattice is proposed. Complete control over the light shift is achieved by employing the $5s^2 {}^1S_0 \to 5s5p {}^3P_0$ transition of ${}^{87}{\rm Sr}$ atoms as a…

We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…

In the way of proving Kneser's conjecture, L\'{a}szl\'{o} Lov\'{a}sz settled out a new lower bound for the chromatic number of graphs. He showed that if the hom complex $||Hom(\mathcal{K}_2, H)||$ of a graph $H$ is topologically…

It is known that $\Theta(\log n)$ chords must be added to an $n$-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, $\Theta(n)$ chords are required. A possibly `intermediate'…

We prove that for any tree with a vertex of degree at least six, its chromatic symmetric function is not $e$-positive, that is, it cannot be written as a nonnegative linear combination of elementary symmetric functions. This makes…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…

From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, roughly speaking, correspond to paths in $E$. Wang and Luo showed that the congruence lattice $L(G(E))$ of $G(E)$ is upper-semimodular for…