76 research outputs found
Quantum symmetries and exceptional collections
We study the interplay between discrete quantum symmetries at certain points
in the moduli space of Calabi-Yau compactifications, and the associated
identities that the geometric realization of D-brane monodromies must satisfy.
We show that in a wide class of examples, both local and compact, the monodromy
identities in question always follow from a single mathematical statement. One
of the simplest examples is the Z_5 symmetry at the Gepner point of the
quintic, and the associated D-brane monodromy identity
On quantum equivalence of dual sigma models: examples
The equivalence of several sigma models and their special Abelian
duals is investigated in the two loop order of perturbation theory. The
investigation is based on extracting and comparing various functions of
the original and dual models. The role of the discrete global symmetries is
emphasized.Comment: Plain TEX, 24 page
MIMO free-space optical communication employing subcarrier intensity modulation in atmospheric turbulence channels
In this paper, we analyse the error performance of transmitter/receiver array free-space optical (FSO) communication system employing binary phase shift keying (BPSK) subcarrier intensity modulation (SIM) in clear but turbulent atmospheric channel. Subcarrier modulation is employed to eliminate the need for adaptive threshold detector. Direct detection is employed at the receiver and each subcarrier is subsequently demodulated coherently. The effect of irradiance fading is mitigated with an array of lasers and photodetectors. The received signals are linearly combined using the optimal maximum ratio combining (MRC), the equal gain combining (EGC) and the selection combining (SelC). The bit error rate (BER) equations are derived considering additive white Gaussian noise and log normal intensity fluctuations. This work is part of the EU COST actions and EU projects
Approximate Deadline-Scheduling with Precedence Constraints
We consider the classic problem of scheduling a set of n jobs
non-preemptively on a single machine. Each job j has non-negative processing
time, weight, and deadline, and a feasible schedule needs to be consistent with
chain-like precedence constraints. The goal is to compute a feasible schedule
that minimizes the sum of penalties of late jobs. Lenstra and Rinnoy Kan
[Annals of Disc. Math., 1977] in their seminal work introduced this problem and
showed that it is strongly NP-hard, even when all processing times and weights
are 1. We study the approximability of the problem and our main result is an
O(log k)-approximation algorithm for instances with k distinct job deadlines
Exceptional collections and D-branes probing toric singularities
We demonstrate that a strongly exceptional collection on a singular toric
surface can be used to derive the gauge theory on a stack of D3-branes probing
the Calabi-Yau singularity caused by the surface shrinking to zero size. A
strongly exceptional collection, i.e., an ordered set of sheaves satisfying
special mapping properties, gives a convenient basis of D-branes. We find such
collections and analyze the gauge theories for weighted projective spaces, and
many of the Y^{p,q} and L^{p,q,r} spaces. In particular, we prove the strong
exceptionality for all p in the Y^{p,p-1} case, and similarly for the
Y^{p,p-2r} case.Comment: 49 pages, 6 figures; v2 refs added; v3 published versio
A Two-loop Test of Buscher's T-duality I
We study the two loop quantum equivalence of sigma models related by
Buscher's T-duality transformation. The computation of the two loop
perturbative free energy density is performed in the case of a certain
deformation of the SU(2) principal sigma model, and its T-dual, using
dimensional regularization and the geometric sigma model perturbation theory.
We obtain agreement between the free energy density expressions of the two
models.Comment: 28 pp, Latex, references adde
The Complexity of the Empire Colouring Problem
We investigate the computational complexity of the empire colouring problem
(as defined by Percy Heawood in 1890) for maps containing empires formed by
exactly countries each. We prove that the problem can be solved in
polynomial time using colours on maps whose underlying adjacency graph has
no induced subgraph of average degree larger than . However, if , the problem is NP-hard even if the graph is a forest of paths of arbitrary
lengths (for any , provided .
Furthermore we obtain a complete characterization of the problem's complexity
for the case when the input graph is a tree, whereas our result for arbitrary
planar graphs fall just short of a similar dichotomy. Specifically, we prove
that the empire colouring problem is NP-hard for trees, for any , if
(and polynomial time solvable otherwise). For arbitrary
planar graphs we prove NP-hardness if for , and , for . The result for planar graphs also proves the NP-hardness of colouring
with less than 7 colours graphs of thickness two and less than colours
graphs of thickness .Comment: 23 pages, 12 figure
- …