---
_id: '1192'
abstract:
- lang: eng
  text: The main result of this paper is a generalization of the classical blossom
    algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean
    CSPs where each variable appears in exactly two constraints (we call it edge CSP)
    and all constraints are even Δ-matroid relations (represented by lists of tuples).
    As a consequence of this, we settle the complexity classification of planar Boolean
    CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even
    Δ-matroid constraints allows us to extend the tractability result to a larger
    class of Δ-matroids that includes many classes that were known to be tractable
    before, namely co-independent, compact, local and binary.
article_processing_charge: No
author:
- first_name: Alexandr
  full_name: Kazda, Alexandr
  id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
  last_name: Kazda
- first_name: Vladimir
  full_name: Kolmogorov, Vladimir
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
- first_name: Michal
  full_name: Rolinek, Michal
  id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
  last_name: Rolinek
citation:
  ama: 'Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of
    planar Boolean CSPs. In: SIAM; 2017:307-326. doi:<a href="https://doi.org/10.1137/1.9781611974782.20">10.1137/1.9781611974782.20</a>'
  apa: 'Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2017). Even delta-matroids and
    the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium
    on Discrete Algorithms, Barcelona, Spain: SIAM. <a href="https://doi.org/10.1137/1.9781611974782.20">https://doi.org/10.1137/1.9781611974782.20</a>'
  chicago: Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids
    and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. <a href="https://doi.org/10.1137/1.9781611974782.20">https://doi.org/10.1137/1.9781611974782.20</a>.
  ieee: 'A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity
    of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms,
    Barcelona, Spain, 2017, pp. 307–326.'
  ista: 'Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity
    of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.'
  mla: Kazda, Alexandr, et al. <i>Even Delta-Matroids and the Complexity of Planar
    Boolean CSPs</i>. SIAM, 2017, pp. 307–26, doi:<a href="https://doi.org/10.1137/1.9781611974782.20">10.1137/1.9781611974782.20</a>.
  short: A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
conference:
  end_date: 2017-01019
  location: Barcelona, Spain
  name: 'SODA: Symposium on Discrete Algorithms'
  start_date: 2017-01-16
date_created: 2018-12-11T11:50:38Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-20T11:20:26Z
day: '01'
department:
- _id: VlKo
doi: 10.1137/1.9781611974782.20
ec_funded: 1
external_id:
  isi:
  - '000426965800020'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1602.03124
month: '01'
oa: 1
oa_version: Submitted Version
page: 307 - 326
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
  isbn:
  - 978-161197478-2
publication_status: published
publisher: SIAM
publist_id: '6159'
quality_controlled: '1'
related_material:
  record:
  - id: '6032'
    relation: later_version
    status: public
status: public
title: Even delta-matroids and the complexity of planar Boolean CSPs
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '1194'
abstract:
- lang: eng
  text: 'Termination is one of the basic liveness properties, and we study the termination
    problem for probabilistic programs with real-valued variables. Previous works
    focused on the qualitative problem that asks whether an input program terminates
    with probability~1 (almost-sure termination). A powerful approach for this qualitative
    problem is the notion of ranking supermartingales with respect to a given set
    of invariants. The quantitative problem (probabilistic termination) asks for bounds
    on the termination probability. A fundamental and conceptual drawback of the existing
    approaches to address probabilistic termination is that even though the supermartingales
    consider the probabilistic behavior of the programs, the invariants are obtained
    completely ignoring the probabilistic aspect. In this work we address the probabilistic
    termination problem for linear-arithmetic probabilistic programs with nondeterminism.
    We define the notion of {\em stochastic invariants}, which are constraints along
    with a probability bound that the constraints hold. We introduce a concept of
    {\em repulsing supermartingales}. First, we show that repulsing supermartingales
    can be used to obtain bounds on the probability of the stochastic invariants.
    Second, we show the effectiveness of repulsing supermartingales in the following
    three ways: (1)~With a combination of ranking and repulsing supermartingales we
    can compute lower bounds on the probability of termination; (2)~repulsing supermartingales
    provide witnesses for refutation of almost-sure termination; and (3)~with a combination
    of ranking and repulsing supermartingales we can establish persistence properties
    of probabilistic programs. We also present results on related computational problems
    and an experimental evaluation of our approach on academic examples. '
alternative_title:
- ACM SIGPLAN Notices
article_processing_charge: No
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Petr
  full_name: Novotny, Petr
  id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
  last_name: Novotny
- first_name: Djordje
  full_name: Zikelic, Djordje
  last_name: Zikelic
citation:
  ama: 'Chatterjee K, Novotný P, Zikelic D. Stochastic invariants for probabilistic
    termination. In: Vol 52. ACM; 2017:145-160. doi:<a href="https://doi.org/10.1145/3009837.3009873">10.1145/3009837.3009873</a>'
  apa: 'Chatterjee, K., Novotný, P., &#38; Zikelic, D. (2017). Stochastic invariants
    for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles
    of Programming Languages, Paris, France: ACM. <a href="https://doi.org/10.1145/3009837.3009873">https://doi.org/10.1145/3009837.3009873</a>'
  chicago: Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic
    Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. <a href="https://doi.org/10.1145/3009837.3009873">https://doi.org/10.1145/3009837.3009873</a>.
  ieee: 'K. Chatterjee, P. Novotný, and D. Zikelic, “Stochastic invariants for probabilistic
    termination,” presented at the POPL: Principles of Programming Languages, Paris,
    France, 2017, vol. 52, no. 1, pp. 145–160.'
  ista: 'Chatterjee K, Novotný P, Zikelic D. 2017. Stochastic invariants for probabilistic
    termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol.
    52, 145–160.'
  mla: Chatterjee, Krishnendu, et al. <i>Stochastic Invariants for Probabilistic Termination</i>.
    Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:<a href="https://doi.org/10.1145/3009837.3009873">10.1145/3009837.3009873</a>.
  short: K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.
conference:
  end_date: 2017-01-21
  location: Paris, France
  name: 'POPL: Principles of Programming Languages'
  start_date: 2017-01-15
date_created: 2018-12-11T11:50:39Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-07-14T09:09:58Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3009837.3009873
ec_funded: 1
external_id:
  isi:
  - '000408311200013'
intvolume: '        52'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1611.01063
month: '01'
oa: 1
oa_version: Submitted Version
page: 145 - 160
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Moderne Concurrency Paradigms
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication_identifier:
  issn:
  - '07308566'
publication_status: published
publisher: ACM
publist_id: '6157'
quality_controlled: '1'
related_material:
  record:
  - id: '14539'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Stochastic invariants for probabilistic termination
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 52
year: '2017'
...
---
_id: '1196'
abstract:
- lang: eng
  text: 'We define the . model-measuring problem: given a model . M and specification
    . ϕ, what is the maximal distance . ρ such that all models . M'' within distance
    . ρ from . M satisfy (or violate) . ϕ. The model-measuring problem presupposes
    a distance function on models. We concentrate on . automatic distance functions,
    which are defined by weighted automata. The model-measuring problem subsumes several
    generalizations of the classical model-checking problem, in particular, quantitative
    model-checking problems that measure the degree of satisfaction of a specification;
    robustness problems that measure how much a model can be perturbed without violating
    the specification; and parameter synthesis for hybrid systems. We show that for
    automatic distance functions, and (a) . ω-regular linear-time, (b) . ω-regular
    branching-time, and (c) hybrid specifications, the model-measuring problem can
    be solved.We use automata-theoretic model-checking methods for model measuring,
    replacing the emptiness question for word, tree, and hybrid automata by the .
    optimal-value question for the weighted versions of these automata. For automata
    over words and trees, we consider weighted automata that accumulate weights by
    maximizing, summing, discounting, and limit averaging. For hybrid automata, we
    consider monotonic (parametric) hybrid automata, a hybrid counterpart of (discrete)
    weighted automata.We give several examples of using the model-measuring problem
    to compute various notions of robustness and quantitative satisfaction for temporal
    specifications. Further, we propose the modeling framework for model measuring
    to ease the specification and reduce the likelihood of errors in modeling.Finally,
    we present a variant of the model-measuring problem, called the . model-repair
    problem. The model-repair problem applies to models that do not satisfy the specification;
    it can be used to derive restrictions, under which the model satisfies the specification,
    i.e., to repair the model.'
