@phdthesis{51, abstract = {Asymmetries have long been known about in the central nervous system. From gross anatomical differences, such as the presence of the parapineal organ in only one hemisphere of the developing zebrafish, to more subtle differences in activity between both hemispheres, as seen in freely roaming animals or human participants under PET and fMRI imaging analysis. The presence of asymmetries has been demonstrated to have huge behavioural implications, with their disruption often leading to the generation of neurological disorders, memory problems, changes in personality, and in an organism's health and well-being. For my Ph.D. work I aimed to tackle two important avenues of research. The first being the process of input-side dependency in the hippocampus, with the goal of finding a key gene responsible for its development (Gene X). The second project was to do with experience-induced laterality formation in the hippocampus. Specifically, how laterality in the synapse density of the CA1 stratum radiatum (s.r.) could be induced purely through environmental enrichment. Through unilateral tracer injections into the CA3, I was able to selectively measure the properties of synapses within the CA1 and investigate how they differed based upon which hemisphere the presynaptic neurone originated. Having found the existence of a previously unreported reversed (left-isomerism) i.v. mutant, through morpholocal examination of labelled terminals in the CA1 s.r., I aimed to elucidate a key gene responsible for the process of left or right determination of inputs to the CA1 s.r.. This work relates to the previous finding of input-side dependent asymmetry in the wild-type rodent, where the origin of the projecting neurone to the CA1 will determine the morphology of a synapse, to a greater degree than the hemisphere in which the projection terminates. Using left- and right-isomerism i.v. mice, in combination with whole genome sequence analysis, I highlight Ena/VASP-like (Evl) as a potential target for Gene X. In relation to this topic, I also highlight my work in the recently published paper of how knockout of PirB can lead to a lack of input-side dependency in the murine hippocampus. For the second question, I show that the environmental enrichment paradigm will lead to an asymmetry in the synapse densities in the hippocampus of mice. I also highlight that the nature of the enrichment is of less consequence than the process of enrichment itself. I demonstrate that the CA3 region will dramatically alter its projection targets, in relation to environmental stimulation, with the asymmetry in synaptic density, caused by enrichment, relying heavily on commissural fibres. I also highlight the vital importance of input-side dependent asymmetry, as a necessary component of experience-dependent laterality formation in the CA1 s.r.. However, my results suggest that it isn't the only cause, as there appears to be a CA1 dependent mechanism also at play. Upon further investigation, I highlight the significant, and highly important, finding that the changes seen in the CA1 s.r. were predominantly caused through projections from the left-CA3, with the right-CA3 having less involvement in this mechanism.}, author = {Case, Matthew J}, issn = {2663-337X}, pages = {186}, publisher = {Institute of Science and Technology Austria}, title = {{From the left to the right: A tale of asymmetries, environments, and hippocampal development}}, doi = {10.15479/AT:ISTA:th_1032}, year = {2018}, } @article{519, abstract = {This study treats with the influence of a symmetry-breaking transversal magnetic field on the nonlinear dynamics of ferrofluidic Taylor-Couette flow – flow confined between two concentric independently rotating cylinders. We detected alternating ‘flip’ solutions which are flow states featuring typical characteristics of slow-fast-dynamics in dynamical systems. The flip corresponds to a temporal change in the axial wavenumber and we find them to appear either as pure 2-fold axisymmetric (due to the symmetry-breaking nature of the applied transversal magnetic field) or involving non-axisymmetric, helical modes in its interim solution. The latter ones show features of typical ribbon solutions. In any case the flip solutions have a preferential first axial wavenumber which corresponds to the more stable state (slow dynamics) and second axial wavenumber, corresponding to the short appearing more unstable state (fast dynamics). However, in both cases the flip time grows exponential with increasing the magnetic field strength before the flip solutions, living on 2-tori invariant manifolds, cease to exist, with lifetime going to infinity. Further we show that ferrofluidic flow turbulence differ from the classical, ordinary (usually at high Reynolds number) turbulence. The applied magnetic field hinders the free motion of ferrofluid partials and therefore smoothen typical turbulent quantities and features so that speaking of mildly chaotic dynamics seems to be a more appropriate expression for the observed motion. }, author = {Altmeyer, Sebastian}, journal = {Journal of Magnetism and Magnetic Materials}, pages = {427 -- 441}, publisher = {Elsevier}, title = {{Non-linear dynamics and alternating ‘flip’ solutions in ferrofluidic Taylor-Couette flow}}, doi = {10.1016/j.jmmm.2017.12.073}, volume = {452}, year = {2018}, } @phdthesis{52, abstract = {In this thesis we will discuss systems of point interacting fermions, their stability and other spectral properties. Whereas for bosons a point interacting system is always unstable this ques- tion is more subtle for a gas of two species of fermions. In particular the answer depends on the mass ratio between these two species. Most of this work will be focused on the N + M model which consists of two species of fermions with N, M particles respectively which interact via point interactions. We will introduce this model using a formal limit and discuss the N + 1 system in more detail. In particular, we will show that for mass ratios above a critical one, which does not depend on the particle number, the N + 1 system is stable. In the context of this model we will prove rigorous versions of Tan relations which relate various quantities of the point-interacting model. By restricting the N + 1 system to a box we define a finite density model with point in- teractions. In the context of this system we will discuss the energy change when introducing a point-interacting impurity into a system of non-interacting fermions. We will see that this change in energy is bounded independently of the particle number and in particular the bound only depends on the density and the scattering length. As another special case of the N + M model we will show stability of the 2 + 2 model for mass ratios in an interval around one. Further we will investigate a different model of point interactions which was discussed before in the literature and which is, contrary to the N + M model, not given by a limiting procedure but is based on a Dirichlet form. We will show that this system behaves trivially in the thermodynamic limit, i.e. the free energy per particle is the same as the one of the non-interacting system.}, author = {Moser, Thomas}, issn = {2663-337X}, pages = {115}, publisher = {Institute of Science and Technology Austria}, title = {{Point interactions in systems of fermions}}, doi = {10.15479/AT:ISTA:th_1043}, year = {2018}, } @article{53, abstract = {In 2013, a publication repository was implemented at IST Austria and 2015 after a thorough preparation phase a data repository was implemented - both based on the Open Source Software EPrints. In this text, designed as field report, we will reflect on our experiences with Open Source Software in general and specifically with EPrints regarding technical aspects but also regarding their characteristics of the user community. The second part is a pleading for including the end users in the process of implementation, adaption and evaluation.}, author = {Petritsch, Barbara and Porsche, Jana}, journal = {VÖB Mitteilungen}, number = {1}, pages = {199 -- 206}, publisher = {Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare}, title = {{IST PubRep and IST DataRep: the institutional repositories at IST Austria}}, doi = {10.31263/voebm.v71i1.1993}, volume = {71}, year = {2018}, } @article{530, abstract = {Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. We extend it to multiple coverings, proving short inclusion–exclusion formulas for the subset of Rn covered by at least k balls in a finite set. We implement two of the formulas in dimension n=3 and report on results obtained with our software.}, author = {Edelsbrunner, Herbert and Iglesias Ham, Mabel}, journal = {Computational Geometry: Theory and Applications}, pages = {119 -- 133}, publisher = {Elsevier}, title = {{Multiple covers with balls I: Inclusion–exclusion}}, doi = {10.1016/j.comgeo.2017.06.014}, volume = {68}, year = {2018}, } @article{536, abstract = {We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model.}, author = {Alistarh, Dan-Adrian and Aspnes, James and King, Valerie and Saia, Jared}, issn = {01782770}, journal = {Distributed Computing}, number = {6}, pages = {489--501}, publisher = {Springer}, title = {{Communication-efficient randomized consensus}}, doi = {10.1007/s00446-017-0315-1}, volume = {31}, year = {2018}, } @article{12193, abstract = {DNA methylation regulates eukaryotic gene expression and is extensively reprogrammed during animal development. However, whether developmental methylation reprogramming during the sporophytic life cycle of flowering plants regulates genes is presently unknown. Here we report a distinctive gene-targeted RNA-directed DNA methylation (RdDM) activity in the Arabidopsis thaliana male sexual lineage that regulates gene expression in meiocytes. Loss of sexual-lineage-specific RdDM causes mis-splicing of the MPS1 gene (also known as PRD2), thereby disrupting meiosis. Our results establish a regulatory paradigm in which de novo methylation creates a cell-lineage-specific epigenetic signature that controls gene expression and contributes to cellular function in flowering plants.}, author = {Walker, James and Gao, Hongbo and Zhang, Jingyi and Aldridge, Billy and Vickers, Martin and Higgins, James D. and Feng, Xiaoqi}, issn = {1546-1718}, journal = {Nature Genetics}, keywords = {Genetics}, number = {1}, pages = {130--137}, publisher = {Nature Research}, title = {{Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis}}, doi = {10.1038/s41588-017-0008-5}, volume = {50}, year = {2017}, } @article{1228, abstract = {Since 2006, reprogrammed cells have increasingly been used as a biomedical research technique in addition to neuro-psychiatric methods. These rapidly evolving techniques allow for the generation of neuronal sub-populations, and have sparked interest not only in monogenetic neuro-psychiatric diseases, but also in poly-genetic and poly-aetiological disorders such as schizophrenia (SCZ) and bipolar disorder (BPD). This review provides a summary of 19 publications on reprogrammed adult somatic cells derived from patients with SCZ, and five publications using this technique in patients with BPD. As both disorders are complex and heterogeneous, there is a plurality of hypotheses to be tested in vitro. In SCZ, data on alterations of dopaminergic transmission in vitro are sparse, despite the great explanatory power of the so-called DA hypothesis of SCZ. Some findings correspond to perturbations of cell energy metabolism, and observations in reprogrammed cells suggest neuro-developmental alterations. Some studies also report on the efficacy of medicinal compounds to revert alterations observed in cellular models. However, due to the paucity of replication studies, no comprehensive conclusions can be drawn from studies using reprogrammed cells at the present time. In the future, findings from cell culture methods need to be integrated with clinical, epidemiological, pharmacological and imaging data in order to generate a more comprehensive picture of SCZ and BPD.}, author = {Sauerzopf, Ulrich and Sacco, Roberto and Novarino, Gaia and Niello, Marco and Weidenauer, Ana and Praschak Rieder, Nicole and Sitte, Harald and Willeit, Matthaeus}, journal = {European Journal of Neuroscience}, number = {1}, pages = {45 -- 57}, publisher = {Wiley-Blackwell}, title = {{Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence}}, doi = {10.1111/ejn.13418}, volume = {45}, year = {2017}, } @inproceedings{12905, author = {Schlögl, Alois and Kiss, Janos}, booktitle = {AHPC17 – Austrian HPC Meeting 2017}, location = {Grundlsee, Austria}, pages = {28}, publisher = {FSP Scientific Computing}, title = {{Scientific Computing at IST Austria}}, year = {2017}, } @article{1294, abstract = {We study controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize the expected mean-payoff performance and stability (also known as variability in the literature). We argue that the basic notion of expressing the stability using the statistical variance of the mean payoff is sometimes insufficient, and propose an alternative definition. We show that a strategy ensuring both the expected mean payoff and the variance below given bounds requires randomization and memory, under both the above definitions. We then show that the problem of finding such a strategy can be expressed as a set of constraints.}, author = {Brázdil, Tomáš and Chatterjee, Krishnendu and Forejt, Vojtěch and Kučera, Antonín}, journal = {Journal of Computer and System Sciences}, pages = {144 -- 170}, publisher = {Elsevier}, title = {{Trading performance for stability in Markov decision processes}}, doi = {10.1016/j.jcss.2016.09.009}, volume = {84}, year = {2017}, } @inproceedings{13160, abstract = {Transforming deterministic ω -automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches. Moreover, the experiments demonstrate the potential of our method for LTL synthesis, using LTL-to-Rabin translators. It leads to significantly smaller parity automata when compared to state-of-the-art approaches on complex formulae.}, author = {Kretinsky, Jan and Meggendorfer, Tobias and Waldmann, Clara and Weininger, Maximilian}, booktitle = {Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783662545768}, issn = {1611-3349}, location = {Uppsala, Sweden}, pages = {443--460}, publisher = {Springer}, title = {{Index appearance record for transforming Rabin automata into parity automata}}, doi = {10.1007/978-3-662-54577-5_26}, volume = {10205}, year = {2017}, } @phdthesis{820, abstract = {The lac operon is a classic model system for bacterial gene regulation, and has been studied extensively in E. coli, a classic model organism. However, not much is known about E. coli’s ecology and life outside the laboratory, in particular in soil and water environments. The natural diversity of the lac operon outside the laboratory, its role in the ecology of E. coli and the selection pressures it is exposed to, are similarly unknown. In Chapter Two of this thesis, I explore the genetic diversity, phylogenetic history and signatures of selection of the lac operon across 20 natural isolates of E. coli and divergent clades of Escherichia. I found that complete lac operons were present in all isolates examined, which in all but one case were functional. The lac operon phylogeny conformed to the whole-genome phylogeny of the divergent Escherichia clades, which excludes horizontal gene transfer as an explanation for the presence of functional lac operons in these clades. All lac operon genes showed a signature of purifying selection; this signature was strongest for the lacY gene. Lac operon genes of human and environmental isolates showed similar signatures of selection, except the lacZ gene, which showed a stronger signature of selection in environmental isolates. In Chapter Three, I try to identify the natural genetic variation relevant for phenotype and fitness in the lac operon, comparing growth rate on lactose and LacZ activity of the lac operons of these wild isolates in a common genetic background. Sequence variation in the lac promoter region, upstream of the -10 and -35 RNA polymerase binding motif, predicted variation in LacZ activity at full induction, using a thermodynamic model of polymerase binding (Tugrul, 2016). However, neither variation in LacZ activity, nor RNA polymerase binding predicted by the model correlated with variation in growth rate. Lac operons of human and environmental isolates did not differ systematically in either growth rate on lactose or LacZ protein activity, suggesting that these lac operons have been exposed to similar selection pressures. We thus have no evidence that the phenotypic variation we measured is relevant for fitness. To start assessing the effect of genomic background on the growth phenotype conferred by the lac operon, I compared growth on minimal medium with lactose between lac operon constructs and the corresponding original isolates, I found that maximal growth rate was determined by genomic background, with almost all backgrounds conferring higher growth rates than lab strain K12 MG1655. However, I found no evidence that the lactose concentration at which growth was half maximal depended on genomic background.}, author = {Jesse, Fabienne}, issn = {2663-337X}, pages = {87}, publisher = {Institute of Science and Technology Austria}, title = {{The lac operon in the wild}}, doi = {10.15479/AT:ISTA:th_857}, year = {2017}, } @phdthesis{821, abstract = {This dissertation focuses on algorithmic aspects of program verification, and presents modeling and complexity advances on several problems related to the static analysis of programs, the stateless model checking of concurrent programs, and the competitive analysis of real-time scheduling algorithms. Our contributions can be broadly grouped into five categories. Our first contribution is a set of new algorithms and data structures for the quantitative and data-flow analysis of programs, based on the graph-theoretic notion of treewidth. It has been observed that the control-flow graphs of typical programs have special structure, and are characterized as graphs of small treewidth. We utilize this structural property to provide faster algorithms for the quantitative and data-flow analysis of recursive and concurrent programs. In most cases we make an algebraic treatment of the considered problem, where several interesting analyses, such as the reachability, shortest path, and certain kind of data-flow analysis problems follow as special cases. We exploit the constant-treewidth property to obtain algorithmic improvements for on-demand versions of the problems, and provide data structures with various tradeoffs between the resources spent in the preprocessing and querying phase. We also improve on the algorithmic complexity of quantitative problems outside the algebraic path framework, namely of the minimum mean-payoff, minimum ratio, and minimum initial credit for energy problems. Our second contribution is a set of algorithms for Dyck reachability with applications to data-dependence analysis and alias analysis. In particular, we develop an optimal algorithm for Dyck reachability on bidirected graphs, which are ubiquitous in context-insensitive, field-sensitive points-to analysis. Additionally, we develop an efficient algorithm for context-sensitive data-dependence analysis via Dyck reachability, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is (i)~linear in the number of call sites and (ii)~only logarithmic in the size of the whole library, as opposed to linear in the size of the whole library. Finally, we prove that Dyck reachability is Boolean Matrix Multiplication-hard in general, and the hardness also holds for graphs of constant treewidth. This hardness result strongly indicates that there exist no combinatorial algorithms for Dyck reachability with truly subcubic complexity. Our third contribution is the formalization and algorithmic treatment of the Quantitative Interprocedural Analysis framework. In this framework, the transitions of a recursive program are annotated as good, bad or neutral, and receive a weight which measures the magnitude of their respective effect. The Quantitative Interprocedural Analysis problem asks to determine whether there exists an infinite run of the program where the long-run ratio of the bad weights over the good weights is above a given threshold. We illustrate how several quantitative problems related to static analysis of recursive programs can be instantiated in this framework, and present some case studies to this direction. Our fourth contribution is a new dynamic partial-order reduction for the stateless model checking of concurrent programs. Traditional approaches rely on the standard Mazurkiewicz equivalence between traces, by means of partitioning the trace space into equivalence classes, and attempting to explore a few representatives from each class. We present a new dynamic partial-order reduction method called the Data-centric Partial Order Reduction (DC-DPOR). Our algorithm is based on a new equivalence between traces, called the observation equivalence. DC-DPOR explores a coarser partitioning of the trace space than any exploration method based on the standard Mazurkiewicz equivalence. Depending on the program, the new partitioning can be even exponentially coarser. Additionally, DC-DPOR spends only polynomial time in each explored class. Our fifth contribution is the use of automata and game-theoretic verification techniques in the competitive analysis and synthesis of real-time scheduling algorithms for firm-deadline tasks. On the analysis side, we leverage automata on infinite words to compute the competitive ratio of real-time schedulers subject to various environmental constraints. On the synthesis side, we introduce a new instance of two-player mean-payoff partial-information games, and show how the synthesis of an optimal real-time scheduler can be reduced to computing winning strategies in this new type of games.}, author = {Pavlogiannis, Andreas}, issn = {2663-337X}, pages = {418}, publisher = {Institute of Science and Technology Austria}, title = {{Algorithmic advances in program analysis and their applications}}, doi = {10.15479/AT:ISTA:th_854}, year = {2017}, } @article{822, abstract = {Polymicrobial infections constitute small ecosystems that accommodate several bacterial species. Commonly, these bacteria are investigated in isolation. However, it is unknown to what extent the isolates interact and whether their interactions alter bacterial growth and ecosystem resilience in the presence and absence of antibiotics. We quantified the complete ecological interaction network for 72 bacterial isolates collected from 23 individuals diagnosed with polymicrobial urinary tract infections and found that most interactions cluster based on evolutionary relatedness. Statistical network analysis revealed that competitive and cooperative reciprocal interactions are enriched in the global network, while cooperative interactions are depleted in the individual host community networks. A population dynamics model parameterized by our measurements suggests that interactions restrict community stability, explaining the observed species diversity of these communities. We further show that the clinical isolates frequently protect each other from clinically relevant antibiotics. Together, these results highlight that ecological interactions are crucial for the growth and survival of bacteria in polymicrobial infection communities and affect their assembly and resilience. }, author = {De Vos, Marjon and Zagórski, Marcin P and Mcnally, Alan and Bollenbach, Mark Tobias}, issn = {00278424}, journal = {PNAS}, number = {40}, pages = {10666 -- 10671}, publisher = {National Academy of Sciences}, title = {{Interaction networks, ecological stability, and collective antibiotic tolerance in polymicrobial infections}}, doi = {10.1073/pnas.1713372114}, volume = {114}, year = {2017}, } @article{823, abstract = {The resolution of a linear system with positive integer variables is a basic yet difficult computational problem with many applications. We consider sparse uncorrelated random systems parametrised by the density c and the ratio α=N/M between number of variables N and number of constraints M. By means of ensemble calculations we show that the space of feasible solutions endows a Van-Der-Waals phase diagram in the plane (c, α). We give numerical evidence that the associated computational problems become more difficult across the critical point and in particular in the coexistence region.}, author = {Colabrese, Simona and De Martino, Daniele and Leuzzi, Luca and Marinari, Enzo}, issn = {17425468}, journal = { Journal of Statistical Mechanics: Theory and Experiment}, number = {9}, publisher = {IOPscience}, title = {{Phase transitions in integer linear problems}}, doi = {10.1088/1742-5468/aa85c3}, volume = {2017}, year = {2017}, } @article{824, abstract = {In shear flows at transitional Reynolds numbers, localized patches of turbulence, known as puffs, coexist with the laminar flow. Recently, Avila et al. (Phys. Rev. Lett., vol. 110, 2013, 224502) discovered two spatially localized relative periodic solutions for pipe flow, which appeared in a saddle-node bifurcation at low Reynolds number. Combining slicing methods for continuous symmetry reduction with Poincaré sections for the first time in a shear flow setting, we compute and visualize the unstable manifold of the lower-branch solution and show that it extends towards the neighbourhood of the upper-branch solution. Surprisingly, this connection even persists far above the bifurcation point and appears to mediate the first stage of the puff generation: amplification of streamwise localized fluctuations. When the state-space trajectories on the unstable manifold reach the vicinity of the upper branch, corresponding fluctuations expand in space and eventually take the usual shape of a puff.}, author = {Budanur, Nazmi B and Hof, Björn}, issn = {00221120}, journal = {Journal of Fluid Mechanics}, publisher = {Cambridge University Press}, title = {{Heteroclinic path to spatially localized chaos in pipe flow}}, doi = {10.1017/jfm.2017.516}, volume = {827}, year = {2017}, } @article{825, abstract = {What data is needed about data? Describing the process to answer this question for the institutional data repository IST DataRep.}, author = {Petritsch, Barbara}, issn = {10222588}, journal = {Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare}, number = {2}, pages = {200 -- 207}, publisher = {VÖB}, title = {{Metadata for research data in practice}}, doi = {10.31263/voebm.v70i2.1678}, volume = {70}, year = {2017}, } @inproceedings{833, abstract = {We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first streaming algorithm for Euler characteristic curves. The usage of streaming removes the necessity to store the entire image in RAM. Experiments show that our implementation handles terabyte scale images on commodity hardware. Due to lock-free parallelism, it scales well with the number of processor cores. Additionally, we put the concept of the Euler characteristic curve in the wider context of computational topology. In particular, we explain the connection with persistence diagrams.}, author = {Heiss, Teresa and Wagner, Hubert}, editor = {Felsberg, Michael and Heyden, Anders and Krüger, Norbert}, issn = {03029743}, location = {Ystad, Sweden}, pages = {397 -- 409}, publisher = {Springer}, title = {{Streaming algorithm for Euler characteristic curves of multidimensional images}}, doi = {10.1007/978-3-319-64689-3_32}, volume = {10424}, year = {2017}, } @article{834, abstract = {Thermal and many-body localized phases are separated by a dynamical phase transition of a new kind. We analyze the distribution of off-diagonal matrix elements of local operators across this transition in two different models of disordered spin chains. We show that the behavior of matrix elements can be used to characterize the breakdown of thermalization and to extract the many-body Thouless energy. We find that upon increasing the disorder strength the system enters a critical region around the many-body localization transition. The properties of the system in this region are: (i) the Thouless energy becomes smaller than the level spacing, (ii) the matrix elements show critical dependence on the energy difference, and (iii) the matrix elements, viewed as amplitudes of a fictitious wave function, exhibit strong multifractality. This critical region decreases with the system size, which we interpret as evidence for a diverging correlation length at the many-body localization transition. Our findings show that the correlation length becomes larger than the accessible system sizes in a broad range of disorder strength values and shed light on the critical behavior near the many-body localization transition.}, author = {Serbyn, Maksym and Zlatko, Papic and Abanin, Dmitry}, issn = {24699950}, journal = {Physical Review B - Condensed Matter and Materials Physics}, number = {10}, publisher = {American Physical Society}, title = {{Thouless energy and multifractality across the many-body localization transition}}, doi = {10.1103/PhysRevB.96.104201}, volume = {96}, year = {2017}, } @inproceedings{836, abstract = {Recent research has examined how to study the topological features of a continuous self-map by means of the persistence of the eigenspaces, for given eigenvalues, of the endomorphism induced in homology over a field. This raised the question of how to select dynamically significant eigenvalues. The present paper aims to answer this question, giving an algorithm that computes the persistence of eigenspaces for every eigenvalue simultaneously, also expressing said eigenspaces as direct sums of “finite” and “singular” subspaces.}, author = {Ethier, Marc and Jablonski, Grzegorz and Mrozek, Marian}, booktitle = {Special Sessions in Applications of Computer Algebra}, isbn = {978-331956930-7}, location = {Kalamata, Greece}, pages = {119 -- 136}, publisher = {Springer}, title = {{Finding eigenvalues of self-maps with the Kronecker canonical form}}, doi = {10.1007/978-3-319-56932-1_8}, volume = {198}, year = {2017}, }