Items where department is "Mathematics"

University Structure (106206) LSE (106206) Academic Departments (62869) Mathematics (1461)
Number of items: 71.
Article
  • Al Motairi, Hessah, Zervos, Mihail (2017). Irreversible capital accumulation with economic impact. Applied Mathematics and Optimization, 75(3), 525-551. https://doi.org/10.1007/s00245-016-9341-9
  • Allen, Peter, Böttcher, Julia, Cooley, Oliver, Mycroft, Richard (2017). Tight cycles and regular slices in dense hypergraphs. Journal of Combinatorial Theory, Series A, 149, 30-100. https://doi.org/10.1016/j.jcta.2017.01.003
  • Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu, Morris, Robert (2017). Chromatic thresholds in dense random graphs. Random Structures and Algorithms, 51(2), 185 - 214. https://doi.org/10.1002/rsa.20708
  • Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu, Morris, Robert (2017). Chromatic thresholds in sparse random graphs. Random Structures and Algorithms, 51(2), 215-236. https://doi.org/10.1002/rsa.20709
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana (2017). Packing degenerate graphs greedily. Electronic Notes in Discrete Mathematics, 61, 45-51. https://doi.org/10.1016/j.endm.2017.06.019
  • Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury (2017). Powers of Hamilton cycles in pseudorandom graphs. Combinatorica, 37(4), 573-616. https://doi.org/10.1007/s00493-015-3228-2
  • Allen, Peter, Böttcher, Julia, Kohayakawa, Yoshiharu, Roberts, Barnaby (2017). Triangle-free subgraphs of random graphs. Combinatorics, Probability and Computing, 27(2), 141-161. https://doi.org/10.1017/S0963548317000219
  • Anthony, Martin, Boros, Endre, Crama, Yves, Gruber, Aritanan (2017). Quadratic reformulations of nonlinear binary optimization problems. Mathematical Programming, 162(1), 115-144. https://doi.org/10.1007/s10107-016-1032-4
  • Anthony, Martin, Ratsaby, Joel (2017). Classification based on prototypes with spheres of influence. Information and Computation, 256, 372-380. https://doi.org/10.1016/j.ic2017.08.004
  • Atminas, Aistis, Lozin, Vadim, Moshkov, Mikhail (2017). WQO is decidable for factorial languages. Information and Computation, https://doi.org/10.1016/j.ic.2017.08.001
  • Balogh, József, Mousset, Frank, Skokan, Jozef (2017). Stability for vertex cycle covers. Electronic Journal of Combinatorics, 24(3).
  • Barmpalias, George, Lewis-Pye, Andrew (2017). Computing halting probabilities from other halting probabilities. Theoretical Computer Science, 660, 16-22. https://doi.org/10.1016/j.tcs.2016.11.013
  • Barmpalias, George, Lewis-Pye, Andrew (2017). Differences of halting probabilities. Journal of Computer and System Sciences, 89, 349-360. https://doi.org/10.1016/j.jcss.2017.06.002
  • Barmpalias, George, Lewis-Pye, Andrew (2017). Optimal redundancy in computations from random oracles. Journal of Computer and System Sciences, https://doi.org/10.1016/j.jcss.2017.06.009
  • Biggs, Norman (2017). Chromatic polynomials and toroidal graphs. Australasian Journal of Combinatorics, 67(2), 235-242.
  • Bingham, N. H., Ostaszewski, A. J. (2017). Additivity, subadditivity and linearity: automatic continuity and quantifier weakening. Indagationes Mathematicae, 29(2), 687-713. https://doi.org/10.1016/j.indag.2017.11.005
  • Bingham, N. H., Ostaszewski, Adam (2017). Category-measure duality: convexity, mid-point convexity and Berz sublinearity. Aequationes Mathematicae, 91(5), 801-836. https://doi.org/10.1007/s00010-017-0486-7
  • Brightwell, Graham, Janson, Svante, Luczak, Malwina (2017). The greedy independent set in a random graph with given degrees. Random Structures and Algorithms, 51(4), 565 - 586. https://doi.org/10.1002/rsa.20716
  • Böttcher, Julia, Montgomery, Richard, Parczyk, Olaf, Person, Yury (2017). Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electronic Notes in Discrete Mathematics, 61, 155-161. https://doi.org/10.1016/j.endm.2017.06.033
  • Cabrales, Antonio, Gossner, Olivier, Serrano, Roberto (2017). A normalized value for information purchases. Journal of Economic Theory, 170, 266-288. https://doi.org/10.1016/j.jet.2017.05.007
  • Czichowsky, Christoph, Schachermayer, Walter (2017). Portfolio optimisation beyond semimartingales: shadowprices and fractional Brownian motion. Annals of Applied Probability, 27(3), 1414-1451. https://doi.org/10.1214/16-AAP1234
  • Czichowsky, Christoph, Schachermayer, Walter, Yang, Junjian (2017). Shadow prices for continuous processes. Mathematical Finance, 27(3), 623-658. https://doi.org/10.1111/mafi.12103
  • Davies, Ewan, Jenssen, Matthew, Perkins, Will, Roberts, Barnaby (2017). Independent sets, matchings, and occupancy fractions. Journal of the London Mathematical Society, 96(1), 47-66. https://doi.org/10.1112/jlms.12056
  • Davies, Ewan, Jenssen, Matthew, Perkins, Will, Roberts, Barnaby (2017). On the average size of independent sets in triangle-free graphs. Proceedings of the American Mathematical Society, 146(1), 111-124. https://doi.org/10.1090/proc/13728
  • Davies, Ewan, Jenssen, Matthew, Roberts, Barnaby (2017). Multicolour Ramsey numbers of paths and even cycles. European Journal of Combinatorics, 63, 124-133. https://doi.org/10.1016/j.ejc.2017.03.002
  • Davies, Ewan, Jenssen, Matthew, Roberts, Barnaby, Perkins, Will (2017). Tight bounds on the coefficients of partition functions via stability. Electronic Notes in Discrete Mathematics, 61, 317-321. https://doi.org/10.1016/j.endm.2017.06.054
  • Dütting, Paul, Gkatzelis, Vasilis, Roughgarden, Tim (2017). The performance of deferred-acceptance auctions. Mathematics of Operations Research, 42(4), 897-914. https://doi.org/10.1287/moor.2016.0835
  • Dütting, Paul, Talgam-Cohen, Inbal, Roughgarden, Tim (2017). Modularity and greed in double auctions. Games and Economic Behavior, 105, 59-83. https://doi.org/10.1016/j.geb.2017.06.008
  • Gapeev, Pavel V., Stoev, Yavor I. (2017). On the Laplace transforms of the first exit times in one-dimensional non-affine jump–diffusion models. Statistics and Probability Letters, 121, 152-162. https://doi.org/10.1016/j.spl.2016.10.011
  • Gapeev, Pavel V., Stoev, Yavor I. (2017). On the construction of non-affine jump-diffusion models. Stochastic Analysis and Applications, 35(5), 900-918. https://doi.org/10.1080/07362994.2017.1333008
  • Gapeev, Pavel V., Stoev, Yavor I. (2017). On the sequential testing and quickest change-pointdetection problems for Gaussian processes. Stochastics: an International Journal of Probability and Stochastic Processes, https://doi.org/10.1080/17442508.2017.1284222
  • Gaspers, Serge, Sorkin, Gregory B. (2017). Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. ACM Transactions on Algorithms, 13(4), 1-36. https://doi.org/10.1145/3111499
  • Karatzas, Ioannis, Ruf, Johannes (2017). Trading strategies generated by Lyapunov functions. Finance and Stochastics, https://doi.org/10.1007/s00780-017-0332-8
  • Lewis-Pye, Andrew, Montalbán, Antonio (2017). Sex versus asex: an analysis of the role of variance conversion. Theoretical Population Biology, 114, 128-135. https://doi.org/10.1016/j.tpb.2017.01.002
  • Lo, Allan, Patel, Viresh, Skokan, Jozef, Talbot, John (2017). Decomposing tournaments into paths. Electronic Notes in Discrete Mathematics, 61, 813-818. https://doi.org/10.1016/j.endm.2017.07.040
  • Martin, Ryan R., Mycroft, Richard, Skokan, Jozef (2017). An asymptotic multipartite Kühn-Osthus theorem. SIAM Journal on Discrete Mathematics, 31(3), 1498-1513. https://doi.org/10.1137/16M1070621
  • Martin, Ryan R., Skokan, Jozef (2017). Asymptotic multipartite version of the Alon–Yuster theorem. Journal of Combinatorial Theory, Series B, 127, 32-52. https://doi.org/10.1016/j.jctb.2017.05.004
  • Mortini, Raymond, Rupp, Rudolf, Sasane, Amol (2017). On the Krull intersection theorem in function algebras. Quaestiones Mathematicae, 40(3), 363-380. https://doi.org/10.2989/16073606.2017.1289482
  • Naszódi, Márton, Pach, János, Swanepoel, Konrad (2017). Arrangements of homothets of a convex body. Mathematika, 63(2), 696 - 710. https://doi.org/10.1112/S0025579317000122
  • Olver, Neil, Zenklusen, Rico (2017). Chain-constrained spanning trees. Mathematical Programming, 167(2), 293 - 314. https://doi.org/10.1007/s10107-017-1126-7 picture_as_pdf
  • Ras, Charl J., Swanepoel, Konrad J., Thomas, Doreen (2017). Approximate Euclidean Steiner trees. Journal of Optimization Theory and Applications, 172(3), 845-873. https://doi.org/10.1007/s10957-016-1036-5
  • Roberts, Barnaby (2017). Ramsey numbers of connected clique matchings. Electronic Journal of Combinatorics, 24(1), P1.36.
  • Rodosthenous, Neofytos, Zervos, Mihail (2017). Watermark options. Finance and Stochastics, 21(1), 157-186. https://doi.org/10.1007/s00780-016-0319-x
  • Ruf, Johannes (2017). Piecewise constant local martingales with bounded numbers of jumps. Electronic Communications in Probability, 22(31). https://doi.org/10.1214/17-ECP64
  • Urusov, Mikhail, Zervos, Mihail (2017). Necessary and sufficient conditions for the r-excessive local martingales to be martingales. Electronic Communications in Probability, 22(10), 1-6. https://doi.org/10.1214/17-ECP42
  • van den Heuvel, Jan, Ossona de Mendez, Patrice, Quiroz, Daniel, Rabinovich, Roman, Siebertz, Sebastian (2017). On the generalised colouring numbers of graphs that exclude a fixed minor. European Journal of Combinatorics, 66, 129-144. https://doi.org/10.1016/j.ejc.2017.06.019
    • Chapter
  • Barmpalias, George, Lewis-Pye, Andrew (2017). Limits of the Kucera-Gacs coding method. In Post-proceedings volume of SEALS 2016 (South Eastern Logic Symposium) . World Scientific (Firm). picture_as_pdf
  • Barmpalias, George, Lewis-Pye, Andrew (2017). A note on the differences of computably enumerable reals. In Day, Adam, Fellows, Michael, Greenberg, Noam, Khoussainov, Bakhadyr, Melnikov, Alexander, Rosamond, Frances (Eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday (pp. 623-632). Springer International (Firm). https://doi.org/10.1007/978-3-319-50062-1_37
  • Batu, Tugkan, Canonne, Clément L. (2017). Generalized uniformity testing. In Proceedings of the Annual Symposium on Foundations of Computer Science (pp. 880-889). IEEE Computer Society. https://doi.org/10.1109/FOCS.2017.86
  • Böttcher, Julia (2017). Large-scale structures in random graphs. In Claesson, Anders, Dukes, Mark, Kitaev, Sergei, Manlove, David, Meeks, Kitty (Eds.), Surveys in Combinatorics 2017 (pp. 87-140). Cambridge University Press. https://doi.org/10.1017/9781108332699.003
  • Cominetti, Roberto, Correa, Jose, Olver, Neil (2017). Long term behavior of dynamic equilibria in fluid queuing networks. In IPCO: International Conference on Integer Programming and Combinatorial Optimization (pp. 161-172). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-319-59250-3_14
  • Dütting, Paul, Feldman, Michal, Kesselheim, Thomas, Lucier, Brendan (2017). Prophet inequalities made easy: stochastic optimization by pricing non-stochastic input. In Umans, Chris (Ed.), Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science . IEEE Computer Society. https://doi.org/10.1109/FOCS.2017.56 picture_as_pdf
  • Dütting, Paul, Kesselheim, Thomas (2017). Best-response dynamics in combinatorial auctions with item bidding. In Klein, Philip N. (Ed.), Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 521-533). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.33
  • Ene, Alina, Nguyen, Huy, Végh, László A. (2017). Decomposable submodular function minimization: discrete and continuous. In Guyon, I., Luxburg, U. V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (Eds.), Advances in Neural Information Processing Systems 30 (NIPS 2017) pre-proceedings . Neural Information Processing Systems Foundation.
  • Joswig, Michael, Loho, Georg, Lorenz, Benjamin, Raber, Rico (2017). MatchTheNet: an educational game on 3-dimensional polytopes. In Aronov, Boris, Katz, Matthew J. (Eds.), 33rd International Symposium on Computational Geometry (SoCG'2017) (pp. 66:1-66:5). Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.SoCG.2017.66
  • Olver, Neil, Végh, László A. (2017). A simpler and faster strongly polynomial algorithm for generalized flow maximization. In STOC: ACM Symposium on Theory of Computing (pp. 100 - 111). ACM Press. https://doi.org/10.1145/3055399.3055439
  • Ostaszewski, Adam (2017). Homomorphisms from functional equations in probability. In Brzdek, J., Cieplinski, K., Rassias, T. M (Eds.), Developments in Functional Equations and Related Topics (pp. 171-213). Springer Berlin / Heidelberg.
    • Conference or Workshop Item
  • Bosman, Thomas, Olver, Neil (2018-09-04 - 2018-09-08) Exploring the tractability of the capped hose model [Paper]. Proceedings of the 25th Annual European Symposium on Algorithms (ESA): ALGO 2017, Vienna, Vienns, Austria, AUT. https://doi.org/10.4230/LIPIcs.ESA.2017.19
  • Könemann, Jochen, Olver, Neil, Pashkovich, Kanstantsin, Ravi, R, Swamy, Chaitanya, Vygen, Jens (2017-08-16 - 2017-08-18) On the integrality gap of the prize-collecting steiner forest LP [Paper]. Approx 2017 - Random 2017, UC Berkley, Berkley, United States, USA. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.17
  • Olver, Neil, Végh, László A. (2017-06-19 - 2017-06-23) A simpler and faster strongly polynomial algorithm for generalized flow maximization [Paper]. STOC 2017 Theory Fest: 49th Annual ACM Symposium on the Theory of Computing, Hyatt Regency, Montreal, Montreal, Canada, CAN.
  • van den Heuvel, Jan, Kreutzer, Stephan, Pilipczuk, Michal, Quiroz, Daniel, Rabinovich, Roman, Siebertz, Sebastian (2017-06-20 - 2017-06-23) Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion [Paper]. 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, ISL. https://doi.org/10.1109/LICS.2017.8005115
    • Thesis
  • Bernhardt, Thomas (2017). Reflected diffusions and piecewise diffusion approximations of Levy processes [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.r9nj6lq9si54
  • Davies, Ewan (2017). Extremal and probabilistic results for regular graphs [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.bijk2dsj3hlb
  • Jenssen, Matthew (2017). Continuous optimisation in extremal combinatorics [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.hkd3j1k47oam
  • Quiroz, Daniel A. (2017). Chromatic and structural properties of sparse graph classes [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.yczhu2j6vv7n
  • Roberts, Barnaby (2017). Structure and randomness in extremal combinatorics [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.5uqfgbh7m14x
  • Taptagaporn, Pongphat (2017). Algorithmic learning from financial predictions [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.h156ah8bzin7
  • Xu, Junwei (2017). Topics in optimal liquidation and contract theory [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.6esh7e4w3yjb
    • Online resource
  • Böttcher, Julia (2017). vvv.
  • Dütting, Paul (2017). Paul Dütting – Designing auctions for re-allocating spectrum rights.
  • Seal, Michael (2017). Norman Biggs – History of Mathematics: The LSE Course.