acknowledgement: "This research was supported in part by the European Research Council
  (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund1 (FWF) under grants
  S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science
  Centre (NCN), Poland under grant 2014/15/D/ST6/04543.\r\nA Technical Report of this
  article is available via: https://repository.ist.ac.at/171/"
article_processing_charge: No
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Jan
  full_name: Otop, Jan
  id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
  last_name: Otop
citation:
  ama: 'Henzinger TA, Otop J. Model measuring for discrete and hybrid systems. <i>Nonlinear
    Analysis: Hybrid Systems</i>. 2017;23:166-190. doi:<a href="https://doi.org/10.1016/j.nahs.2016.09.001">10.1016/j.nahs.2016.09.001</a>'
  apa: 'Henzinger, T. A., &#38; Otop, J. (2017). Model measuring for discrete and
    hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href="https://doi.org/10.1016/j.nahs.2016.09.001">https://doi.org/10.1016/j.nahs.2016.09.001</a>'
  chicago: 'Henzinger, Thomas A, and Jan Otop. “Model Measuring for Discrete and Hybrid
    Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2017. <a href="https://doi.org/10.1016/j.nahs.2016.09.001">https://doi.org/10.1016/j.nahs.2016.09.001</a>.'
  ieee: 'T. A. Henzinger and J. Otop, “Model measuring for discrete and hybrid systems,”
    <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23. Elsevier, pp. 166–190, 2017.'
  ista: 'Henzinger TA, Otop J. 2017. Model measuring for discrete and hybrid systems.
    Nonlinear Analysis: Hybrid Systems. 23, 166–190.'
  mla: 'Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid
    Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, Elsevier, 2017,
    pp. 166–90, doi:<a href="https://doi.org/10.1016/j.nahs.2016.09.001">10.1016/j.nahs.2016.09.001</a>.'
  short: 'T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190.'
date_created: 2018-12-11T11:50:39Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2023-09-20T11:18:50Z
day: '01'
department:
- _id: ToHe
doi: 10.1016/j.nahs.2016.09.001
ec_funded: 1
external_id:
  isi:
  - '000390637000011'
intvolume: '        23'
isi: 1
language:
- iso: eng
month: '02'
oa_version: None
page: 166 - 190
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: The Wittgenstein Prize
publication: 'Nonlinear Analysis: Hybrid Systems'
publication_status: published
publisher: Elsevier
publist_id: '6154'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Model measuring for discrete and hybrid systems
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 23
year: '2017'
...
---
_id: '11961'
abstract:
- lang: eng
  text: Flow chemistry involves the use of channels or tubing to conduct a reaction
    in a continuous stream rather than in a flask. Flow equipment provides chemists
    with unique control over reaction parameters enhancing reactivity or in some cases
    enabling new reactions. This relatively young technology has received a remarkable
    amount of attention in the past decade with many reports on what can be done in
    flow. Until recently, however, the question, “Should we do this in flow?” has
    merely been an afterthought. This review introduces readers to the basic principles
    and fundamentals of flow chemistry and critically discusses recent flow chemistry
    accounts.
article_processing_charge: No
article_type: original
author:
- first_name: Matthew B.
  full_name: Plutschack, Matthew B.
  last_name: Plutschack
- first_name: Bartholomäus
  full_name: Pieber, Bartholomäus
  id: 93e5e5b2-0da6-11ed-8a41-af589a024726
  last_name: Pieber
  orcid: 0000-0001-8689-388X
- first_name: Kerry
  full_name: Gilmore, Kerry
  last_name: Gilmore
- first_name: Peter H.
  full_name: Seeberger, Peter H.
  last_name: Seeberger
citation:
  ama: Plutschack MB, Pieber B, Gilmore K, Seeberger PH. The Hitchhiker’s Guide to
    flow chemistry. <i>Chemical Reviews</i>. 2017;117(18):11796-11893. doi:<a href="https://doi.org/10.1021/acs.chemrev.7b00183">10.1021/acs.chemrev.7b00183</a>
  apa: Plutschack, M. B., Pieber, B., Gilmore, K., &#38; Seeberger, P. H. (2017).
    The Hitchhiker’s Guide to flow chemistry. <i>Chemical Reviews</i>. American Chemical
    Society. <a href="https://doi.org/10.1021/acs.chemrev.7b00183">https://doi.org/10.1021/acs.chemrev.7b00183</a>
  chicago: Plutschack, Matthew B., Bartholomäus Pieber, Kerry Gilmore, and Peter H.
    Seeberger. “The Hitchhiker’s Guide to Flow Chemistry.” <i>Chemical Reviews</i>.
    American Chemical Society, 2017. <a href="https://doi.org/10.1021/acs.chemrev.7b00183">https://doi.org/10.1021/acs.chemrev.7b00183</a>.
  ieee: M. B. Plutschack, B. Pieber, K. Gilmore, and P. H. Seeberger, “The Hitchhiker’s
    Guide to flow chemistry,” <i>Chemical Reviews</i>, vol. 117, no. 18. American
    Chemical Society, pp. 11796–11893, 2017.
  ista: Plutschack MB, Pieber B, Gilmore K, Seeberger PH. 2017. The Hitchhiker’s Guide
    to flow chemistry. Chemical Reviews. 117(18), 11796–11893.
  mla: Plutschack, Matthew B., et al. “The Hitchhiker’s Guide to Flow Chemistry.”
    <i>Chemical Reviews</i>, vol. 117, no. 18, American Chemical Society, 2017, pp.
    11796–893, doi:<a href="https://doi.org/10.1021/acs.chemrev.7b00183">10.1021/acs.chemrev.7b00183</a>.
  short: M.B. Plutschack, B. Pieber, K. Gilmore, P.H. Seeberger, Chemical Reviews
    117 (2017) 11796–11893.
date_created: 2022-08-24T11:07:46Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-02-21T10:09:28Z
day: '01'
doi: 10.1021/acs.chemrev.7b00183
extern: '1'
external_id:
  pmid:
  - '28570059'
intvolume: '       117'
issue: '18'
language:
- iso: eng
month: '06'
oa_version: None
page: 11796-11893
pmid: 1
publication: Chemical Reviews
publication_identifier:
  eissn:
  - 1520-6890
  issn:
  - 0009-2665
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Hitchhiker’s Guide to flow chemistry
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 117
year: '2017'
...
---
_id: '11976'
abstract:
- lang: eng
  text: The way organic multistep synthesis is performed is changing due to the adoption
    of flow chemical techniques, which has enabled the development of improved methods
    to make complex molecules. The modular nature of the technique provides not only
    access to target molecules via linear flow approaches but also for the targeting
    of structural cores with single systems. This perspective article summarizes the
    state of the art of continuous multistep synthesis and discusses the main challenges
    and opportunities in this area.
article_processing_charge: No
article_type: original
author:
- first_name: Bartholomäus
  full_name: Pieber, Bartholomäus
  id: 93e5e5b2-0da6-11ed-8a41-af589a024726
  last_name: Pieber
  orcid: 0000-0001-8689-388X
- first_name: Kerry
  full_name: Gilmore, Kerry
  last_name: Gilmore
- first_name: Peter H.
  full_name: Seeberger, Peter H.
  last_name: Seeberger
citation:
  ama: Pieber B, Gilmore K, Seeberger PH. Integrated flow processing - challenges
    in continuous multistep synthesis. <i>Journal of Flow Chemistry</i>. 2017;7(3-4):129-136.
    doi:<a href="https://doi.org/10.1556/1846.2017.00016">10.1556/1846.2017.00016</a>
  apa: Pieber, B., Gilmore, K., &#38; Seeberger, P. H. (2017). Integrated flow processing
    - challenges in continuous multistep synthesis. <i>Journal of Flow Chemistry</i>.
    AKJournals. <a href="https://doi.org/10.1556/1846.2017.00016">https://doi.org/10.1556/1846.2017.00016</a>
  chicago: Pieber, Bartholomäus, Kerry Gilmore, and Peter H. Seeberger. “Integrated
    Flow Processing - Challenges in Continuous Multistep Synthesis.” <i>Journal of
    Flow Chemistry</i>. AKJournals, 2017. <a href="https://doi.org/10.1556/1846.2017.00016">https://doi.org/10.1556/1846.2017.00016</a>.
  ieee: B. Pieber, K. Gilmore, and P. H. Seeberger, “Integrated flow processing -
    challenges in continuous multistep synthesis,” <i>Journal of Flow Chemistry</i>,
    vol. 7, no. 3–4. AKJournals, pp. 129–136, 2017.
  ista: Pieber B, Gilmore K, Seeberger PH. 2017. Integrated flow processing - challenges
    in continuous multistep synthesis. Journal of Flow Chemistry. 7(3–4), 129–136.
  mla: Pieber, Bartholomäus, et al. “Integrated Flow Processing - Challenges in Continuous
    Multistep Synthesis.” <i>Journal of Flow Chemistry</i>, vol. 7, no. 3–4, AKJournals,
    2017, pp. 129–36, doi:<a href="https://doi.org/10.1556/1846.2017.00016">10.1556/1846.2017.00016</a>.
  short: B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017)
    129–136.
