Defining Recursive Predicates in Graph Orders

We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary. We define the notion of a recursive predicate over graphs using Turing Machine recognizable string encodings of graphs. We also define the notion of an arithmetical relation over graphs using a total order $\leq_t$ on the set $\mathcal{G}$ such that ($\mathcal{G},\leq_t$) is isomorphic to ($\mathbb{N},\leq$). We introduce the notion of a \textit{capable} structure over graphs, which is one satisfying the conditions : (1) definability of arithmetic, (2) definability of cardinality of a graph, and (3) definability of two particular graph predicates related to vertex labellings of graphs. We then show any capable structure can define every arithmetical predicate over graphs. As a corollary, any capable structure also defines every recursive graph relation. We identify capable structures which are expansions of graph orders, which are structures of the form ($\mathcal{G},\leq$) where $\leq$ is a partial order. We show that the subgraph order i.e. ($\mathcal{G},\leq_s$), induced subgraph order with one constant $P_3$ i.e. ($\mathcal{G},\leq_i,P_3$) and an expansion of the minor order for counting edges i.e. ($\mathcal{G},\leq_m,sameSize(x,y)$) are capable structures. In the course of the proof, we show the definability of several natural graph theoretic predicates in the subgraph order which may be of independent interest. We discuss the implications of our results and connections to Descriptive Complexity

Observation of a uniform temperature dependence in the electrical resistance across the structural phase transition in thin film vanadium oxide (VO2VO_{2})

An electrical study of thin $VO_{2}$ films in the vicinity of the structural phase transition at $68^{0}C$ shows (a) that the electrical resistance $R$ follows $log (R)$ $\propto$ $-T$ over the $T$-range, $20 < T < 80 ^{0}C$ covering both sides of the structural transition, and (b) a history dependent hysteresis loop in $R$ upon thermal cycling. These features are attributed here to transport through a granular network.Comment: 3 pages, 3 color figure

Entropic Test of Quantum Contextuality

We study the contextuality of a three-level quantum system using classical conditional entropy of measurement outcomes. First, we analytically construct the minimal configuration of measurements required to reveal contextuality. Next, an entropic contextual inequality is formulated, analogous to the entropic Bell inequalities derived by Braunstein and Caves in [Phys. Rev. Lett. {\bf 61}, 662 (1988)], that must be satisfied by all non-contextual theories. We find optimal measurements for violation of this inequality. The approach is easily extendable to higher dimensional quantum systems and more measurements. Our theoretical findings can be verified in the laboratory with current technology.Comment: 4 pages, 4 figure