Geometrical properties of Maslov indices in periodic-orbit theory

Maslov indices in periodic-orbit theory are investigated using phase space path integral. Based on the observation that the Maslov index is the multi-valued function of the monodromy matrix, we introduce a generalized monodromy matrix in the universal covering space of the symplectic group and show that this index is uniquely determined in this space. The stability of the orbit is shown to determine the parity of the index, and a formula for the index of the n-repetition of the orbit is derived.Comment: 18pages, 8figures, typos correcte

Note on the smallest root of the independence polynomial

One can define the independence polynomial of a graph G as follows. Let i(k)(G) denote the number of independent sets of size k of G, where i(0)(G) = 1. Then the independence polynomial of G is I(G,x) = Sigma(n)(k=0)(-1)(k)i(k)(G)x(k). In this paper we give a new proof of the fact that the root of I(G,x) having the smallest modulus is unique and is real

Effects of Entanglement in Controlled Dephasing

In controlled dephasing as a result of the interaction of a controlled environment (dephasor) and the system under observation (dephasee) the states of the two subsystems are entangled. Using as an example the ``Which Path Detector'', we discuss how the entanglement influences the controlled dephasing. In particular, we calculate the suppression $\nu$ of A-B oscillations as a function of the bias $eV$ applied to the QPC and the coupling $\Gamma$ of the QD to the leads. At low temperatures the entanglement produces a smooth crossover from $\nu \propto (eV/\Gamma)^2$, when $eV \ll \Gamma$ to $\nu \propto eV/\Gamma$, for $eV \gg \Gamma$.Comment: 4 pages, 1 figur

Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs

A maximum stable set in a graph G is a stable set of maximum cardinality. S is called a local maximum stable set of G if S is a maximum stable set of the subgraph induced by the closed neighborhood of S. A greedoid (V,F) is called a local maximum stable set greedoid if there exists a graph G=(V,E) such that its family of local maximum stable sets coinsides with (V,F). It has been shown that the family local maximum stable sets of a forest T forms a greedoid on its vertex set. In this paper we demonstrate that if G is a very well-covered graph, then its family of local maximum stable sets is a greedoid if and only if G has a unique perfect matching.Comment: 12 pages, 12 figure