date_created: 2022-08-25T10:47:51Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-02-21T10:10:02Z
day: '01'
doi: 10.1556/1846.2017.00016
extern: '1'
intvolume: '         7'
issue: 3-4
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1556/1846.2017.00016
month: '09'
oa: 1
oa_version: Published Version
page: 129-136
publication: Journal of Flow Chemistry
publication_identifier:
  eissn:
  - 2063-0212
  issn:
  - 2062-249X
publication_status: published
publisher: AKJournals
quality_controlled: '1'
scopus_import: '1'
status: public
title: Integrated flow processing - challenges in continuous multistep synthesis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2017'
...
---
_id: '1198'
abstract:
- lang: eng
  text: We consider a model of fermions interacting via point interactions, defined
    via a certain weighted Dirichlet form. While for two particles the interaction
    corresponds to infinite scattering length, the presence of further particles effectively
    decreases the interaction strength. We show that the model becomes trivial in
    the thermodynamic limit, in the sense that the free energy density at any given
    particle density and temperature agrees with the corresponding expression for
    non-interacting particles.
acknowledgement: 'Open access funding provided by Institute of Science and Technology
  (IST Austria). '
article_processing_charge: Yes (via OA deal)
author:
- first_name: Thomas
  full_name: Moser, Thomas
  id: 2B5FC9A4-F248-11E8-B48F-1D18A9856A87
  last_name: Moser
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Moser T, Seiringer R. Triviality of a model of particles with point interactions
    in the thermodynamic limit. <i>Letters in Mathematical Physics</i>. 2017;107(3):533-552.
    doi:<a href="https://doi.org/10.1007/s11005-016-0915-x">10.1007/s11005-016-0915-x</a>
  apa: Moser, T., &#38; Seiringer, R. (2017). Triviality of a model of particles with
    point interactions in the thermodynamic limit. <i>Letters in Mathematical Physics</i>.
    Springer. <a href="https://doi.org/10.1007/s11005-016-0915-x">https://doi.org/10.1007/s11005-016-0915-x</a>
  chicago: Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles
    with Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical
    Physics</i>. Springer, 2017. <a href="https://doi.org/10.1007/s11005-016-0915-x">https://doi.org/10.1007/s11005-016-0915-x</a>.
  ieee: T. Moser and R. Seiringer, “Triviality of a model of particles with point
    interactions in the thermodynamic limit,” <i>Letters in Mathematical Physics</i>,
    vol. 107, no. 3. Springer, pp. 533–552, 2017.
  ista: Moser T, Seiringer R. 2017. Triviality of a model of particles with point
    interactions in the thermodynamic limit. Letters in Mathematical Physics. 107(3),
    533–552.
  mla: Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with
    Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical Physics</i>,
    vol. 107, no. 3, Springer, 2017, pp. 533–52, doi:<a href="https://doi.org/10.1007/s11005-016-0915-x">10.1007/s11005-016-0915-x</a>.
  short: T. Moser, R. Seiringer, Letters in Mathematical Physics 107 (2017) 533–552.
date_created: 2018-12-11T11:50:40Z
date_published: 2017-03-01T00:00:00Z
date_updated: 2023-09-20T11:18:13Z
day: '01'
ddc:
- '510'
- '539'
department:
- _id: RoSe
doi: 10.1007/s11005-016-0915-x
external_id:
  isi:
  - '000394280200007'
file:
- access_level: open_access
  checksum: c0c835def162c1bc52f978fad26e3c2f
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:40Z
  date_updated: 2020-07-14T12:44:38Z
  file_id: '5296'
  file_name: IST-2016-723-v1+1_s11005-016-0915-x.pdf
  file_size: 587207
  relation: main_file
file_date_updated: 2020-07-14T12:44:38Z
has_accepted_license: '1'
intvolume: '       107'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: ' 533 - 552'
project:
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P27533_N27
  name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
publication: Letters in Mathematical Physics
publication_identifier:
  issn:
  - '03779017'
publication_status: published
publisher: Springer
publist_id: '6152'
pubrep_id: '723'
quality_controlled: '1'
related_material:
  record:
  - id: '52'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Triviality of a model of particles with point interactions in the thermodynamic
  limit
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 107
year: '2017'
...
---
_id: '1199'
abstract:
- lang: eng
  text: Much of quantitative genetics is based on the ‘infinitesimal model’, under
    which selection has a negligible effect on the genetic variance. This is typically
    justified by assuming a very large number of loci with additive effects. However,
    it applies even when genes interact, provided that the number of loci is large
    enough that selection on each of them is weak relative to random drift. In the
    long term, directional selection will change allele frequencies, but even then,
    the effects of epistasis on the ultimate change in trait mean due to selection
    may be modest. Stabilising selection can maintain many traits close to their optima,
    even when the underlying alleles are weakly selected. However, the number of traits
    that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this
    is hard to reconcile with the apparent complexity of many organisms. Just as for
    the mutation load, this limit can be evaded by a particular form of negative epistasis.
    A more robust limit is set by the variance in reproductive success. This suggests
    that selection accumulates information most efficiently in the infinitesimal regime,
    when selection on individual alleles is weak, and comparable with random drift.
    A review of evidence on selection strength suggests that although most variance
    in fitness may be because of alleles with large Nes, substantial amounts of adaptation
    may be because of alleles in the infinitesimal regime, in which epistasis has
    modest effects.
article_processing_charge: No
author:
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
citation:
  ama: Barton NH. How does epistasis influence the response to selection? <i>Heredity</i>.
    2017;118:96-109. doi:<a href="https://doi.org/10.1038/hdy.2016.109">10.1038/hdy.2016.109</a>
  apa: Barton, N. H. (2017). How does epistasis influence the response to selection?
    <i>Heredity</i>. Nature Publishing Group. <a href="https://doi.org/10.1038/hdy.2016.109">https://doi.org/10.1038/hdy.2016.109</a>
  chicago: Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?”
    <i>Heredity</i>. Nature Publishing Group, 2017. <a href="https://doi.org/10.1038/hdy.2016.109">https://doi.org/10.1038/hdy.2016.109</a>.
  ieee: N. H. Barton, “How does epistasis influence the response to selection?,” <i>Heredity</i>,
    vol. 118. Nature Publishing Group, pp. 96–109, 2017.
  ista: Barton NH. 2017. How does epistasis influence the response to selection? Heredity.
    118, 96–109.
  mla: Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?”
    <i>Heredity</i>, vol. 118, Nature Publishing Group, 2017, pp. 96–109, doi:<a href="https://doi.org/10.1038/hdy.2016.109">10.1038/hdy.2016.109</a>.
  short: N.H. Barton, Heredity 118 (2017) 96–109.
date_created: 2018-12-11T11:50:40Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-05-28T11:42:47Z
day: '01'
department:
- _id: NiBa
doi: 10.1038/hdy.2016.109
ec_funded: 1
external_id:
  isi:
  - '000392229100011'
intvolume: '       118'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5176114/
month: '01'
oa: 1
oa_version: Submitted Version
page: 96 - 109
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '250152'
  name: Limits to selection in biology and in evolutionary computation
publication: Heredity
publication_status: published
publisher: Nature Publishing Group
publist_id: '6151'
quality_controlled: '1'
related_material:
  record:
  - id: '9710'
    relation: research_data
    status: public
scopus_import: '1'
status: public
title: How does epistasis influence the response to selection?
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 118
year: '2017'
...
---
_id: '1207'
abstract:
- lang: eng
  text: The eigenvalue distribution of the sum of two large Hermitian matrices, when
    one of them is conjugated by a Haar distributed unitary matrix, is asymptotically
    given by the free convolution of their spectral distributions. We prove that this
    convergence also holds locally in the bulk of the spectrum, down to the optimal
    scales larger than the eigenvalue spacing. The corresponding eigenvectors are
    fully delocalized. Similar results hold for the sum of two real symmetric matrices,
    when one is conjugated by Haar orthogonal matrix.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Zhigang
  full_name: Bao, Zhigang
  id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
  last_name: Bao
  orcid: 0000-0003-3036-1475
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Kevin
  full_name: Schnelli, Kevin
  id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
  last_name: Schnelli
  orcid: 0000-0003-0954-3231
