Arithmetic Circuit Lower Bounds via MaxRank

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against several classes of non-multilinear arithmetic circuits. In particular, we obtain the following results : As our main result, we prove that any homogeneous depth-3 circuit for computing the product of $d$ matrices of dimension $n \times n$ requires $\Omega(n^{d-1}/2^d)$ size. This improves the lower bounds by Nisan and Wigderson(1995) when $d=\omega(1)$. There is an explicit polynomial on $n$ variables and degree at most $\frac{n}{2}$ for which any depth-3 circuit $C$ of product dimension at most $\frac{n}{10}$ (dimension of the space of affine forms feeding into each product gate) requires size $2^{\Omega(n)}$. This generalizes the lower bounds against diagonal circuits proved by Saxena(2007). Diagonal circuits are of product dimension 1. We prove a $n^{\Omega(\log n)}$ lower bound on the size of product-sparse formulas. By definition, any multilinear formula is a product-sparse formula. Thus, our result extends the known super-polynomial lower bounds on the size of multilinear formulas by Raz(2006). We prove a $2^{\Omega(n)}$ lower bound on the size of partitioned arithmetic branching programs. This result extends the known exponential lower bound on the size of ordered arithmetic branching programs given by Jansen(2008).Comment: 22 page

Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits

In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree $n$ in $n^2$ variables such that any homogeneous depth 4 arithmetic circuit computing it must have size $n^{\Omega(\log \log n)}$. Our results extend the works of Nisan-Wigderson [NW95] (which showed superpolynomial lower bounds for homogeneous depth 3 circuits), Gupta-Kamath-Kayal-Saptharishi and Kayal-Saha-Saptharishi [GKKS13, KSS13] (which showed superpolynomial lower bounds for homogeneous depth 4 circuits with bounded bottom fan-in), Kumar-Saraf [KS13a] (which showed superpolynomial lower bounds for homogeneous depth 4 circuits with bounded top fan-in) and Raz-Yehudayoff and Fournier-Limaye-Malod-Srinivasan [RY08, FLMS13] (which showed superpolynomial lower bounds for multilinear depth 4 circuits). Several of these results in fact showed exponential lower bounds. The main ingredient in our proof is a new complexity measure of {\it bounded support} shifted partial derivatives. This measure allows us to prove exponential lower bounds for homogeneous depth 4 circuits where all the monomials computed at the bottom layer have {\it bounded support} (but possibly unbounded degree/fan-in), strengthening the results of Gupta et al and Kayal et al [GKKS13, KSS13]. This new lower bound combined with a careful "random restriction" procedure (that transforms general depth 4 homogeneous circuits to depth 4 circuits with bounded support) gives us our final result

Other‐Sacrificing Options

I argue that you can be permitted to discount the interests of your adversaries even though doing so would be impartially suboptimal. This means that, in addition to the kinds of moral options that the literature traditionally recognises, there exist what I call other-sacrificing options. I explore the idea that you cannot discount the interests of your adversaries as much as you can favour the interests of your intimates; if this is correct, then there is an asymmetry between negative partiality toward your adversaries and positive partiality toward your intimates

Near-threshold high-order harmonic spectroscopy with aligned molecules

We study high-order harmonic generation in aligned molecules close to the ionization threshold. Two distinct contributions to the harmonic signal are observed, which show very different responses to molecular alignment and ellipticity of the driving field. We perform a classical electron trajectory analysis, taking into account the significant influence of the Coulomb potential on the strong-field-driven electron dynamics. The two contributions are related to primary ionization and excitation processes, offering a deeper understanding of the origin of high harmonics near the ionization threshold. This work shows that high harmonic spectroscopy can be extended to the near-threshold spectral range, which is in general spectroscopically rich.Comment: 4 pages, 4 figure

New Approximability Results for the Robust k-Median Problem

We consider a robust variant of the classical $k$-median problem, introduced by Anthony et al. \cite{AnthonyGGN10}. In the \emph{Robust $k$-Median problem}, we are given an $n$-vertex metric space $(V,d)$ and $m$ client sets $\set{S_i \subseteq V}_{i=1}^m$. The objective is to open a set $F \subseteq V$ of $k$ facilities such that the worst case connection cost over all client sets is minimized; in other words, minimize $\max_{i} \sum_{v \in S_i} d(F,v)$. Anthony et al.\ showed an $O(\log m)$ approximation algorithm for any metric and APX-hardness even in the case of uniform metric. In this paper, we show that their algorithm is nearly tight by providing $\Omega(\log m/ \log \log m)$ approximation hardness, unless ${\sf NP} \subseteq \bigcap_{\delta >0} {\sf DTIME}(2^{n^{\delta}})$. This hardness result holds even for uniform and line metrics. To our knowledge, this is one of the rare cases in which a problem on a line metric is hard to approximate to within logarithmic factor. We complement the hardness result by an experimental evaluation of different heuristics that shows that very simple heuristics achieve good approximations for realistic classes of instances.Comment: 19 page

