@inproceedings{21623, abstract = {We present a method to overcome the Manley-Rowe limit in a Q-factor engineered multimodal nonlinear cavity. Cascading nonlinear processes enable continuous-wave terahertz generation with a theoretical conversion efficiency of 98.8%.}, author = {Salamin, Yannick and Roques-Carmes, Charles and Lin, Zin and Johnson, Steven G. and Soljačić, Marin}, booktitle = {Conference on Lasers and Electro-Optics}, location = {San Jose, CA, United States}, publisher = {Optica Publishing Group}, title = {{Overcoming the Manley-Rowe limit for CW terahertz generation in Q-engineered multimodal cavity}}, doi = {10.1364/cleo_qels.2021.ftu2j.3}, year = {2021}, } @inbook{14987, abstract = {The goal of zero-shot learning is to construct a classifier that can identify object classes for which no training examples are available. When training data for some of the object classes is available but not for others, the name generalized zero-shot learning is commonly used. In a wider sense, the phrase zero-shot is also used to describe other machine learning-based approaches that require no training data from the problem of interest, such as zero-shot action recognition or zero-shot machine translation.}, author = {Lampert, Christoph}, booktitle = {Computer Vision}, editor = {Ikeuchi, Katsushi}, isbn = {9783030634155}, pages = {1395--1397}, publisher = {Springer}, title = {{Zero-Shot Learning}}, doi = {10.1007/978-3-030-63416-2_874}, year = {2021}, } @article{15137, abstract = {Characteristic properties of type III CRISPR-Cas systems include recognition of target RNA and the subsequent induction of a multifaceted immune response. This involves sequence-specific cleavage of the target RNA and production of cyclic oligoadenylate (cOA) molecules. Here we report that an exposed seed region at the 3′ end of the crRNA is essential for target RNA binding and cleavage, whereas cOA production requires base pairing at the 5′ end of the crRNA. Moreover, we uncover that the variation in the size and composition of type III complexes within a single host results in variable seed regions. This may prevent escape by invading genetic elements, while controlling cOA production tightly to prevent unnecessary damage to the host. Lastly, we use these findings to develop a new diagnostic tool, SCOPE, for the specific detection of SARS-CoV-2 from human nasal swab samples, revealing sensitivities in the atto-molar range.}, author = {Steens, Jurre A. and Zhu, Yifan and Taylor, David W. and Bravo, Jack Peter Kelly and Prinsen, Stijn H. P. and Schoen, Cor D. and Keijser, Bart J. F. and Ossendrijver, Michel and Hofstra, L. Marije and Brouns, Stan J. J. and Shinkai, Akeo and van der Oost, John and Staals, Raymond H. J.}, issn = {2041-1723}, journal = {Nature Communications}, keywords = {General Physics and Astronomy, General Biochemistry, Genetics and Molecular Biology, General Chemistry, Multidisciplinary}, publisher = {Springer Nature}, title = {{SCOPE enables type III CRISPR-Cas diagnostics using flexible targeting and stringent CARF ribonuclease activation}}, doi = {10.1038/s41467-021-25337-5}, volume = {12}, year = {2021}, } @article{15140, abstract = {Remdesivir is a nucleoside analog approved by the US FDA for treatment of COVID-19. Here, we present a 3.9-Å-resolution cryo-EM reconstruction of a remdesivir-stalled RNA-dependent RNA polymerase complex, revealing full incorporation of 3 copies of remdesivir monophosphate (RMP) and a partially incorporated fourth RMP in the active site. The structure reveals that RMP blocks RNA translocation after incorporation of 3 bases following RMP, resulting in delayed chain termination, which can guide the rational design of improved antiviral drugs.}, author = {Bravo, Jack Peter Kelly and Dangerfield, Tyler L. and Taylor, David W. and Johnson, Kenneth A.}, issn = {1097-2765}, journal = {Molecular Cell}, keywords = {Cell Biology, Molecular Biology}, number = {7}, pages = {1548--1552.e4}, publisher = {Elsevier}, title = {{Remdesivir is a delayed translocation inhibitor of SARS-CoV-2 replication}}, doi = {10.1016/j.molcel.2021.01.035}, volume = {81}, year = {2021}, } @article{15219, abstract = {We have carried out a search for massive white dwarfs (WDs) in the direction of young open star clusters using the Gaia DR2 database. The aim of this survey was (1) to provide robust data for new and previously known high-mass WDs regarding cluster membership, (2) to highlight WDs previously included in the initial final mass relation (IFMR) that are unlikely members of their respective clusters according to Gaia astrometry, and (3) to select an unequivocal WD sample that could then be compared with the host clusters' turnoff masses. All promising WD candidates in each cluster color–magnitude diagram were followed up with spectroscopy from Gemini in order to determine whether they were indeed WDs and derive their masses, temperatures, and ages. In order to be considered cluster members, white dwarfs were required to (1) have proper motions and parallaxes within 2σ, 3σ, or 4σ of those of their potential parent cluster based on how contaminated the field was in their region of the sky, (2) have a cooling age that was less than the cluster age, and (3) have a mass that was broadly consistent with the IFMR. A number of WDs included in current versions of the IFMR turned out to be nonmembers, and a number of apparent members, based on Gaia's astrometric data alone, were rejected, as their mass and/or cooling times were incompatible with cluster membership. In this way, we developed a highly selected IFMR sample for high-mass WDs that, surprisingly, contained no precursor masses significantly in excess of ∼ 6 M⊙.}, author = {Richer, Harvey B. and Caiazzo, Ilaria and Du, Helen and Grondin, Steffani and Hegarty, James and Heyl, Jeremy and Kerr, Ronan and Miller, David R. and Thiele, Sarah}, issn = {1538-4357}, journal = {The Astrophysical Journal}, keywords = {Space and Planetary Science, Astronomy and Astrophysics}, number = {2}, publisher = {American Astronomical Society}, title = {{Massive white dwarfs in young star clusters}}, doi = {10.3847/1538-4357/abdeb7}, volume = {912}, year = {2021}, } @article{15264, abstract = {Signaling by the B cell antigen receptor (BCR) initiates actin remodeling. The assembly of branched actin networks that are nucleated by the Arp2/3 complex exert outward force on the plasma membrane, allowing B cells to form membrane protrusions that can scan the surface of antigen-presenting cells (APCs). The resulting Arp2/3 complex-dependent actin retrograde flow promotes the centripetal movement and progressive coalescence of BCR microclusters, which amplifies BCR signaling. Glia maturation factor γ (GMFγ) is an actin disassembly-protein that releases Arp2/3 complex-nucleated actin filaments from actin networks. By doing so, GMFγ could either oppose the actions of the Arp2/3 complex or support Arp2/3 complex-nucleated actin polymerization by contributing to the recycling of actin monomers and Arp2/3 complexes. We now show that reducing the levels of GMFγ in human B cell lines via transfection with a specific siRNA impairs the ability of B cells to spread on antigen-coated surfaces, decreases the velocity of actin retrograde flow, diminishes the coalescence of BCR microclusters into a central cluster at the B cell-APC contact site, and decreases APC-induced BCR signaling. These effects of depleting GMFγ are similar to what occurs when the Arp2/3 complex is inhibited. This suggests that GMFγ cooperates with the Arp2/3 complex to support BCR-induced actin remodeling and amplify BCR signaling at the immune synapse.}, author = {Deretic, Nikola and Bolger-Munro, Madison and Choi, Kate and Abraham, Libin and Gold, Michael R.}, issn = {2296-634X}, journal = {Frontiers in Cell and Developmental Biology}, keywords = {Cell Biology, Developmental Biology}, publisher = {Frontiers Media}, title = {{The actin-disassembly protein glia maturation factor γ enhances actin remodeling and B cell antigen receptor signaling at the immune synapse}}, doi = {10.3389/fcell.2021.647063}, volume = {9}, year = {2021}, } @article{15275, abstract = {In 1916, Schur introduced the Ramsey number r(3; m), which is the minimum integer n > 1 such that for any m-coloring of the edges of the complete graph Kn, there is a monochromatic copy of K3. He showed that r(3; m) ≤ O(m!), and a simple construction demonstrates that r(3; m) ≥ 2Ω(m). An old conjecture of Erdős states that r(3; m) = 2Θ(m). In this note, we prove the conjecture for m-colorings with bounded VC-dimension, that is, for m-colorings with the property that the set system induced by the neighborhoods of the vertices with respect to each color class has bounded VC-dimension.}, author = {Fox, Jacob and Pach, János and Suk, Andrew}, issn = {1439-6912}, journal = {Combinatorica}, keywords = {Computational Mathematics, Discrete Mathematics and Combinatorics}, number = {6}, pages = {803--813}, publisher = {Springer Nature}, title = {{Bounded VC-dimension implies the Schur-Erdős conjecture}}, doi = {10.1007/s00493-021-4530-9}, volume = {41}, year = {2021}, } @article{20619, abstract = {The first author’s previous work established Solomon’s WDVV-type relations for Welschinger’s invariant curve counts in real symplectic fourfolds by lifting geometric relations over possibly unorientable morphisms. We apply her framework to obtain WDVV-style relations for the disk invariants of real symplectic sixfolds with some symmetry, in particular confirming Alcolado’s prediction for P^3 and extending it to other spaces. These relations reduce the computation of Welschinger’s invariants of many real symplectic sixfolds to invariants in small degrees and provide lower bounds for counts of real rational curves with positive-dimensional insertions in some cases. In the case of P^3, our lower bounds fit perfectly with Kollár’s vanishing results.}, author = {Chen, Xujia and Zinger, Aleksey}, issn = {1432-1807}, journal = {Mathematische Annalen}, number = {3-4}, pages = {1231--1313}, publisher = {Springer Nature}, title = {{WDVV-type relations for disk Gromov–Witten invariants in dimension 6}}, doi = {10.1007/s00208-020-02130-1}, volume = {379}, year = {2021}, } @article{10000, abstract = {Inhibition or targeted deletion of histone deacetylase 3 (HDAC3) is neuroprotective in a variety neurodegenerative conditions, including retinal ganglion cells (RGCs) after acute optic nerve damage. Consistent with this, induced HDAC3 expression in cultured cells shows selective toxicity to neurons. Despite an established role for HDAC3 in neuronal pathology, little is known regarding the mechanism of this pathology.}, author = {Schmitt, Heather M. and Fehrman, Rachel L. and Maes, Margaret E and Yang, Huan and Guo, Lian Wang and Schlamp, Cassandra L. and Pelzel, Heather R. and Nickells, Robert W.}, issn = {1552-5783}, journal = {Investigative Ophthalmology and Visual Science}, number = {10}, publisher = {Association for Research in Vision and Ophthalmology}, title = {{Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression}}, doi = {10.1167/IOVS.62.10.14}, volume = {62}, year = {2021}, } @inproceedings{10002, abstract = {We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with n vertices and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires O(n2) symbolic operations and O(1) symbolic space. The only other symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of ω -regular objectives for MDPs. We consider the canonical parity objectives for ω -regular objectives, and for parity objectives with d -priorities we present an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 .}, author = {Chatterjee, Krishnendu and Dvorak, Wolfgang and Henzinger, Monika H and Svozil, Alexander}, booktitle = {Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science}, isbn = {978-1-6654-4896-3}, issn = {1043-6871}, keywords = {Computer science, Computational modeling, Markov processes, Probabilistic logic, Formal verification, Game Theory}, location = {Rome, Italy}, pages = {1--13}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Symbolic time and space tradeoffs for probabilistic verification}}, doi = {10.1109/LICS52264.2021.9470739}, year = {2021}, } @inproceedings{10004, abstract = {Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs.}, author = {Chatterjee, Krishnendu and Doyen, Laurent}, booktitle = {Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science}, isbn = {978-1-6654-4896-3}, issn = {1043-6871}, keywords = {Computer science, Heuristic algorithms, Memory management, Automata, Markov processes, Probability distribution, Complexity theory}, location = {Rome, Italy}, pages = {1--13}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Stochastic processes with expected stopping time}}, doi = {10.1109/LICS52264.2021.9470595}, year = {2021}, } @phdthesis{10007, abstract = {The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis.}, author = {Hensel, Sebastian}, issn = {2663-337X}, pages = {300}, publisher = {Institute of Science and Technology Austria}, title = {{Curvature driven interface evolution: Uniqueness properties of weak solution concepts}}, doi = {10.15479/at:ista:10007}, year = {2021}, } @phdthesis{10030, abstract = {This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning non-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces.}, author = {Portinale, Lorenzo}, issn = {2663-337X}, publisher = {Institute of Science and Technology Austria}, title = {{Discrete-to-continuum limits of transport problems and gradient flows in the space of measures}}, doi = {10.15479/at:ista:10030}, year = {2021}, } @article{10033, abstract = {The ⊗*-monoidal structure on the category of sheaves on the Ran space is not pro-nilpotent in the sense of [3]. However, under some connectivity assumptions, we prove that Koszul duality induces an equivalence of categories and that this equivalence behaves nicely with respect to Verdier duality on the Ran space and integrating along the Ran space, i.e. taking factorization homology. Based on ideas sketched in [4], we show that these results also offer a simpler alternative to one of the two main steps in the proof of the Atiyah-Bott formula given in [7] and [5].}, author = {Ho, Quoc P}, issn = {1090-2082}, journal = {Advances in Mathematics}, keywords = {Chiral algebras, Chiral homology, Factorization algebras, Koszul duality, Ran space}, publisher = {Elsevier}, title = {{The Atiyah-Bott formula and connectivity in chiral Koszul duality}}, doi = {10.1016/j.aim.2021.107992}, volume = {392}, year = {2021}, } @inproceedings{10041, abstract = {Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth δ , the loss in security is at most exponential in δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security.}, author = {Kamath Hosdurg, Chethan and Klein, Karen and Pietrzak, Krzysztof Z and Wichs, Daniel}, booktitle = {41st Annual International Cryptology Conference, Part II }, isbn = {978-3-030-84244-4}, issn = {1611-3349}, location = {Virtual}, pages = {486--515}, publisher = {Springer Nature}, title = {{Limits on the Adaptive Security of Yao’s Garbling}}, doi = {10.1007/978-3-030-84245-1_17}, volume = {12826}, year = {2021}, } @inproceedings{10052, abstract = {A deterministic finite automaton (DFA) 𝒜 is composite if its language L(𝒜) can be decomposed into an intersection ⋂_{i = 1}^k L(𝒜_i) of languages of smaller DFAs. Otherwise, 𝒜 is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and while they proved that we can decide whether a DFA is composite, the precise complexity of this problem is still open, with a doubly-exponential gap between the upper and lower bounds. In this work, we focus on permutation DFAs, i.e., those for which the transition monoid is a group. We provide an NP algorithm to decide whether a permutation DFA is composite, and show that the difficulty of this problem comes from the number of non-accepting states of the instance: we give a fixed-parameter tractable algorithm with the number of rejecting states as the parameter. Moreover, we investigate the class of commutative permutation DFAs. Their structural properties allow us to decide compositionality in NL, and even in LOGSPACE if the alphabet size is fixed. Despite this low complexity, we show that complex behaviors still arise in this class: we provide a family of composite DFAs each requiring polynomially many factors with respect to its size. We also consider the variant of the problem that asks whether a DFA is k-factor composite, that is, decomposable into k smaller DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation DFAs, restricting the number of factors makes the decision computationally harder, and yields a problem with tight bounds: it is NP-complete. Finally, we show that in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton alphabet.}, author = {Jecker, Ismael R and Mazzocchi, Nicolas and Wolf, Petra}, booktitle = {32nd International Conference on Concurrency Theory}, isbn = {978-3-9597-7203-7}, issn = {1868-8969}, location = {Paris, France}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Decomposing permutation automata}}, doi = {10.4230/LIPIcs.CONCUR.2021.18}, volume = {203}, year = {2021}, } @inproceedings{10054, abstract = {Graphs and games on graphs are fundamental models for the analysis of reactive systems, in particular, for model-checking and the synthesis of reactive systems. The class of ω-regular languages provides a robust specification formalism for the desired properties of reactive systems. In the classical infinitary formulation of the liveness part of an ω-regular specification, a "good" event must happen eventually without any bound between the good events. A stronger notion of liveness is bounded liveness, which requires that good events happen within d transitions. Given a graph or a game graph with n vertices, m edges, and a bounded liveness objective, the previous best-known algorithmic bounds are as follows: (i) O(dm) for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs. Our main contributions improve these long-standing algorithmic bounds. For graphs we present: (i) a randomized algorithm with one-sided error with running time O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic linear-time algorithm for the complement of bounded liveness objectives. For games on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives.}, author = {Chatterjee, Krishnendu and Henzinger, Monika H and Kale, Sagar Sudhir and Svozil, Alexander}, booktitle = {48th International Colloquium on Automata, Languages, and Programming}, isbn = {978-3-95977-195-5}, issn = {1868-8969}, location = {Glasgow, Scotland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Faster algorithms for bounded liveness in graphs and game graphs}}, doi = {10.4230/LIPIcs.ICALP.2021.124}, volume = {198}, year = {2021}, } @inproceedings{10055, abstract = {Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid M, it is natural to ask how long a sequence of elements of M needs to be to ensure the presence of consecutive idempotent factors. This question is formalised through the notion of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains k consecutive non-empty factors that correspond to the same idempotent element of M. In this work, we study the behaviour of the Ramsey function R_M by investigating the regular 𝒟-length of M, defined as the largest size L(M) of a submonoid of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the max operation. We show that the regular 𝒟-length of M determines the degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications of this result, we provide the value of the regular 𝒟-length of diverse monoids. In particular, we prove that the full monoid of n × n Boolean matrices, which is used to express transition monoids of non-deterministic automata, has a regular 𝒟-length of (n²+n+2)/2.}, author = {Jecker, Ismael R}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science}, isbn = {978-3-9597-7180-1}, issn = {1868-8969}, location = {Saarbrücken, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{A Ramsey theorem for finite monoids}}, doi = {10.4230/LIPIcs.STACS.2021.44}, volume = {187}, year = {2021}, } @article{10069, abstract = {The extent to which women differ in the course of blood cell counts throughout pregnancy, and the importance of these changes to pregnancy outcomes has not been well defined. Here, we develop a series of statistical analyses of repeated measures data to reveal the degree to which women differ in the course of pregnancy, predict the changes that occur, and determine the importance of these changes for post-partum hemorrhage (PPH) which is one of the leading causes of maternal mortality. We present a prospective cohort of 4082 births recorded at the University Hospital, Lausanne, Switzerland between 2009 and 2014 where full labour records could be obtained, along with complete blood count data taken at hospital admission. We find significant differences, at a [Formula: see text] level, among women in how blood count values change through pregnancy for mean corpuscular hemoglobin, mean corpuscular volume, mean platelet volume, platelet count and red cell distribution width. We find evidence that almost all complete blood count values show trimester-specific associations with PPH. For example, high platelet count (OR 1.20, 95% CI 1.01-1.53), high mean platelet volume (OR 1.58, 95% CI 1.04-2.08), and high erythrocyte levels (OR 1.36, 95% CI 1.01-1.57) in trimester 1 increased PPH, but high values in trimester 3 decreased PPH risk (OR 0.85, 0.79, 0.67 respectively). We show that differences among women in the course of blood cell counts throughout pregnancy have an important role in shaping pregnancy outcome and tracking blood count value changes through pregnancy improves identification of women at increased risk of postpartum hemorrhage. This study provides greater understanding of the complex changes in blood count values that occur through pregnancy and provides indicators to guide the stratification of patients into risk groups.}, author = {Robinson, Matthew Richard and Patxot, Marion and Stojanov, Miloš and Blum, Sabine and Baud, David}, issn = {2045-2322}, journal = {Scientific Reports}, publisher = {Springer Nature}, title = {{Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy}}, doi = {10.1038/s41598-021-98411-z}, volume = {11}, year = {2021}, } @inproceedings{10072, abstract = {The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthrough paper of Moser and Tardos and follow-up works revealed that the LLL has intimate connections with a class of stochastic local search algorithms for finding such desirable objects. In particular, it can be seen as a sufficient condition for this type of algorithms to converge fast. Besides conditions for existence of and fast convergence to desirable objects, one may naturally ask further questions regarding properties of these algorithms. For instance, "are they parallelizable?", "how many solutions can they output?", "what is the expected "weight" of a solution?", etc. These questions and more have been answered for a class of LLL-inspired algorithms called commutative. In this paper we introduce a new, very natural and more general notion of commutativity (essentially matrix commutativity) which allows us to show a number of new refined properties of LLL-inspired local search algorithms with significantly simpler proofs.}, author = {Harris, David G. and Iliopoulos, Fotis and Kolmogorov, Vladimir}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques}, isbn = {978-3-9597-7207-5}, issn = {1868-8969}, location = {Virtual}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{A new notion of commutativity for the algorithmic Lovász Local Lemma}}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.31}, volume = {207}, year = {2021}, }