citation:
  ama: Bao Z, Erdös L, Schnelli K. Local law of addition of random matrices on optimal
    scale. <i>Communications in Mathematical Physics</i>. 2017;349(3):947-990. doi:<a
    href="https://doi.org/10.1007/s00220-016-2805-6">10.1007/s00220-016-2805-6</a>
  apa: Bao, Z., Erdös, L., &#38; Schnelli, K. (2017). Local law of addition of random
    matrices on optimal scale. <i>Communications in Mathematical Physics</i>. Springer.
    <a href="https://doi.org/10.1007/s00220-016-2805-6">https://doi.org/10.1007/s00220-016-2805-6</a>
  chicago: Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Law of Addition
    of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>.
    Springer, 2017. <a href="https://doi.org/10.1007/s00220-016-2805-6">https://doi.org/10.1007/s00220-016-2805-6</a>.
  ieee: Z. Bao, L. Erdös, and K. Schnelli, “Local law of addition of random matrices
    on optimal scale,” <i>Communications in Mathematical Physics</i>, vol. 349, no.
    3. Springer, pp. 947–990, 2017.
  ista: Bao Z, Erdös L, Schnelli K. 2017. Local law of addition of random matrices
    on optimal scale. Communications in Mathematical Physics. 349(3), 947–990.
  mla: Bao, Zhigang, et al. “Local Law of Addition of Random Matrices on Optimal Scale.”
    <i>Communications in Mathematical Physics</i>, vol. 349, no. 3, Springer, 2017,
    pp. 947–90, doi:<a href="https://doi.org/10.1007/s00220-016-2805-6">10.1007/s00220-016-2805-6</a>.
  short: Z. Bao, L. Erdös, K. Schnelli, Communications in Mathematical Physics 349
    (2017) 947–990.
date_created: 2018-12-11T11:50:43Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2023-09-20T11:16:57Z
day: '01'
ddc:
- '530'
department:
- _id: LaEr
doi: 10.1007/s00220-016-2805-6
ec_funded: 1
external_id:
  isi:
  - '000393696700005'
file:
- access_level: open_access
  checksum: ddff79154c3daf27237de5383b1264a9
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:14:47Z
  date_updated: 2020-07-14T12:44:39Z
  file_id: '5102'
  file_name: IST-2016-722-v1+1_s00220-016-2805-6.pdf
  file_size: 1033743
  relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: '       349'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 947 - 990
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '338804'
  name: Random matrices, universality and disordered quantum systems
publication: Communications in Mathematical Physics
publication_identifier:
  issn:
  - '00103616'
publication_status: published
publisher: Springer
publist_id: '6141'
pubrep_id: '722'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local law of addition of random matrices on optimal scale
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 349
year: '2017'
...
---
_id: '1208'
abstract:
- lang: eng
  text: We study parameter estimation in linear Gaussian covariance models, which
    are p-dimensional Gaussian models with linear constraints on the covariance matrix.
    Maximum likelihood estimation for this class of models leads to a non-convex optimization
    problem which typically has many local maxima. Using recent results on the asymptotic
    distribution of extreme eigenvalues of the Wishart distribution, we provide sufficient
    conditions for any hill climbing method to converge to the global maximum. Although
    we are primarily interested in the case in which n≫p, the proofs of our results
    utilize large sample asymptotic theory under the scheme n/p→γ&gt;1. Remarkably,
    our numerical simulations indicate that our results remain valid for p as small
    as 2. An important consequence of this analysis is that, for sample sizes n≃14p,
    maximum likelihood estimation for linear Gaussian covariance models behaves as
    if it were a convex optimization problem. © 2016 The Royal Statistical Society
    and Blackwell Publishing Ltd.
article_processing_charge: No
author:
- first_name: Piotr
  full_name: Zwiernik, Piotr
  last_name: Zwiernik
- first_name: Caroline
  full_name: Uhler, Caroline
  id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
  last_name: Uhler
  orcid: 0000-0002-7008-0216
- first_name: Donald
  full_name: Richards, Donald
  last_name: Richards
citation:
  ama: 'Zwiernik P, Uhler C, Richards D. Maximum likelihood estimation for linear
    Gaussian covariance models. <i>Journal of the Royal Statistical Society Series
    B: Statistical Methodology</i>. 2017;79(4):1269-1292. doi:<a href="https://doi.org/10.1111/rssb.12217">10.1111/rssb.12217</a>'
  apa: 'Zwiernik, P., Uhler, C., &#38; Richards, D. (2017). Maximum likelihood estimation
    for linear Gaussian covariance models. <i>Journal of the Royal Statistical Society.
    Series B: Statistical Methodology</i>. Wiley-Blackwell. <a href="https://doi.org/10.1111/rssb.12217">https://doi.org/10.1111/rssb.12217</a>'
  chicago: 'Zwiernik, Piotr, Caroline Uhler, and Donald Richards. “Maximum Likelihood
    Estimation for Linear Gaussian Covariance Models.” <i>Journal of the Royal Statistical
    Society. Series B: Statistical Methodology</i>. Wiley-Blackwell, 2017. <a href="https://doi.org/10.1111/rssb.12217">https://doi.org/10.1111/rssb.12217</a>.'
  ieee: 'P. Zwiernik, C. Uhler, and D. Richards, “Maximum likelihood estimation for
    linear Gaussian covariance models,” <i>Journal of the Royal Statistical Society.
    Series B: Statistical Methodology</i>, vol. 79, no. 4. Wiley-Blackwell, pp. 1269–1292,
    2017.'
  ista: 'Zwiernik P, Uhler C, Richards D. 2017. Maximum likelihood estimation for
    linear Gaussian covariance models. Journal of the Royal Statistical Society. Series
    B: Statistical Methodology. 79(4), 1269–1292.'
  mla: 'Zwiernik, Piotr, et al. “Maximum Likelihood Estimation for Linear Gaussian
    Covariance Models.” <i>Journal of the Royal Statistical Society. Series B: Statistical
    Methodology</i>, vol. 79, no. 4, Wiley-Blackwell, 2017, pp. 1269–92, doi:<a href="https://doi.org/10.1111/rssb.12217">10.1111/rssb.12217</a>.'
  short: 'P. Zwiernik, C. Uhler, D. Richards, Journal of the Royal Statistical Society.
    Series B: Statistical Methodology 79 (2017) 1269–1292.'
date_created: 2018-12-11T11:50:43Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-09-20T11:17:21Z
day: '01'
department:
- _id: CaUh
doi: 10.1111/rssb.12217
external_id:
  isi:
  - '000411712300012'
intvolume: '        79'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1408.5604
month: '09'
oa: 1
oa_version: Submitted Version
page: 1269 - 1292
project:
- _id: 2530CA10-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Y 903-N35
  name: 'Gaussian Graphical Models: Theory and Applications'
publication: 'Journal of the Royal Statistical Society. Series B: Statistical Methodology'
publication_identifier:
  issn:
  - '13697412'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '6142'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maximum likelihood estimation for linear Gaussian covariance models
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 79
year: '2017'
...
---
_id: '1211'
abstract:
- lang: eng
  text: Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau
    system, defined over periodic domains, exhibit both continuous symmetries, translational
    and rotational, as well as discrete symmetries under spatial reflections or complex
    conjugation. The simplest, and very common symmetry of this type is the equivariance
    of the defining equations under the orthogonal group O(2). We formulate a novel
    symmetry reduction scheme for such systems by combining the method of slices with
    invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky
    system in one spatial dimension. As an example, we track a relative periodic orbit
    through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced
    state space we are able to compute and visualize the unstable manifolds of relative
    periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown,
    and heteroclinic connections between various relative periodic orbits. It would
    be very hard to carry through such analysis in the full state space, without a
    symmetry reduction such as the one we present here.
acknowledgement: 'This work was supported by the family of late G. Robinson, Jr. and
  NSF Grant DMS-1211827. '
author:
- first_name: Nazmi B
  full_name: Budanur, Nazmi B
  id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
  last_name: Budanur
  orcid: 0000-0003-0423-5010
- first_name: Predrag
  full_name: Cvitanović, Predrag
  last_name: Cvitanović
citation:
  ama: Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in
    the symmetry reduced state space of the Kuramoto–Sivashinsky system. <i>Journal
    of Statistical Physics</i>. 2017;167(3-4):636-655. doi:<a href="https://doi.org/10.1007/s10955-016-1672-z">10.1007/s10955-016-1672-z</a>
  apa: Budanur, N. B., &#38; Cvitanović, P. (2017). Unstable manifolds of relative
    periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky
    system. <i>Journal of Statistical Physics</i>. Springer. <a href="https://doi.org/10.1007/s10955-016-1672-z">https://doi.org/10.1007/s10955-016-1672-z</a>
  chicago: Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative
    Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky
    System.” <i>Journal of Statistical Physics</i>. Springer, 2017. <a href="https://doi.org/10.1007/s10955-016-1672-z">https://doi.org/10.1007/s10955-016-1672-z</a>.
  ieee: N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic
    orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,”
    <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4. Springer, pp. 636–655,
    2017.
  ista: Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits
    in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal
    of Statistical Physics. 167(3–4), 636–655.
  mla: Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative
    Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky
    System.” <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4, Springer, 2017,
    pp. 636–55, doi:<a href="https://doi.org/10.1007/s10955-016-1672-z">10.1007/s10955-016-1672-z</a>.
  short: N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.
