WRC Update: Back Pay for More than 110,000 Workers in Bangalore

This document is part of a digital collection provided by the Martin P. Catherwood Library, ILR School, Cornell University, pertaining to the effects of globalization on the workplace worldwide. Special emphasis is placed on labor rights, working conditions, labor market changes, and union organizing.WRC_Remediation_of_Minimum_Wage_Violations_in_Bangalore.pdf: 52 downloads, before Oct. 1, 2020

Sculpting Quantum Speedups

Given a problem which is intractable for both quantum and classical algorithms, can we find a sub-problem for which quantum algorithms provide an exponential advantage? We refer to this problem as the "sculpting problem." In this work, we give a full characterization of sculptable functions in the query complexity setting. We show that a total function f can be restricted to a promise P such that Q(f|_P)=O(polylog(N)) and R(f|_P)=N^{Omega(1)}, if and only if f has a large number of inputs with large certificate complexity. The proof uses some interesting techniques: for one direction, we introduce new relationships between randomized and quantum query complexity in various settings, and for the other direction, we use a recent result from communication complexity due to Klartag and Regev. We also characterize sculpting for other query complexity measures, such as R(f) vs. R_0(f) and R_0(f) vs. D(f). Along the way, we prove some new relationships for quantum query complexity: for example, a nearly quadratic relationship between Q(f) and D(f) whenever the promise of f is small. This contrasts with the recent super-quadratic query complexity separations, showing that the maximum gap between classical and quantum query complexities is indeed quadratic in various settings - just not for total functions! Lastly, we investigate sculpting in the Turing machine model. We show that if there is any BPP-bi-immune language in BQP, then every language outside BPP can be restricted to a promise which places it in PromiseBQP but not in PromiseBPP. Under a weaker assumption, that some problem in BQP is hard on average for P/poly, we show that every paddable language outside BPP is sculptable in this way.Comment: 30 page

A Correspondence Between Distances and Embeddings for Manifolds: New Techniques for Applications of the Abstract Boundary

We present a one-to-one correspondence between equivalence classes of embeddings of a manifold (into a larger manifold of the same dimension) and equivalence classes of certain distances on the manifold. This correspondence allows us to use the Abstract Boundary to describe the structure of the `edge' of our manifold without resorting to structures external to the manifold itself. This is particularly important in the study of singularities within General Relativity where singularities lie on this `edge'. The ability to talk about the same objects, e.g., singularities, via different structures provides alternative routes for investigation which can be invaluable in the pursuit of physically motivated problems where certain types of information are unavailable or difficult to use.Comment: 23 page

The 2-Factor Polynomial Detects Even Perfect Matchings

In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of 2- factors that contain the the perfect matching as a subgraph. Consequently, we show that the polynomial detects even perfect matchings.Comment: 16 pages, 17 figure

Lifting Lagrangian immersions in CPn−1\mathbb{C} P^{n-1} to Lagrangian cones in Cn\mathbb{C}^n

In this paper we show how to lift Lagrangian immersions in $\mathbb{C} P^{n-1}$ to produce Lagrangian cones in $\mathbb{C} ^n$, and use this process to produce several families of examples of Lagrangian cones and special Lagrangian cones. Moreover we show how to produce Lagrangian cones, isotopic to the Harvey-Lawson and trivial cones, whose projections to $\mathbb{C} P^{n-1}$ are immersions with few transverse double points.Comment: 28 Pages, 7 figure