980 resultados para Spectral Graph Theory
Resumo:
We investigate the modulational instability of plane waves in quadratic nonlinear materials with linear and nonlinear quasi-phase-matching gratings. Exact Floquet calculations, confirmed by numerical simulations, show that the periodicity can drastically alter the gain spectrum but never completely removes the instability. The low-frequency part of the gain spectrum is accurately predicted by an averaged theory and disappears for certain gratings. The high-frequency part is related to the inherent gain of the homogeneous non-phase-matched material and is a consistent spectral feature.
Resumo:
The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.
Resumo:
We present a resonating-valence-bond theory of superconductivity for the Hubbard-Heisenberg model on an anisotropic triangular lattice. Our calculations are consistent with the observed phase diagram of the half-filled layered organic superconductors, such as the beta, beta('), kappa, and lambda phases of (BEDT-TTF)(2)X [bis(ethylenedithio)tetrathiafulvalene] and (BETS)(2)X [bis(ethylenedithio)tetraselenafulvalene]. We find a first order transition from a Mott insulator to a d(x)(2)-y(2) superconductor with a small superfluid stiffness and a pseudogap with d(x)(2)-y(2) symmetry.
Resumo:
In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given.
Resumo:
A 4-cycle in a tripartite graph with vertex partition {V-1, V-2, V-3} is said to be gregarious if it has at least one vertex in each V-i, 1 less than or equal to i less than or equal to 3. In this paper, necessary and sufficient conditions are given for the existence of an edge-disjoint decomposition of any complete tripartite graph into gregarious 4-cycles.
Resumo:
A survey study of twenty-two Australian CEOs and their subordinates assessed relationships between Australian leader motives, Australian value based leader behaviour, subordinate tall poppy attitudes and subordinate commitment, effectiveness, motivation and satisfaction (CEMS). On the whole, the results showed general support for value based leadership processes. Subsequent regression analyses of the second main component of Value Based Leadership Theory, value based leader behaviour, revealed that the collectivistic, inspirational, integrity and visionary behaviour sub-scales of the construct were positively related with subordinate CEMS. Although the hypothesis that subordinate tall poppy attitudes would moderate value based leadership processes was not clearly supported, subsequent regression analyses found that subordinate tall poppy attitudes were negatively related with perceptions of value based leader behaviour and CEMS. These findings suggest complex relationships between the three constructs, and the proposed model for the Australian context is accordingly amended. Overall, the research supports the need to consider cultural-specific attitudes in management development.
Resumo:
The theory of Owicki and Gries has been used as a platform for safety-based verifcation and derivation of concurrent programs. It has also been integrated with the progress logic of UNITY which has allowed newer techniques of progress-based verifcation and derivation to be developed. However, a theoretical basis for the integrated theory has thus far been missing. In this paper, we provide a theoretical background for the logic of Owicki and Gries integrated with the logic of progress from UNITY. An operational semantics for the new framework is provided which is used to prove soundness of the progress logic.
Resumo:
The minimal irreducible representations of U-q[gl(m|n)], i.e. those irreducible representations that are also irreducible under U-q[osp(m|n)] are investigated and shown to be affinizable to give irreducible representations of the twisted quantum affine superalgebra U-q[gl(m|n)((2))]. The U-q[osp(m|n)] invariant R-matrices corresponding to the tensor product of any two minimal representations are constructed, thus extending our twisted tensor product graph method to the supersymmetric case. These give new solutions to the spectral-dependent graded Yang-Baxter equation arising from U-q[gl(m|n)((2))], which exhibit novel features not previously seen in the untwisted or non-super cases.
Resumo:
A graph H is said to divide a graph G if there exists a set S of subgraphs of G, all isomorphic to H, such that the edge set of G is partitioned by the edge sets of the subgraphs in S. Thus, a graph G is a common multiple of two graphs if each of the two graphs divides G.
Resumo:
The XSophe-Sophe-XeprView((R)) computer simulation software suite enables scientists to easily determine spin Hamiltonian parameters from isotropic, randomly oriented and single crystal continuous wave electron paramagnetic resonance (CW EPR) spectra from radicals and isolated paramagnetic metal ion centers or clusters found in metalloproteins, chemical systems and materials science. XSophe provides an X-windows graphical user interface to the Sophe programme and allows: creation of multiple input files, local and remote execution of Sophe, the display of sophelog (output from Sophe) and input parameters/files. Sophe is a sophisticated computer simulation software programme employing a number of innovative technologies including; the Sydney OPera HousE (SOPHE) partition and interpolation schemes, a field segmentation algorithm, the mosaic misorientation linewidth model, parallelization and spectral optimisation. In conjunction with the SOPHE partition scheme and the field segmentation algorithm, the SOPHE interpolation scheme and the mosaic misorientation linewidth model greatly increase the speed of simulations for most spin systems. Employing brute force matrix diagonalization in the simulation of an EPR spectrum from a high spin Cr(III) complex with the spin Hamiltonian parameters g(e) = 2.00, D = 0.10 cm(-1), E/D = 0.25, A(x) = 120.0, A(y) = 120.0, A(z) = 240.0 x 10(-4) cm(-1) requires a SOPHE grid size of N = 400 (to produce a good signal to noise ratio) and takes 229.47 s. In contrast the use of either the SOPHE interpolation scheme or the mosaic misorientation linewidth model requires a SOPHE grid size of only N = 18 and takes 44.08 and 0.79 s, respectively. Results from Sophe are transferred via the Common Object Request Broker Architecture (CORBA) to XSophe and subsequently to XeprView((R)) where the simulated CW EPR spectra (1D and 2D) can be compared to the experimental spectra. Energy level diagrams, transition roadmaps and transition surfaces aid the interpretation of complicated randomly oriented CW EPR spectra and can be viewed with a web browser and an OpenInventor scene graph viewer.