date_created: 2018-12-11T11:50:44Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2021-01-12T06:49:07Z
day: '01'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1007/s10955-016-1672-z
file:
- access_level: open_access
  checksum: 3e971d09eb167761aa0888ed415b0056
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:18:01Z
  date_updated: 2020-07-14T12:44:39Z
  file_id: '5319'
  file_name: IST-2017-782-v1+1_BudCvi15.pdf
  file_size: 2820207
  relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: '       167'
issue: 3-4
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 636-655
publication: Journal of Statistical Physics
publication_status: published
publisher: Springer
publist_id: '6136'
pubrep_id: '782'
quality_controlled: '1'
scopus_import: 1
status: public
title: Unstable manifolds of relative periodic orbits in the symmetry reduced state
  space of the Kuramoto–Sivashinsky system
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 167
year: '2017'
...
---
_id: '1213'
abstract:
- lang: eng
  text: Bacterial cytokinesis is commonly initiated by the Z-ring, a dynamic cytoskeletal
    structure that assembles at the site of division. Its primary component is FtsZ,
    a tubulin-like GTPase, that like its eukaryotic relative forms protein filaments
    in the presence of GTP. Since the discovery of the Z-ring 25 years ago, various
    models for the role of FtsZ have been suggested. However, important information
    about the architecture and dynamics of FtsZ filaments during cytokinesis is still
    missing. One reason for this lack of knowledge has been the small size of bacteria,
    which has made it difficult to resolve the orientation and dynamics of individual
    FtsZ filaments in the Z-ring. While superresolution microscopy experiments have
    helped to gain more information about the organization of the Z-ring in the dividing
    cell, they were not yet able to elucidate a mechanism of how FtsZ filaments reorganize
    during assembly and disassembly of the Z-ring. In this chapter, we explain how
    to use an in vitro reconstitution approach to investigate the self-organization
    of FtsZ filaments recruited to a biomimetic lipid bilayer by its membrane anchor
    FtsA. We show how to perform single-molecule experiments to study the behavior
    of individual FtsZ monomers during the constant reorganization of the FtsZ-FtsA
    filament network. We describe how to analyze the dynamics of single molecules
    and explain why this information can help to shed light onto possible mechanism
    of Z-ring constriction. We believe that similar experimental approaches will be
    useful to study the mechanism of membrane-based polymerization of other cytoskeletal
    systems, not only from prokaryotic but also eukaryotic origin.
acknowledged_ssus:
- _id: Bio
acknowledgement: Natalia Baranova is supported by an EMBO Long-Term Fellowship (EMBO
  ALTF 1163-2015) and Martin Loose by an ERC Starting Grant (ERCStG-2015-SelfOrganiCell).
alternative_title:
- Methods in Cell Biology
article_processing_charge: No
author:
- first_name: Natalia
  full_name: Baranova, Natalia
  id: 38661662-F248-11E8-B48F-1D18A9856A87
  last_name: Baranova
  orcid: 0000-0002-3086-9124
- first_name: Martin
  full_name: Loose, Martin
  id: 462D4284-F248-11E8-B48F-1D18A9856A87
  last_name: Loose
  orcid: 0000-0001-7309-9724
citation:
  ama: 'Baranova NS, Loose M. Single-molecule measurements to study polymerization
    dynamics of FtsZ-FtsA copolymers. In: Echard A, ed. <i>Cytokinesis</i>. Vol 137.
    Academic Press; 2017:355-370. doi:<a href="https://doi.org/10.1016/bs.mcb.2016.03.036">10.1016/bs.mcb.2016.03.036</a>'
  apa: Baranova, N. S., &#38; Loose, M. (2017). Single-molecule measurements to study
    polymerization dynamics of FtsZ-FtsA copolymers. In A. Echard (Ed.), <i>Cytokinesis</i>
    (Vol. 137, pp. 355–370). Academic Press. <a href="https://doi.org/10.1016/bs.mcb.2016.03.036">https://doi.org/10.1016/bs.mcb.2016.03.036</a>
  chicago: Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to
    Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” In <i>Cytokinesis</i>,
    edited by Arnaud  Echard, 137:355–70. Academic Press, 2017. <a href="https://doi.org/10.1016/bs.mcb.2016.03.036">https://doi.org/10.1016/bs.mcb.2016.03.036</a>.
  ieee: N. S. Baranova and M. Loose, “Single-molecule measurements to study polymerization
    dynamics of FtsZ-FtsA copolymers,” in <i>Cytokinesis</i>, vol. 137, A. Echard,
    Ed. Academic Press, 2017, pp. 355–370.
  ista: 'Baranova NS, Loose M. 2017.Single-molecule measurements to study polymerization
    dynamics of FtsZ-FtsA copolymers. In: Cytokinesis. Methods in Cell Biology, vol.
    137, 355–370.'
  mla: Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study
    Polymerization Dynamics of FtsZ-FtsA Copolymers.” <i>Cytokinesis</i>, edited by
    Arnaud  Echard, vol. 137, Academic Press, 2017, pp. 355–70, doi:<a href="https://doi.org/10.1016/bs.mcb.2016.03.036">10.1016/bs.mcb.2016.03.036</a>.
  short: N.S. Baranova, M. Loose, in:, A. Echard (Ed.), Cytokinesis, Academic Press,
    2017, pp. 355–370.
date_created: 2018-12-11T11:50:45Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2023-09-20T11:16:30Z
day: '01'
department:
- _id: MaLo
doi: 10.1016/bs.mcb.2016.03.036
ec_funded: 1
editor:
- first_name: 'Arnaud '
  full_name: 'Echard, Arnaud '
  last_name: Echard
external_id:
  isi:
  - '000403542900022'
intvolume: '       137'
isi: 1
language:
- iso: eng
month: '12'
oa_version: None
page: 355 - 370
project:
- _id: 2596EAB6-B435-11E9-9278-68D0E5697425
  grant_number: ALTF 2015-1163
  name: Synthesis of bacterial cell wall
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Cytokinesis
publication_identifier:
  issn:
  - 0091679X
publication_status: published
publisher: Academic Press
publist_id: '6134'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA
  copolymers
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 137
year: '2017'
...
---
_id: '256'
abstract:
- lang: eng
  text: We show that a non-singular integral form of degree d is soluble over the
    integers if and only if it is soluble over ℝ and over ℚp for all primes p, provided
    that the form has at least (d - 1/2 √d)2d variables. This improves on a longstanding
    result of Birch.
acknowledgement: While working on this paper the authors were supported by the Leverhulme
  Trust and ERC grant 306457.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Sean
  full_name: Prendiville, Sean
  last_name: Prendiville
citation:
  ama: Browning TD, Prendiville S. Improvements in Birch’s theorem on forms in many
    variables. <i>Journal fur die Reine und Angewandte Mathematik</i>. 2017;2017(731):122.
    doi:<a href="https://doi.org/10.1515/crelle-2014-0122">10.1515/crelle-2014-0122</a>
  apa: Browning, T. D., &#38; Prendiville, S. (2017). Improvements in Birch’s theorem
    on forms in many variables. <i>Journal Fur Die Reine Und Angewandte Mathematik</i>.
    Walter de Gruyter. <a href="https://doi.org/10.1515/crelle-2014-0122">https://doi.org/10.1515/crelle-2014-0122</a>
  chicago: Browning, Timothy D, and Sean Prendiville. “Improvements in Birch’s Theorem
    on Forms in Many Variables.” <i>Journal Fur Die Reine Und Angewandte Mathematik</i>.
    Walter de Gruyter, 2017. <a href="https://doi.org/10.1515/crelle-2014-0122">https://doi.org/10.1515/crelle-2014-0122</a>.
  ieee: T. D. Browning and S. Prendiville, “Improvements in Birch’s theorem on forms
    in many variables,” <i>Journal fur die Reine und Angewandte Mathematik</i>, vol.
    2017, no. 731. Walter de Gruyter, p. 122, 2017.
  ista: Browning TD, Prendiville S. 2017. Improvements in Birch’s theorem on forms
    in many variables. Journal fur die Reine und Angewandte Mathematik. 2017(731),
    122.
  mla: Browning, Timothy D., and Sean Prendiville. “Improvements in Birch’s Theorem
    on Forms in Many Variables.” <i>Journal Fur Die Reine Und Angewandte Mathematik</i>,
    vol. 2017, no. 731, Walter de Gruyter, 2017, p. 122, doi:<a href="https://doi.org/10.1515/crelle-2014-0122">10.1515/crelle-2014-0122</a>.
  short: T.D. Browning, S. Prendiville, Journal Fur Die Reine Und Angewandte Mathematik
    2017 (2017) 122.
