PTAS for Minimax Approval Voting

We consider Approval Voting systems where each voter decides on a subset to candidates he/she approves. We focus on the optimization problem of finding the committee of fixed size k minimizing the maximal Hamming distance from a vote. In this paper we give a PTAS for this problem and hence resolve the open question raised by Carragianis et al. [AAAI'10]. The result is obtained by adapting the techniques developed by Li et al. [JACM'02] originally used for the less constrained Closest String problem. The technique relies on extracting information and structural properties of constant size subsets of votes.Comment: 15 pages, 1 figur

Equivariant Giambelli and determinantal restriction formulas for the Grassmannian

The main result of the paper is a determinantal formula for the restriction to a torus fixed point of the equivariant class of a Schubert subvariety in the torus equivariant integral cohomology ring of the Grassmannian. As a corollary, we obtain an equivariant version of the Giambelli formula.Comment: 16 pages, 3 figures, LaTex, uses epsfig and psfrag; for the revised version: title changed; Proof of Theorem 3 changed; 3 references added and 1 deleted; other minor change

Quantum versus Semiclassical Description of Selftrapping: Anharmonic Effects

Selftrapping has been traditionally studied on the assumption that quasiparticles interact with harmonic phonons and that this interaction is linear in the displacement of the phonon. To complement recent semiclassical studies of anharmonicity and nonlinearity in this context, we present below a fully quantum mechanical analysis of a two-site system, where the oscillator is described by a tunably anharmonic potential, with a square well with infinite walls and the harmonic potential as its extreme limits, and wherein the interaction is nonlinear in the oscillator displacement. We find that even highly anharmonic polarons behave similar to their harmonic counterparts in that selftrapping is preserved for long times in the limit of strong coupling, and that the polaronic tunneling time scale depends exponentially on the polaron binding energy. Further, in agreement, with earlier results related to harmonic polarons, the semiclassical approximation agrees with the full quantum result in the massive oscillator limit of small oscillator frequency and strong quasiparticle-oscillator coupling.Comment: 10 pages, 6 figures, to appear in Phys. Rev.

Packet flow analysis in IP networks via abstract interpretation

Static analysis (aka offline analysis) of a model of an IP network is useful for understanding, debugging, and verifying packet flow properties of the network. There have been static analysis approaches proposed in the literature for networks based on model checking as well as graph reachability. Abstract interpretation is a method that has typically been applied to static analysis of programs. We propose a new, abstract-interpretation based approach for analysis of networks. We formalize our approach, mention its correctness guarantee, and demonstrate its flexibility in addressing multiple network-analysis problems that have been previously solved via tailor-made approaches. Finally, we investigate an application of our analysis to a novel problem -- inferring a high-level policy for the network -- which has been addressed in the past only in the restricted single-router setting.Comment: 8 page

Parametrized Complexity of Weak Odd Domination Problems

Given a graph $G=(V,E)$, a subset $B\subseteq V$ of vertices is a weak odd dominated (WOD) set if there exists $D \subseteq V {\setminus} B$ such that every vertex in $B$ has an odd number of neighbours in $D$. $\kappa(G)$ denotes the size of the largest WOD set, and $\kappa'(G)$ the size of the smallest non-WOD set. The maximum of $\kappa(G)$ and $|V|-\kappa'(G)$, denoted $\kappa_Q(G)$, plays a crucial role in quantum cryptography. In particular deciding, given a graph $G$ and $k>0$, whether $\kappa_Q(G)\le k$ is of practical interest in the design of graph-based quantum secret sharing schemes. The decision problems associated with the quantities $\kappa$, $\kappa'$ and $\kappa_Q$ are known to be NP-Complete. In this paper, we consider the approximation of these quantities and the parameterized complexity of the corresponding problems. We mainly prove the fixed-parameter intractability (W$[1]$-hardness) of these problems. Regarding the approximation, we show that $\kappa_Q$, $\kappa$ and $\kappa'$ admit a constant factor approximation algorithm, and that $\kappa$ and $\kappa'$ have no polynomial approximation scheme unless P=NP.Comment: 16 pages, 5 figure

Generation of arbitrary Dicke states in spinor Bose-Einstein condensates

We demonstrate that the combination of two-body collisions and applied Rabi pulses makes it possible to prepare arbitrary Dicke (spin) states as well as maximally entangled states by appropriate sequencing of external fields.Comment: 5 pages, 2 figure