Simple extractors via constructions of cryptographic pseudo-random generators

Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-random generators from one-way permutations (the Blum-Micali-Yao approach) can be used for building extractors as well. Using this new technique we build extractors that do not use designs and polynomial-based error-correcting codes and that are very simple and efficient. For example, one extractor produces each output bit separately in $O(\log^2 n)$ time. These extractors work for weak sources with min entropy $\lambda n$, for arbitrary constant $\lambda > 0$, have seed length $O(\log^2 n)$, and their output length is $\approx n^{\lambda/3}$.Comment: 21 pages, an extended abstract will appear in Proc. ICALP 2005; small corrections, some comments and references adde

Interactions of asbestos-activated macrophages with an experimental fibrosarcoma

Supernatants from in vivo asbestos-activated macrophages failed to show any cytostatic activity against a syngeneic fibrosarcoma cell line in vitro. UICC chrysotile-induced peritoneal exudate cells also failed to demonstrate any growth inhibitory effect on the same cells in Winn assays of tumor growth. Mixing UICC crocidolite with inoculated tumor cells resulted in a dose-dependent inhibition of tumor growth; this could, however, be explained by a direct cytostatic effect on the tumor cells of high doses of crocidolite, which was observed in vitro

The Range of Topological Effects on Communication

We continue the study of communication cost of computing functions when inputs are distributed among $k$ processors, each of which is located at one vertex of a network/graph called a terminal. Every other node of the network also has a processor, with no input. The communication is point-to-point and the cost is the total number of bits exchanged by the protocol, in the worst case, on all edges. Chattopadhyay, Radhakrishnan and Rudra (FOCS'14) recently initiated a study of the effect of topology of the network on the total communication cost using tools from $L_1$ embeddings. Their techniques provided tight bounds for simple functions like Element-Distinctness (ED), which depend on the 1-median of the graph. This work addresses two other kinds of natural functions. We show that for a large class of natural functions like Set-Disjointness the communication cost is essentially $n$ times the cost of the optimal Steiner tree connecting the terminals. Further, we show for natural composed functions like $\text{ED} \circ \text{XOR}$ and $\text{XOR} \circ \text{ED}$, the naive protocols suggested by their definition is optimal for general networks. Interestingly, the bounds for these functions depend on more involved topological parameters that are a combination of Steiner tree and 1-median costs. To obtain our results, we use some new tools in addition to ones used in Chattopadhyay et. al. These include (i) viewing the communication constraints via a linear program; (ii) using tools from the theory of tree embeddings to prove topology sensitive direct sum results that handle the case of composed functions and (iii) representing the communication constraints of certain problems as a family of collection of multiway cuts, where each multiway cut simulates the hardness of computing the function on the star topology

Light GUT Triplets and Yukawa Splitting

Triplet-mediated proton decay in Grand Unified Theories (GUTs) is usually suppressed by arranging a large triplet mass. Here we explore instead a mechanism for suppressing the couplings of the triplets to the first and second generations compared to the Yukawa couplings, so that the triplets' mass can be below the GUT scale. This mechanism is based on a ``triplet symmetry'' in the context of product-group GUTs. We study two possibilities. One, which requires the top Yukawa to arise from a non-renormalizable operator at the GUT scale, is that all triplet couplings to matter are negligible, so that the triplets can be at the weak scale. The second is that some triplet couplings, and in particular $T t b$ and $T \bar{t} \bar{l}$, are equal to the corresponding Yukawa couplings. This would give a distinct signature of grand unification if the triplets were sufficiently light. However, we derive a model-independent bound on the triplet mass in this case, which is at least 10$^6$GeV. Finally, we construct a GUT model based on Yukawa splitting, with the triplets at 10$^{14}$GeV, as required for coupling unification to work.Comment: 5 pages, Revtex4, 1 EPS figure. To appear in PRD: Minor changes. Appendix droppe

Evaluation of the Multiplane Method for Efficient Simulations of Reaction Networks

Reaction networks in the bulk and on surfaces are widespread in physical, chemical and biological systems. In macroscopic systems, which include large populations of reactive species, stochastic fluctuations are negligible and the reaction rates can be evaluated using rate equations. However, many physical systems are partitioned into microscopic domains, where the number of molecules in each domain is small and fluctuations are strong. Under these conditions, the simulation of reaction networks requires stochastic methods such as direct integration of the master equation. However, direct integration of the master equation is infeasible for complex networks, because the number of equations proliferates as the number of reactive species increases. Recently, the multiplane method, which provides a dramatic reduction in the number of equations, was introduced [A. Lipshtat and O. Biham, Phys. Rev. Lett. 93, 170601 (2004)]. The reduction is achieved by breaking the network into a set of maximal fully connected sub-networks (maximal cliques). Lower-dimensional master equations are constructed for the marginal probability distributions associated with the cliques, with suitable couplings between them. In this paper we test the multiplane method and examine its applicability. We show that the method is accurate in the limit of small domains, where fluctuations are strong. It thus provides an efficient framework for the stochastic simulation of complex reaction networks with strong fluctuations, for which rate equations fail and direct integration of the master equation is infeasible. The method also applies in the case of large domains, where it converges to the rate equation results