date_created: 2018-12-11T11:45:28Z
date_published: 2017-10-01T00:00:00Z
date_updated: 2024-03-05T12:09:21Z
day: '01'
doi: 10.1515/crelle-2014-0122
extern: '1'
external_id:
  arxiv:
  - '1402.4489'
intvolume: '      2017'
issue: '731'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1402.4489
month: '10'
oa: 1
oa_version: Preprint
page: '122'
publication: Journal fur die Reine und Angewandte Mathematik
publication_identifier:
  issn:
  - 0075-4102
publication_status: published
publisher: Walter de Gruyter
publist_id: '7646'
quality_controlled: '1'
related_material:
  record:
  - id: '271'
    relation: earlier_version
    status: public
status: public
title: Improvements in Birch's theorem on forms in many variables
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2017
year: '2017'
...
---
_id: '265'
abstract:
- lang: eng
  text: We establish the dimension and irreducibility of the moduli space of rational
    curves (of fixed degree) on arbitrary smooth hypersurfaces of sufficiently low
    degree. A spreading out argument reduces the problem to hypersurfaces defined
    over finite fields of large cardinality, which can then be tackled using a function
    field version of the Hardy-Littlewood circle method, in which particular care
    is taken to ensure uniformity in the size of the underlying finite field.
acknowledgement: While working on this paper the first author was supported by ERC
  grant 306457.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Pankaj
  full_name: Vishe, Pankaj
  last_name: Vishe
citation:
  ama: Browning TD, Vishe P. Rational curves on smooth hypersurfaces of low degree.
    <i>Geometric Methods in Algebra and Number Theory</i>. 2017;11(7):1657-1675. doi:<a
    href="https://doi.org/10.2140/ant.2017.11.1657">10.2140/ant.2017.11.1657</a>
  apa: Browning, T. D., &#38; Vishe, P. (2017). Rational curves on smooth hypersurfaces
    of low degree. <i>Geometric Methods in Algebra and Number Theory</i>.  Mathematical
    Sciences Publishers. <a href="https://doi.org/10.2140/ant.2017.11.1657">https://doi.org/10.2140/ant.2017.11.1657</a>
  chicago: Browning, Timothy D, and Pankaj Vishe. “Rational Curves on Smooth Hypersurfaces
    of Low Degree.” <i>Geometric Methods in Algebra and Number Theory</i>.  Mathematical
    Sciences Publishers, 2017. <a href="https://doi.org/10.2140/ant.2017.11.1657">https://doi.org/10.2140/ant.2017.11.1657</a>.
  ieee: T. D. Browning and P. Vishe, “Rational curves on smooth hypersurfaces of low
    degree,” <i>Geometric Methods in Algebra and Number Theory</i>, vol. 11, no. 7.  Mathematical
    Sciences Publishers, pp. 1657–1675, 2017.
  ista: Browning TD, Vishe P. 2017. Rational curves on smooth hypersurfaces of low
    degree. Geometric Methods in Algebra and Number Theory. 11(7), 1657–1675.
  mla: Browning, Timothy D., and Pankaj Vishe. “Rational Curves on Smooth Hypersurfaces
    of Low Degree.” <i>Geometric Methods in Algebra and Number Theory</i>, vol. 11,
    no. 7,  Mathematical Sciences Publishers, 2017, pp. 1657–75, doi:<a href="https://doi.org/10.2140/ant.2017.11.1657">10.2140/ant.2017.11.1657</a>.
  short: T.D. Browning, P. Vishe, Geometric Methods in Algebra and Number Theory 11
    (2017) 1657–1675.
date_created: 2018-12-11T11:45:30Z
date_published: 2017-09-07T00:00:00Z
date_updated: 2024-03-05T11:43:38Z
day: '07'
doi: 10.2140/ant.2017.11.1657
extern: '1'
external_id:
  arxiv:
  - '1611.00553'
intvolume: '        11'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1611.00553
month: '09'
oa: 1
oa_version: Preprint
page: 1657 - 1675
publication: Geometric Methods in Algebra and Number Theory
publication_identifier:
  eissn:
  - 1944-7833
publication_status: published
publisher: ' Mathematical Sciences Publishers'
publist_id: '7637'
quality_controlled: '1'
status: public
title: Rational curves on smooth hypersurfaces of low degree
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2017'
...
---
_id: '266'
abstract:
- lang: eng
  text: We generalise Birch's seminal work on forms in many variables to handle a
    system of forms in which the degrees need not all be the same. This allows us
    to prove the Hasse principle, weak approximation, and the Manin-Peyre conjecture
    for a smooth and geometrically integral variety X Pm, provided only that its dimension
    is large enough in terms of its degree.
acknowledgement: While working on this paper the first author was supported by ERC
  grant 306457.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Roger
  full_name: Heath Brown, Roger
  last_name: Heath Brown
citation:
  ama: Browning TD, Heath Brown R. Forms in many variables and differing degrees.
    <i>Journal of the European Mathematical Society</i>. 2017;19(2):357-394. doi:<a
    href="https://doi.org/10.4171/JEMS/668">10.4171/JEMS/668</a>
  apa: Browning, T. D., &#38; Heath Brown, R. (2017). Forms in many variables and
    differing degrees. <i>Journal of the European Mathematical Society</i>. European
    Mathematical Society Publishing House. <a href="https://doi.org/10.4171/JEMS/668">https://doi.org/10.4171/JEMS/668</a>
  chicago: Browning, Timothy D, and Roger Heath Brown. “Forms in Many Variables and
    Differing Degrees.” <i>Journal of the European Mathematical Society</i>. European
    Mathematical Society Publishing House, 2017. <a href="https://doi.org/10.4171/JEMS/668">https://doi.org/10.4171/JEMS/668</a>.
  ieee: T. D. Browning and R. Heath Brown, “Forms in many variables and differing
    degrees,” <i>Journal of the European Mathematical Society</i>, vol. 19, no. 2.
    European Mathematical Society Publishing House, pp. 357–394, 2017.
  ista: Browning TD, Heath Brown R. 2017. Forms in many variables and differing degrees.
    Journal of the European Mathematical Society. 19(2), 357–394.
  mla: Browning, Timothy D., and Roger Heath Brown. “Forms in Many Variables and Differing
    Degrees.” <i>Journal of the European Mathematical Society</i>, vol. 19, no. 2,
    European Mathematical Society Publishing House, 2017, pp. 357–94, doi:<a href="https://doi.org/10.4171/JEMS/668">10.4171/JEMS/668</a>.
  short: T.D. Browning, R. Heath Brown, Journal of the European Mathematical Society
    19 (2017) 357–394.
date_created: 2018-12-11T11:45:31Z
date_published: 2017-01-26T00:00:00Z
date_updated: 2024-03-05T11:47:15Z
day: '26'
doi: 10.4171/JEMS/668
extern: '1'
external_id:
  arxiv:
  - '1403.5937'
intvolume: '        19'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1403.5937
month: '01'
oa: 1
oa_version: Preprint
page: 357 - 394
publication: Journal of the European Mathematical Society
publication_status: published
publisher: European Mathematical Society Publishing House
publist_id: '7636'
quality_controlled: '1'
status: public
title: Forms in many variables and differing degrees
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2017'
...
---
_id: '267'
abstract:
- lang: eng
  text: Building on recent work of Bhargava, Elkies and Schnidman and of Kriz and
    Li, we produce infinitely many smooth cubic surfaces defined over the field of
    rational numbers that contain rational points.
acknowledgement: While working on this paper the author was supported by ERC grant
  306457.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
