Lower bounds on the size of semidefinite programming relaxations

We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the linear image of the feasible region of any SDP (i.e., any spectrahedron) of dimension less than $2^{n^c}$, for some constant $c > 0$. This result yields the first super-polynomial lower bounds on the semidefinite extension complexity of any explicit family of polytopes. Our results follow from a general technique for proving lower bounds on the positive semidefinite rank of a matrix. To this end, we establish a close connection between arbitrary SDPs and those arising from the sum-of-squares SDP hierarchy. For approximating maximum constraint satisfaction problems, we prove that SDPs of polynomial-size are equivalent in power to those arising from degree-$O(1)$ sum-of-squares relaxations. This result implies, for instance, that no family of polynomial-size SDP relaxations can achieve better than a 7/8-approximation for MAX-3-SAT

Non-Paraxial Accelerating Beams

We present the spatially accelerating solutions of the Maxwell equations. Such non-paraxial beams accelerate in a circular trajectory, thus generalizing the concept of Airy beams. For both TE and TM polarizations, the beams exhibit shape-preserving bending with sub-wavelength features, and the Poynting vector of the main lobe displays a turn of more than 90 degrees. We show that these accelerating beams are self-healing, analyze their properties, and compare to the paraxial Airy beams. Finally, we present the new family of periodic accelerating beams which can be constructed from our solutions

Some Controversial Opinions on Software-Defined Data Plane Services

Several recent proposals, namely Software Defined Networks (SDN), Network Functions Virtualization (NFV) and Network Service Chaining (NSC), aim to transform the network into a programmable platform, focusing respectively on the control plane (SDN) and on the data plane (NFV/NSC). This paper sits on the same line of the NFV/NSC proposals but with a more long-term horizon, and it presents its considerations on some controversial aspects that arise when considering the programmability of the data plane. Particularly, this paper discusses the relevance of data plane vs control plane services, the importance of the hardware platform, and the necessity to standardize northbound and southbound interfaces in future software-defined data plane service

Field theoretic approach to the counting problem of Hamiltonian cycles of graphs

A Hamiltonian cycle of a graph is a closed path that visits each site once and only once. I study a field theoretic representation for the number of Hamiltonian cycles for arbitrary graphs. By integrating out quadratic fluctuations around the saddle point, one obtains an estimate for the number which reflects characteristics of graphs well. The accuracy of the estimate is verified by applying it to 2d square lattices with various boundary conditions. This is the first example of extracting meaningful information from the quadratic approximation to the field theory representation.Comment: 5 pages, 3 figures, uses epsf.sty. Estimates for the site entropy and the gamma exponent indicated explicitl

The Effect of Neutral Atoms on Capillary Discharge Z-pinch

We study the effect of neutral atoms on the dynamics of a capillary discharge Z-pinch, in a regime for which a large soft-x-ray amplification has been demonstrated. We extended the commonly used one-fluid magneto-hydrodynamics (MHD) model by separating out the neutral atoms as a second fluid. Numerical calculations using this extended model yield new predictions for the dynamics of the pinch collapse, and better agreement with known measured data.Comment: 4 pages, 4 postscript figures, to be published in Phys. Rev. Let

Mirror Descent and Convex Optimization Problems With Non-Smooth Inequality Constraints

We consider the problem of minimization of a convex function on a simple set with convex non-smooth inequality constraint and describe first-order methods to solve such problems in different situations: smooth or non-smooth objective function; convex or strongly convex objective and constraint; deterministic or randomized information about the objective and constraint. We hope that it is convenient for a reader to have all the methods for different settings in one place. Described methods are based on Mirror Descent algorithm and switching subgradient scheme. One of our focus is to propose, for the listed different settings, a Mirror Descent with adaptive stepsizes and adaptive stopping rule. This means that neither stepsize nor stopping rule require to know the Lipschitz constant of the objective or constraint. We also construct Mirror Descent for problems with objective function, which is not Lipschitz continuous, e.g. is a quadratic function. Besides that, we address the problem of recovering the solution of the dual problem

The effects of the pre-pulse on capillary discharge extreme ultraviolet laser

In the past few years collisionally pumped extreme ultraviolet (XUV) lasers utilizing a capillary discharge were demonstrated. An intense current pulse is applied to a gas filled capillary, inducing magnetic collapse (Z-pinch) and formation of a highly ionized plasma column. Usually, a small current pulse (pre-pulse) is applied to the gas in order to pre-ionize it prior to the onset of the main current pulse. In this paper we investigate the effects of the pre-pulse on a capillary discharge Ne-like Ar XUV laser (46.9nm). The importance of the pre-pulse in achieving suitable initial conditions of the gas column and preventing instabilities during the collapse is demonstrated. Furthermore, measurements of the amplified spontaneous emission (ASE) properties (intensity, duration) in different pre-pulse currents revealed unexpected sensitivity. Increasing the pre-pulse current by a factor of two caused the ASE intensity to decrease by an order of magnitude - and to nearly disappear. This effect is accompanied by a slight increase in the lasing duration. We attribute this effect to axial flow in the gas during the pre-pulse.Comment: 4 pages, 4 figure