High-entropy dual functions over finite fields and locally decodable codes

We show that for infinitely many primes p, there exist dual functions of order k over Fnp that cannot be approximated in L∞-distance by polynomial phase functions of degree k−1. This answers in the negative a natural finite-field analog of a problem of Frantzikinakis on L∞-approximations of dual functions over N (a.k.a. multiple correlation sequences) by nilsequences

The tautological ring of Mg,n via Pandharipande-Pixton-Zvonkine r-spin relations

We use relations in the tautological ring of the moduli spaces Mg,n derived by Pandharipande, Pixton, and Zvonkine from the Givental formula for the r-spin Witten class in order to obtain some restrictions on the dimensions of the tautological rings of the open moduli spacesMg,n. In particular, we give a new proof for the result of Looijenga (for n = 1) and Buryak et al. (for n > 2) that dimRg-1(Mg,n) ≤ n. We also give a new proof of the result of Looijenga (for n = 1) and Ionel (for arbitrary n > 1) that Ri(Mg,n) = 0 for i > g and give some estimates for the dimension of Ri(Mg,n) for i ≤ g - 2

Bounding quantum-classical separations for classes of nonlocal games

We bound separations between the entangled and classical values for several classes of nonlocal t-player games. Our motivating question is whether there is a family of t-player XOR games for which the entangled bias is 1 but for which the classical bias goes down to 0, for fixed t. Answering this question would have important consequences in the study of multi-party communication complexity, as a positive answer would imply an unbounded separation between randomized communication complexity with and without entanglement. Our contribution to answering the question is identifying several general classes of games for which the classical bias can not go to zero when the entangled bias stays above a constant threshold. This rules out the possibility of using these games to answer our motivating question. A previously studied set of XOR games, known not to give a positive answer to the question, are those for which there is a quantum strategy that attains value 1 using a so-called Schmidt state. We generalize this class to mod-m games and show that their classical value is always at least 1m+m−1mt1−t. Secondly, for free XOR games, in which the input distribution is of product form, we show β(G)≥β∗(G)2t where β(G) and β∗(G) are the classical and entangled biases of the game respectively. We also introduce so-called line games, an example of which is a slight modification of the Magic Square game, and show that they can not give a positive answer to the question either. Finally we look at two-player unique games and show that if the entangled value is 1−ϵ then the classical value is at least 1−O(√ϵlogk) where k is the number of outputs in the game. Our proofs use semidefinite-programming techniques, the Gowers inverse theorem and hypergraph norms

Bounding quantum-classical separations for classes of nonlocal games

We bound separations between the entangled and classical values for several classes of nonlocal t-player games. Our motivating question is whether there is a family of t-player XOR games for which the entangled bias is 1 but for which the classical bias goes down to 0, for fixed t. Answering this question would have important consequences in the study of multi-party communication complexity, as a positive answer would imply an unbounded separation between randomized communication complexity with and without entanglement. Our contribution to answering the question is identifying several general classes of games for which the classical bias can not go to zero when the entangled bias stays above a constant threshold. This rules out the possibility of using these games to answer our motivating question. A previously studied set of XOR games, known not to give a positive answer to the question, are those for which there is a quantum strategy that attains value 1 using a so-called Schmidt state. We generalize this class to mod-m games and show that their classical value is always at least 1/m + (m-1)/m t^{1-t}. Secondly, for free XOR games, in which the input distribution is of product form, we show beta(G) >= beta^*(G)^{2^t} where beta(G) and beta^*(G) are the classical and entangled biases of the game respectively. We also introduce so-called line games, an example of which is a slight modification of the Magic Square game, and show that they can not give a positive answer to the question either. Finally we look at two-player unique games and show that if the entangled value is 1-epsilon then the classical value is at least 1-O(sqrt{epsilon log k}) where k is the number of outputs in the game. Our proofs use semidefinite-programming techniques, the Gowers inverse theorem and hypergraph norms

The ASOS Surgical Risk Calculator: development and validation of a tool for identifying African surgical patients at risk of severe postoperative complications

Background: The African Surgical Outcomes Study (ASOS) showed that surgical patients in Africa have a mortality twice the global average. Existing risk assessment tools are not valid for use in this population because the pattern of risk for poor outcomes differs from high-income countries. The objective of this study was to derive and validate a simple, preoperative risk stratification tool to identify African surgical patients at risk for in-hospital postoperative mortality and severe complications. Methods: ASOS was a 7-day prospective cohort study of adult patients undergoing surgery in Africa. The ASOS Surgical Risk Calculator was constructed with a multivariable logistic regression model for the outcome of in-hospital mortality and severe postoperative complications. The following preoperative risk factors were entered into the model; age, sex, smoking status, ASA physical status, preoperative chronic comorbid conditions, indication for surgery, urgency, severity, and type of surgery. Results: The model was derived from 8799 patients from 168 African hospitals. The composite outcome of severe postoperative complications and death occurred in 423/8799 (4.8%) patients. The ASOS Surgical Risk Calculator includes the following risk factors: age, ASA physical status, indication for surgery, urgency, severity, and type of surgery. The model showed good discrimination with an area under the receiver operating characteristic curve of 0.805 and good calibration with c-statistic corrected for optimism of 0.784. Conclusions: This simple preoperative risk calculator could be used to identify high-risk surgical patients in African hospitals and facilitate increased postoperative surveillance. © 2018 British Journal of Anaesthesia. Published by Elsevier Ltd. All rights reserved.Medical Research Council of South Africa gran