citation:
  ama: Browning TD. Many cubic surfaces contain rational points. <i>Mathematika</i>.
    2017;63(3):818-839. doi:<a href="https://doi.org/10.1112/S0025579317000195">10.1112/S0025579317000195</a>
  apa: Browning, T. D. (2017). Many cubic surfaces contain rational points. <i>Mathematika</i>.
    Cambridge University Press. <a href="https://doi.org/10.1112/S0025579317000195">https://doi.org/10.1112/S0025579317000195</a>
  chicago: Browning, Timothy D. “Many Cubic Surfaces Contain Rational Points.” <i>Mathematika</i>.
    Cambridge University Press, 2017. <a href="https://doi.org/10.1112/S0025579317000195">https://doi.org/10.1112/S0025579317000195</a>.
  ieee: T. D. Browning, “Many cubic surfaces contain rational points,” <i>Mathematika</i>,
    vol. 63, no. 3. Cambridge University Press, pp. 818–839, 2017.
  ista: Browning TD. 2017. Many cubic surfaces contain rational points. Mathematika.
    63(3), 818–839.
  mla: Browning, Timothy D. “Many Cubic Surfaces Contain Rational Points.” <i>Mathematika</i>,
    vol. 63, no. 3, Cambridge University Press, 2017, pp. 818–39, doi:<a href="https://doi.org/10.1112/S0025579317000195">10.1112/S0025579317000195</a>.
  short: T.D. Browning, Mathematika 63 (2017) 818–839.
date_created: 2018-12-11T11:45:31Z
date_published: 2017-11-29T00:00:00Z
date_updated: 2024-03-05T11:49:27Z
day: '29'
doi: 10.1112/S0025579317000195
extern: '1'
external_id:
  arxiv:
  - '1701.00525'
intvolume: '        63'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1701.00525
month: '11'
oa: 1
oa_version: Preprint
page: 818 - 839
publication: Mathematika
publication_identifier:
  issn:
  - 0025-5793
publication_status: published
publisher: Cambridge University Press
publist_id: '7635'
quality_controlled: '1'
status: public
title: Many cubic surfaces contain rational points
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 63
year: '2017'
...
---
_id: '268'
abstract:
- lang: eng
  text: We show that any subset of the squares of positive relative upper density
    contains nontrivial solutions to a translation-invariant linear equation in five
    or more variables, with explicit quantitative bounds. As a consequence, we establish
    the partition regularity of any diagonal quadric in five or more variables whose
    coefficients sum to zero. Unlike previous approaches, which are limited to equations
    in seven or more variables, we employ transference technology of Green to import
    bounds from the linear setting.
acknowledgement: Whilst working on this paper the authors were supported by ERC grant
  306457.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Sean
  full_name: Prendiville, Sean
  last_name: Prendiville
citation:
  ama: Browning TD, Prendiville S. A transference approach to a Roth-type theorem
    in the squares. <i>International Mathematics Research Notices</i>. 2017;2017(7):2219-2248.
    doi:<a href="https://doi.org/10.1093/imrn/rnw096">10.1093/imrn/rnw096</a>
  apa: Browning, T. D., &#38; Prendiville, S. (2017). A transference approach to a
    Roth-type theorem in the squares. <i>International Mathematics Research Notices</i>.
    Oxford University Press. <a href="https://doi.org/10.1093/imrn/rnw096">https://doi.org/10.1093/imrn/rnw096</a>
  chicago: Browning, Timothy D, and Sean Prendiville. “A Transference Approach to
    a Roth-Type Theorem in the Squares.” <i>International Mathematics Research Notices</i>.
    Oxford University Press, 2017. <a href="https://doi.org/10.1093/imrn/rnw096">https://doi.org/10.1093/imrn/rnw096</a>.
  ieee: T. D. Browning and S. Prendiville, “A transference approach to a Roth-type
    theorem in the squares,” <i>International Mathematics Research Notices</i>, vol.
    2017, no. 7. Oxford University Press, pp. 2219–2248, 2017.
  ista: Browning TD, Prendiville S. 2017. A transference approach to a Roth-type theorem
    in the squares. International Mathematics Research Notices. 2017(7), 2219–2248.
  mla: Browning, Timothy D., and Sean Prendiville. “A Transference Approach to a Roth-Type
    Theorem in the Squares.” <i>International Mathematics Research Notices</i>, vol.
    2017, no. 7, Oxford University Press, 2017, pp. 2219–48, doi:<a href="https://doi.org/10.1093/imrn/rnw096">10.1093/imrn/rnw096</a>.
  short: T.D. Browning, S. Prendiville, International Mathematics Research Notices
    2017 (2017) 2219–2248.
date_created: 2018-12-11T11:45:31Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2024-03-05T11:52:36Z
day: '01'
doi: 10.1093/imrn/rnw096
extern: '1'
external_id:
  arxiv:
  - '1510.00136'
intvolume: '      2017'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1510.00136
month: '04'
oa: 1
oa_version: Preprint
page: 2219 - 2248
publication: International Mathematics Research Notices
publication_identifier:
  issn:
  - 1073-7928
publication_status: published
publisher: Oxford University Press
publist_id: '7634'
quality_controlled: '1'
status: public
title: A transference approach to a Roth-type theorem in the squares
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2017
year: '2017'
...
---
_id: '269'
abstract:
- lang: eng
  text: We investigate Fano varieties defined over a number field that contain subvarieties
    whose number of rational points of bounded height is comparable to the total number
    on the variety.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Daniel
  full_name: Loughran, Daniel
  last_name: Loughran
citation:
  ama: Browning TD, Loughran D. Varieties with too many rational points. <i>Mathematische
    Zeitschrift</i>. 2017;285(3-4):1249-1267. doi:<a href="https://doi.org/10.1007/s00209-016-1746-2">10.1007/s00209-016-1746-2</a>
  apa: Browning, T. D., &#38; Loughran, D. (2017). Varieties with too many rational
    points. <i>Mathematische Zeitschrift</i>. Springer. <a href="https://doi.org/10.1007/s00209-016-1746-2">https://doi.org/10.1007/s00209-016-1746-2</a>
  chicago: Browning, Timothy D, and Daniel Loughran. “Varieties with Too Many Rational
    Points.” <i>Mathematische Zeitschrift</i>. Springer, 2017. <a href="https://doi.org/10.1007/s00209-016-1746-2">https://doi.org/10.1007/s00209-016-1746-2</a>.
  ieee: T. D. Browning and D. Loughran, “Varieties with too many rational points,”
    <i>Mathematische Zeitschrift</i>, vol. 285, no. 3–4. Springer, pp. 1249–1267,
    2017.
  ista: Browning TD, Loughran D. 2017. Varieties with too many rational points. Mathematische
    Zeitschrift. 285(3–4), 1249–1267.
  mla: Browning, Timothy D., and Daniel Loughran. “Varieties with Too Many Rational
    Points.” <i>Mathematische Zeitschrift</i>, vol. 285, no. 3–4, Springer, 2017,
    pp. 1249–67, doi:<a href="https://doi.org/10.1007/s00209-016-1746-2">10.1007/s00209-016-1746-2</a>.
  short: T.D. Browning, D. Loughran, Mathematische Zeitschrift 285 (2017) 1249–1267.
date_created: 2018-12-11T11:45:32Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2024-03-05T11:56:29Z
day: '01'
doi: 10.1007/s00209-016-1746-2
extern: '1'
external_id:
  arxiv:
  - '1311.5755'
intvolume: '       285'
issue: 3-4
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1311.5755
month: '04'
oa: 1
oa_version: Preprint
page: 1249 - 1267
publication: Mathematische Zeitschrift
publication_status: published
publisher: Springer
publist_id: '7633'
quality_controlled: '1'
status: public
title: Varieties with too many rational points
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 285
year: '2017'
...
---
_id: '270'
abstract:
- lang: eng
  text: Given a symmetric variety Y defined over Q and a non-zero polynomial with
    integer coefficients, we use techniques from homogeneous dynamics to establish
    conditions under which the polynomial can be made r-free for a Zariski dense set
    of integral points on Y . We also establish an asymptotic counting formula for
    this set. In the special case that Y is a quadric hypersurface, we give explicit
    bounds on the size of r by combining the argument with a uniform upper bound for
    the density of integral points on general affine quadrics defined over Q.
acknowledgement: While working on this paper the authors were supported by ERC grants
  306457 and 239606, respectively.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Alexander
  full_name: Gorodnik, Alexander
  last_name: Gorodnik
citation:
  ama: Browning TD, Gorodnik A. Power-free values of polynomials on symmetric varieties.
    <i>Proceedings of the London Mathematical Society</i>. 2017;114(6):1044-1080.
    doi:<a href="https://doi.org/10.1112/plms.12030">10.1112/plms.12030</a>
  apa: Browning, T. D., &#38; Gorodnik, A. (2017). Power-free values of polynomials
    on symmetric varieties. <i>Proceedings of the London Mathematical Society</i>.
    Wiley. <a href="https://doi.org/10.1112/plms.12030">https://doi.org/10.1112/plms.12030</a>
  chicago: Browning, Timothy D, and Alexander Gorodnik. “Power-Free Values of Polynomials
    on Symmetric Varieties.” <i>Proceedings of the London Mathematical Society</i>.
    Wiley, 2017. <a href="https://doi.org/10.1112/plms.12030">https://doi.org/10.1112/plms.12030</a>.
  ieee: T. D. Browning and A. Gorodnik, “Power-free values of polynomials on symmetric
    varieties,” <i>Proceedings of the London Mathematical Society</i>, vol. 114, no.
    6. Wiley, pp. 1044–1080, 2017.
  ista: Browning TD, Gorodnik A. 2017. Power-free values of polynomials on symmetric
    varieties. Proceedings of the London Mathematical Society. 114(6), 1044–1080.
  mla: Browning, Timothy D., and Alexander Gorodnik. “Power-Free Values of Polynomials
    on Symmetric Varieties.” <i>Proceedings of the London Mathematical Society</i>,
    vol. 114, no. 6, Wiley, 2017, pp. 1044–80, doi:<a href="https://doi.org/10.1112/plms.12030">10.1112/plms.12030</a>.
  short: T.D. Browning, A. Gorodnik, Proceedings of the London Mathematical Society
    114 (2017) 1044–1080.
date_created: 2018-12-11T11:45:32Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2024-03-05T11:58:25Z
day: '01'
doi: 10.1112/plms.12030
extern: '1'
external_id:
  arxiv:
  - '1606.06342'
intvolume: '       114'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1606.06342
month: '06'
oa: 1
oa_version: Preprint
page: 1044 - 1080
publication: Proceedings of the London Mathematical Society
publication_identifier:
  issn:
  - 0024-6115
publication_status: published
publisher: Wiley
publist_id: '7632'
quality_controlled: '1'
status: public
title: Power-free values of polynomials on symmetric varieties
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '272'
abstract:
- lang: eng
  text: Given a number field K/Q and a polynomial P ε Q [t], all of whose roots are
    Q, let X be the variety defined by the equation NK (x) = P (t). Combining additive
    combinatiorics with descent we show that the Brauer-Manin obstruction is the only
    obstruction to the Hesse principle and weak approximation on any smooth and projective
    model of X.
acknowledgement: While working on this paper the first author was supported by ERC
  grant 306457 and the second author was supported by EPSRC grant EP/E053262/1 and
  by ERC grant 208091. Some of this work was carried out during the programme “Arithmetic
  and geometry” in 2013 at the Hausdorff Institute in Bonn.
article_processing_charge: No
article_type: original
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Lilian
  full_name: Matthiesen, Lilian
  last_name: Matthiesen
citation:
  ama: Browning TD, Matthiesen L. Norm forms for arbitrary number fields as products
    of linear polynomials. <i>Annales Scientifiques de l’Ecole Normale Superieure</i>.
    2017;50(6):1383-1446. doi:<a href="https://doi.org/10.24033/asens.2348">10.24033/asens.2348</a>
  apa: Browning, T. D., &#38; Matthiesen, L. (2017). Norm forms for arbitrary number
    fields as products of linear polynomials. <i>Annales Scientifiques de l’Ecole
    Normale Superieure</i>. Societe Mathematique de France. <a href="https://doi.org/10.24033/asens.2348">https://doi.org/10.24033/asens.2348</a>
  chicago: Browning, Timothy D, and Lilian Matthiesen. “Norm Forms for Arbitrary Number
    Fields as Products of Linear Polynomials.” <i>Annales Scientifiques de l’Ecole
    Normale Superieure</i>. Societe Mathematique de France, 2017. <a href="https://doi.org/10.24033/asens.2348">https://doi.org/10.24033/asens.2348</a>.
  ieee: T. D. Browning and L. Matthiesen, “Norm forms for arbitrary number fields
    as products of linear polynomials,” <i>Annales Scientifiques de l’Ecole Normale
    Superieure</i>, vol. 50, no. 6. Societe Mathematique de France, pp. 1383–1446,
    2017.
  ista: Browning TD, Matthiesen L. 2017. Norm forms for arbitrary number fields as
    products of linear polynomials. Annales Scientifiques de l’Ecole Normale Superieure.
    50(6), 1383–1446.
  mla: Browning, Timothy D., and Lilian Matthiesen. “Norm Forms for Arbitrary Number
    Fields as Products of Linear Polynomials.” <i>Annales Scientifiques de l’Ecole
    Normale Superieure</i>, vol. 50, no. 6, Societe Mathematique de France, 2017,
    pp. 1383–446, doi:<a href="https://doi.org/10.24033/asens.2348">10.24033/asens.2348</a>.
  short: T.D. Browning, L. Matthiesen, Annales Scientifiques de l’Ecole Normale Superieure
    50 (2017) 1383–1446.
date_created: 2018-12-11T11:45:32Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2024-03-05T12:13:35Z
day: '01'
doi: 10.24033/asens.2348
extern: '1'
intvolume: '        50'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://research-information.bristol.ac.uk/en/publications/norm-forms-for-arbitrary-number-fields-as-products-of-linear-polynomials(f79a584b-ec58-47c8-aa97-8c5505e3f751).html
month: '12'
oa: 1
oa_version: Submitted Version
page: 1383 - 1446
publication: Annales Scientifiques de l'Ecole Normale Superieure
publication_status: published
publisher: Societe Mathematique de France
publist_id: '7630'
quality_controlled: '1'
status: public
title: Norm forms for arbitrary number fields as products of linear polynomials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2017'
...
---
_id: '274'
abstract:
- lang: eng
  text: We consider the problem of estimating the partition function Z(β)=∑xexp(−β(H(x))
    of a Gibbs distribution with a Hamilton H(⋅), or more precisely the logarithm
    of the ratio q=lnZ(0)/Z(β). It has been recently shown how to approximate q with
    high probability assuming the existence of an oracle that produces samples from
    the Gibbs distribution for a given parameter value in [0,β]. The current best
    known approach due to Huber [9] uses O(qlnn⋅[lnq+lnlnn+ε−2]) oracle calls on average
    where ε is the desired accuracy of approximation and H(⋅) is assumed to lie in
    {0}∪[1,n]. We improve the complexity to O(qlnn⋅ε−2) oracle calls. We also show
    that the same complexity can be achieved if exact oracles are replaced with approximate
    sampling oracles that are within O(ε2qlnn) variation distance from exact oracles.
    Finally, we prove a lower bound of Ω(q⋅ε−2) oracle calls under a natural model
    of computation.
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
  full_name: Kolmogorov, Vladimir
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
citation:
  ama: 'Kolmogorov V. A faster approximation algorithm for the Gibbs partition function.
    In: <i>Proceedings of the 31st Conference On Learning Theory</i>. Vol 75. ML Research
    Press; 2017:228-249.'
  apa: Kolmogorov, V. (2017). A faster approximation algorithm for the Gibbs partition
    function. In <i>Proceedings of the 31st Conference On Learning Theory</i> (Vol.
    75, pp. 228–249). ML Research Press.
  chicago: Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition
    Function.” In <i>Proceedings of the 31st Conference On Learning Theory</i>, 75:228–49.
    ML Research Press, 2017.
  ieee: V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,”
    in <i>Proceedings of the 31st Conference On Learning Theory</i>, 2017, vol. 75,
    pp. 228–249.
  ista: 'Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition
    function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual
    Conference on Learning Theory  vol. 75, 228–249.'
  mla: Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition
    Function.” <i>Proceedings of the 31st Conference On Learning Theory</i>, vol.
    75, ML Research Press, 2017, pp. 228–49.
  short: V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory,
    ML Research Press, 2017, pp. 228–249.
conference:
  end_date: 2018-07-09
  name: 'COLT: Annual Conference on Learning Theory '
  start_date: 2018-07-06
date_created: 2018-12-11T11:45:33Z
date_published: 2017-12-27T00:00:00Z
date_updated: 2023-10-17T12:32:13Z
day: '27'
ddc:
- '510'
department:
- _id: VlKo
ec_funded: 1
external_id:
  arxiv:
  - '1608.04223'
file:
- access_level: open_access
  checksum: 89db06a0e8083524449cb59b56bf4e5b
  content_type: application/pdf
  creator: dernst
  date_created: 2020-05-12T09:23:27Z
  date_updated: 2020-07-14T12:45:45Z
  file_id: '7820'
  file_name: 2018_PMLR_Kolmogorov.pdf
  file_size: 408974
  relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
intvolume: '        75'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 228-249
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Proceedings of the 31st Conference On Learning Theory
publication_status: published
publisher: ML Research Press
publist_id: '7628'
quality_controlled: '1'
status: public
title: A faster approximation algorithm for the Gibbs partition function
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 75
year: '2017'
...
