@article{12273,
  abstract     = {We study communication in the presence of a jamming adversary where quadratic power constraints are imposed on the transmitter and the jammer. The jamming signal is allowed to be a function of the codebook, and a noncausal but noisy observation of the transmitted codeword. For a certain range of the noise-to-signal ratios (NSRs) of the transmitter and the jammer, we are able to characterize the capacity of this channel under deterministic encoding or stochastic encoding, i.e., with no common randomness between the encoder/decoder pair. For the remaining NSR regimes, we determine the capacity under the assumption of a small amount of common randomness (at most 2log(n) bits in one sub-regime, and at most Ω(n) bits in the other sub-regime) available to the encoder-decoder pair. Our proof techniques involve a novel myopic list-decoding result for achievability, and a Plotkin-type push attack for the converse in a subregion of the NSRs, both of which may be of independent interest. We also give bounds on the strong secrecy capacity of this channel assuming that the jammer is simultaneously eavesdropping.},
  author       = {Zhang, Yihan and Vatedka, Shashank and Jaggi, Sidharth and Sarwate, Anand D.},
  issn         = {1557-9654},
  journal      = {IEEE Transactions on Information Theory},
  number       = {8},
  pages        = {4901--4948},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Quadratically constrained myopic adversarial channels}},
  doi          = {10.1109/tit.2022.3167554},
  volume       = {68},
  year         = {2022},
}

@article{12274,
  abstract     = {The morphology and functionality of the epithelial lining differ along the intestinal tract, but tissue renewal at all sites is driven by stem cells at the base of crypts1,2,3. Whether stem cell numbers and behaviour vary at different sites is unknown. Here we show using intravital microscopy that, despite similarities in the number and distribution of proliferative cells with an Lgr5 signature in mice, small intestinal crypts contain twice as many effective stem cells as large intestinal crypts. We find that, although passively displaced by a conveyor-belt-like upward movement, small intestinal cells positioned away from the crypt base can function as long-term effective stem cells owing to Wnt-dependent retrograde cellular movement. By contrast, the near absence of retrograde movement in the large intestine restricts cell repositioning, leading to a reduction in effective stem cell number. Moreover, after suppression of the retrograde movement in the small intestine, the number of effective stem cells is reduced, and the rate of monoclonal conversion of crypts is accelerated. Together, these results show that the number of effective stem cells is determined by active retrograde movement, revealing a new channel of stem cell regulation that can be experimentally and pharmacologically manipulated.},
  author       = {Azkanaz, Maria and Corominas-Murtra, Bernat and Ellenbroek, Saskia I. J. and Bruens, Lotte and Webb, Anna T. and Laskaris, Dimitrios and Oost, Koen C. and Lafirenze, Simona J. A. and Annusver, Karl and Messal, Hendrik A. and Iqbal, Sharif and Flanagan, Dustin J. and Huels, David J. and Rojas-Rodríguez, Felipe and Vizoso, Miguel and Kasper, Maria and Sansom, Owen J. and Snippert, Hugo J. and Liberali, Prisca and Simons, Benjamin D. and Katajisto, Pekka and Hannezo, Edouard B and van Rheenen, Jacco},
  issn         = {1476-4687},
  journal      = {Nature},
  keywords     = {Multidisciplinary},
  number       = {7919},
  pages        = {548--554},
  publisher    = {Springer Nature},
  title        = {{Retrograde movements determine effective stem cell numbers in the intestine}},
  doi          = {10.1038/s41586-022-04962-0},
  volume       = {607},
  year         = {2022},
}

@article{12276,
  abstract     = {Ongoing development of quantum simulators allows for a progressively finer degree of control of quantum many-body systems. This motivates the development of efficient approaches to facilitate the control of such systems and enable the preparation of nontrivial quantum states. Here we formulate an approach to control quantum systems based on matrix product states (MPSs). We compare counterdiabatic and leakage minimization approaches to the so-called local steering problem that consists in finding the best value of the control parameters for generating a unitary evolution of the specific MPS in a given direction. In order to benchmark the different approaches, we apply them to the generalization of the PXP model known to exhibit coherent quantum dynamics due to quantum many-body scars. We find that the leakage-based approach generally outperforms the counterdiabatic framework and use it to construct a Floquet model with quantum scars. We perform the first steps towards global trajectory optimization and demonstrate entanglement steering capabilities in the generalized PXP model. Finally, we apply our leakage minimization approach to construct quantum scars in the periodically driven nonintegrable Ising model.},
  author       = {Ljubotina, Marko and Roos, Barbara and Abanin, Dmitry A. and Serbyn, Maksym},
  issn         = {2691-3399},
  journal      = {PRX Quantum},
  keywords     = {General Medicine},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Optimal steering of matrix product states and quantum many-body scars}},
  doi          = {10.1103/prxquantum.3.030343},
  volume       = {3},
  year         = {2022},
}

@article{12277,
  abstract     = {Cell migration in confining physiological environments relies on the concerted dynamics of several cellular components, including protrusions, adhesions with the environment, and the cell nucleus. However, it remains poorly understood how the dynamic interplay of these components and the cell polarity determine the emergent migration behavior at the cellular scale. Here, we combine data-driven inference with a mechanistic bottom-up approach to develop a model for protrusion and polarity dynamics in confined cell migration, revealing how the cellular dynamics adapt to confining geometries. Specifically, we use experimental data of joint protrusion-nucleus migration trajectories of cells on confining micropatterns to systematically determine a mechanistic model linking the stochastic dynamics of cell polarity, protrusions, and nucleus. This model indicates that the cellular dynamics adapt to confining constrictions through a switch in the polarity dynamics from a negative to a positive self-reinforcing feedback loop. Our model further reveals how this feedback loop leads to stereotypical cycles of protrusion-nucleus dynamics that drive the migration of the cell through constrictions. These cycles are disrupted upon perturbation of cytoskeletal components, indicating that the positive feedback is controlled by cellular migration mechanisms. Our data-driven theoretical approach therefore identifies polarity feedback adaptation as a key mechanism in confined cell migration.},
  author       = {Brückner, David and Schmitt, Matthew and Fink, Alexandra and Ladurner, Georg and Flommersfeld, Johannes and Arlt, Nicolas and Hannezo, Edouard B and Rädler, Joachim O. and Broedersz, Chase P.},
  issn         = {2160-3308},
  journal      = {Physical Review X},
  keywords     = {General Physics and Astronomy},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Geometry adaptation of protrusion and polarity dynamics in confined cell migration}},
  doi          = {10.1103/physrevx.12.031041},
  volume       = {12},
  year         = {2022},
}

@article{12278,
  abstract     = {Mercury telluride (HgTe) thin films with a critical thickness of 6.5 nm are predicted to possess a gapless Dirac-like band structure. We report a comprehensive study on gated and optically doped samples by magnetooptical spectroscopy in the THz range. The quasi-classical analysis of the cyclotron resonance allowed the mapping of the band dispersion of Dirac charge carriers in a broad range of electron and hole doping. A smooth transition through the charge neutrality point between Dirac holes and electrons was observed. An additional peak coming from a second type of holes with an almost density-independent mass of around 0.04m0 was detected in the hole-doping range and attributed to an asymmetric spin splitting of the Dirac cone. Spectroscopic evidence for disorder-induced band energy fluctuations could not be detected in present cyclotron resonance experiments.},
  author       = {Shuvaev, Alexey and Dziom, Uladzislau and Gospodarič, Jan and Novik, Elena G. and Dobretsova, Alena A. and Mikhailov, Nikolay N. and Kvon, Ze Don and Pimenov, Andrei},
  issn         = {2079-4991},
  journal      = {Nanomaterials},
  keywords     = {General Materials Science, General Chemical Engineering},
  number       = {14},
  publisher    = {MDPI},
  title        = {{Band structure near the Dirac Point in HgTe quantum wells with critical thickness}},
  doi          = {10.3390/nano12142492},
  volume       = {12},
  year         = {2022},
}

@article{12279,
  abstract     = {We report frictional drag reduction and a complete flow relaminarization of elastic turbulence (ET) at vanishing inertia in a viscoelastic channel flow past an obstacle. We show that the intensity of the observed elastic waves and wall-normal vorticity correlate well with the measured drag above the onset of ET. Moreover, we find that the elastic wave frequency grows with the Weissenberg number, and at sufficiently high frequency it causes a decay of the elastic waves, resulting in ET attenuation and drag reduction. Thus, this allows us to substantiate a physical mechanism, involving the interaction of elastic waves with wall-normal vorticity fluctuations, leading to the drag reduction and relaminarization phenomena at low Reynolds number.},
  author       = {Kumar, M. Vijay and Varshney, Atul and Li, Dongyang and Steinberg, Victor},
  issn         = {2469-990X},
  journal      = {Physical Review Fluids},
  keywords     = {Fluid Flow and Transfer Processes, Modeling and Simulation, Computational Mechanics},
  number       = {8},
  publisher    = {American Physical Society},
  title        = {{Relaminarization of elastic turbulence}},
  doi          = {10.1103/physrevfluids.7.l081301},
  volume       = {7},
  year         = {2022},
}

@article{12280,
  abstract     = {In repeated interactions, players can use strategies that respond to the outcome of previous rounds. Much of the existing literature on direct reciprocity assumes that all competing individuals use the same strategy space. Here, we study both learning and evolutionary dynamics of players that differ in the strategy space they explore. We focus on the infinitely repeated donation game and compare three natural strategy spaces: memory-1 strategies, which consider the last moves of both players, reactive strategies, which respond to the last move of the co-player, and unconditional strategies. These three strategy spaces differ in the memory capacity that is needed. We compute the long term average payoff that is achieved in a pairwise learning process. We find that smaller strategy spaces can dominate larger ones. For weak selection, unconditional players dominate both reactive and memory-1 players. For intermediate selection, reactive players dominate memory-1 players. Only for strong selection and low cost-to-benefit ratio, memory-1 players dominate the others. We observe that the supergame between strategy spaces can be a social dilemma: maximum payoff is achieved if both players explore a larger strategy space, but smaller strategy spaces dominate.},
  author       = {Schmid, Laura and Hilbe, Christian and Chatterjee, Krishnendu and Nowak, Martin},
  issn         = {1553-7358},
  journal      = {PLOS Computational Biology},
  keywords     = {Computational Theory and Mathematics, Cellular and Molecular Neuroscience, Genetics, Molecular Biology, Ecology, Modeling and Simulation, Ecology, Evolution, Behavior and Systematics},
  number       = {6},
  publisher    = {Public Library of Science},
  title        = {{Direct reciprocity between individuals that use different strategy spaces}},
  doi          = {10.1371/journal.pcbi.1010149},
  volume       = {18},
  year         = {2022},
}

@article{12281,
  abstract     = {We study the hydrodynamic and hydrostatic limits of the one-dimensional open symmetric inclusion process with slow boundary. Depending on the value of the parameter tuning the interaction rate of the bulk of the system with the boundary, we obtain a linear heat equation with either Dirichlet, Robin or Neumann boundary conditions as hydrodynamic equation. In our approach, we combine duality and first-second class particle techniques to reduce the scaling limit of the inclusion process to the limiting behavior of a single, non-interacting, particle.},
  author       = {Franceschini, Chiara and Gonçalves, Patrícia and Sau, Federico},
  issn         = {1350-7265},
  journal      = {Bernoulli},
  keywords     = {Statistics and Probability},
  number       = {2},
  pages        = {1340--1381},
  publisher    = {Bernoulli Society for Mathematical Statistics and Probability},
  title        = {{Symmetric inclusion process with slow boundary: Hydrodynamics and hydrostatics}},
  doi          = {10.3150/21-bej1390},
  volume       = {28},
  year         = {2022},
}

@article{12282,
  abstract     = {From a simple thought to a multicellular movement},
  author       = {Amberg, Nicole and Stouffer, Melissa A and Vercellino, Irene},
  issn         = {1477-9137},
  journal      = {Journal of Cell Science},
  number       = {8},
  publisher    = {The Company of Biologists},
  title        = {{Operation STEM fatale – how an equity, diversity and inclusion initiative has brought us to reflect on the current challenges in cell biology and science as a whole}},
  doi          = {10.1242/jcs.260017},
  volume       = {135},
  year         = {2022},
}

@article{12283,
  abstract     = {Neurons extend axons to form the complex circuitry of the mature brain. This depends on the coordinated response and continuous remodelling of the microtubule and F-actin networks in the axonal growth cone. Growth cone architecture remains poorly understood at nanoscales. We therefore investigated mouse hippocampal neuron growth cones using cryo-electron tomography to directly visualise their three-dimensional subcellular architecture with molecular detail. Our data showed that the hexagonal arrays of actin bundles that form filopodia penetrate and terminate deep within the growth cone interior. We directly observed the modulation of these and other growth cone actin bundles by alteration of individual F-actin helical structures. Microtubules with blunt, slightly flared or gently curved ends predominated in the growth cone, frequently contained lumenal particles and exhibited lattice defects. Investigation of the effect of absence of doublecortin, a neurodevelopmental cytoskeleton regulator, on growth cone cytoskeleton showed no major anomalies in overall growth cone organisation or in F-actin subpopulations. However, our data suggested that microtubules sustained more structural defects, highlighting the importance of microtubule integrity during growth cone migration.},
  author       = {Atherton, Joseph and Stouffer, Melissa A and Francis, Fiona and Moores, Carolyn A.},
  issn         = {1477-9137},
  journal      = {Journal of Cell Science},
  keywords     = {Cell Biology},
  number       = {7},
  publisher    = {The Company of Biologists},
  title        = {{Visualising the cytoskeletal machinery in neuronal growth cones using cryo-electron tomography}},
  doi          = {10.1242/jcs.259234},
  volume       = {135},
  year         = {2022},
}

@article{12286,
  abstract     = {Inspired by the study of loose cycles in hypergraphs, we define the loose core in hypergraphs as a structurewhich mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition at a certain critical threshold and determine this order, as well as the number of edges, asymptotically in the subcritical and supercritical regimes.&#x0D;
Our main tool is an algorithm called CoreConstruct, which enables us to analyse a peeling process for the loose core. By analysing this algorithm we determine the asymptotic degree distribution of vertices in the loose core and in particular how many vertices and edges the loose core contains. As a corollary we obtain an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$.},
  author       = {Cooley, Oliver and Kang, Mihyun and Zalla, Julian},
  issn         = {1077-8926},
  journal      = {The Electronic Journal of Combinatorics},
  keywords     = {Computational Theory and Mathematics, Geometry and Topology, Theoretical Computer Science, Applied Mathematics, Discrete Mathematics and Combinatorics},
  number       = {4},
  publisher    = {The Electronic Journal of Combinatorics},
  title        = {{Loose cores and cycles in random hypergraphs}},
  doi          = {10.37236/10794},
  volume       = {29},
  year         = {2022},
}

@article{12288,
  abstract     = {To understand the function of neuronal circuits, it is crucial to disentangle the connectivity patterns within the network. However, most tools currently used to explore connectivity have low throughput, low selectivity, or limited accessibility. Here, we report the development of an improved packaging system for the production of the highly neurotropic RVdGenvA-CVS-N2c rabies viral vectors, yielding titers orders of magnitude higher with no background contamination, at a fraction of the production time, while preserving the efficiency of transsynaptic labeling. Along with the production pipeline, we developed suites of ‘starter’ AAV and bicistronic RVdG-CVS-N2c vectors, enabling retrograde labeling from a wide range of neuronal populations, tailored for diverse experimental requirements. We demonstrate the power and flexibility of the new system by uncovering hidden local and distal inhibitory connections in the mouse hippocampal formation and by imaging the functional properties of a cortical microcircuit across weeks. Our novel production pipeline provides a convenient approach to generate new rabies vectors, while our toolkit flexibly and efficiently expands the current capacity to label, manipulate and image the neuronal activity of interconnected neuronal circuits in vitro and in vivo.},
  author       = {Sumser, Anton L and Jösch, Maximilian A and Jonas, Peter M and Ben Simon, Yoav},
  issn         = {2050-084X},
  journal      = {eLife},
  keywords     = {General Immunology and Microbiology, General Biochemistry, Genetics and Molecular Biology, General Medicine, General Neuroscience},
  publisher    = {eLife Sciences Publications},
  title        = {{Fast, high-throughput production of improved rabies viral vectors for specific, efficient and versatile transsynaptic retrograde labeling}},
  doi          = {10.7554/elife.79848},
  volume       = {11},
  year         = {2022},
}

@article{12290,
  abstract     = {We prove local laws, i.e. optimal concentration estimates for arbitrary products of resolvents of a Wigner random matrix with deterministic matrices in between. We find that the size of such products heavily depends on whether some of the deterministic matrices are traceless. Our estimates correctly account for this dependence and they hold optimally down to the smallest possible spectral scale.},
  author       = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J},
  issn         = {1083-6489},
  journal      = {Electronic Journal of Probability},
  keywords     = {Statistics, Probability and Uncertainty, Statistics and Probability},
  pages        = {1--38},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{Optimal multi-resolvent local laws for Wigner matrices}},
  doi          = {10.1214/22-ejp838},
  volume       = {27},
  year         = {2022},
}

@inproceedings{12298,
  abstract     = {Existing committee-based Byzantine state machine replication (SMR) protocols, typically deployed in production blockchains, face a clear trade-off: (1) they either achieve linear communication cost in the steady state, but sacrifice liveness during periods of asynchrony, or (2) they are robust (progress with probability one) but pay quadratic communication cost. We believe this trade-off is unwarranted since existing linear protocols still have asymptotic quadratic cost in the worst case. We design Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the steady state (linear and quadratic, respectively) and progress guarantee under asynchrony and DDoS attacks. We achieve this by replacing the view-synchronization of partially synchronous protocols with an asynchronous fallback mechanism at no extra asymptotic cost. Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon, which leverages a quadratic view-change mechanism to reduce the latency of the standard 3-chain HotStuff. We implement and experimentally evaluate all our systems to prove that breaking the robustness-efficiency trade-off is in the realm of practicality.},
  author       = {Gelashvili, Rati and Kokoris Kogias, Eleftherios and Sonnino, Alberto and Spiegelman, Alexander and Xiang, Zhuolun},
  booktitle    = {Financial Cryptography and Data Security},
  isbn         = {9783031182822},
  issn         = {1611-3349},
  location     = {Radisson Grenada Beach Resort, Grenada},
  pages        = {296--315},
  publisher    = {Springer Nature},
  title        = {{Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback}},
  doi          = {10.1007/978-3-031-18283-9_14},
  volume       = {13411},
  year         = {2022},
}

@inproceedings{12300,
  abstract     = {Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted third party and is a building block to decentralized protocols such as randomness beacons, threshold signatures, and general multiparty computation. Until recently, DKG protocols have assumed the synchronous model and thus are vulnerable when their underlying network assumptions do not hold. The recent advancements in asynchronous DKG protocols are insufficient as they either have poor efficiency or limited functionality, resulting in a lack of concrete implementations. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol. In a network of n nodes, our ADKG protocol can tolerate up to t<n/3 malicious nodes and have an expected O(κn3) communication cost, where κ is the security parameter. Our ADKG protocol produces a field element as the secret and is thus compatible with off-the-shelf threshold cryptosystems. We implement our ADKG protocol and evaluate it using a network of up to 128 nodes in geographically distributed AWS instances. Our evaluation shows that our protocol takes as low as 3 and 9.5 seconds to terminate for 32 and 64 nodes, respectively. Also, each node sends only 0.7 Megabytes and 2.9 Megabytes of data during the two experiments, respectively.},
  author       = {Das, Sourav and Yurek, Thomas and Xiang, Zhuolun and Miller, Andrew and Kokoris Kogias, Eleftherios and Ren, Ling},
  booktitle    = {2022 IEEE Symposium on Security and Privacy},
  issn         = {2375-1207},
  location     = {San Francisco, CA, United States},
  pages        = {2518--2534},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Practical asynchronous distributed key generation}},
  doi          = {10.1109/sp46214.2022.9833584},
  year         = {2022},
}

@inproceedings{12302,
  abstract     = {We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSPACE-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discarding candidates which are subsumed by others for the quasiorder. Discarded candidates are guaranteed to not compromise the completeness of the algorithm. The novelty of our work lies in the quasiorder used to discard candidates. We introduce FORQs (family of right quasiorders) that we obtain by adapting the notion of family of right congruences put forward by Maler and Staiger in 1993. We define a FORQ-based inclusion algorithm which we prove correct and instantiate it for a specific FORQ, called the structural FORQ, induced by the Büchi automaton to the right of the inclusion sign. The resulting implementation, called FORKLIFT, scales up better than the state-of-the-art on a variety of benchmarks including benchmarks from program verification and theorem proving for word combinatorics. Artifact: https://doi.org/10.5281/zenodo.6552870},
  author       = {Doveri, Kyveli and Ganty, Pierre and Mazzocchi, Nicolas Adrien},
  booktitle    = {Computer Aided Verification},
  isbn         = {9783031131875},
  issn         = {1611-3349},
  location     = {Haifa, Israel},
  pages        = {109--129},
  publisher    = {Springer Nature},
  title        = {{FORQ-based language inclusion formal testing}},
  doi          = {10.1007/978-3-031-13188-2_6},
  volume       = {13372},
  year         = {2022},
}

@inbook{12303,
  abstract     = {We construct for each choice of a quiver Q, a cohomology theory A, and a poset P a “loop Grassmannian” GP(Q,A). This generalizes loop Grassmannians of semisimple groups and the loop Grassmannians of based quadratic forms. The addition of a “dilation” torus D⊆G2m gives a quantization GPD(Q,A). This construction is motivated by the program of introducing an inner cohomology theory in algebraic geometry adequate for the Geometric Langlands program (Mirković, Some extensions of the notion of loop Grassmannians. Rad Hrvat. Akad. Znan. Umjet. Mat. Znan., the Mardešić issue. No. 532, 53–74, 2017) and on the construction of affine quantum groups from generalized cohomology theories (Yang and Zhao, Quiver varieties and elliptic quantum groups, preprint. arxiv1708.01418).},
  author       = {Mirković, Ivan and Yang, Yaping and Zhao, Gufang},
  booktitle    = {Representation Theory and Algebraic Geometry},
  editor       = {Baranovskky, Vladimir and Guay, Nicolas and Schedler, Travis},
  isbn         = {9783030820060},
  issn         = {2297-024X},
  pages        = {347--392},
  publisher    = {Springer Nature; Birkhäuser},
  title        = {{Loop Grassmannians of Quivers and Affine Quantum Groups}},
  doi          = {10.1007/978-3-030-82007-7_8},
  year         = {2022},
}

@article{12304,
  abstract     = {We establish sharp criteria for the instantaneous propagation of free boundaries in solutions to the thin-film equation. The criteria are formulated in terms of the initial distribution of mass (as opposed to previous almost-optimal results), reflecting the fact that mass is a locally conserved quantity for the thin-film equation. In the regime of weak slippage, our criteria are at the same time necessary and sufficient. The proof of our upper bounds on free boundary propagation is based on a strategy of “propagation of degeneracy” down to arbitrarily small spatial scales: We combine estimates on the local mass and estimates on energies to show that “degeneracy” on a certain space-time cylinder entails “degeneracy” on a spatially smaller space-time cylinder with the same time horizon. The derivation of our lower bounds on free boundary propagation is based on a combination of a monotone quantity and almost optimal estimates established previously by the second author with a new estimate connecting motion of mass to entropy production.},
  author       = {De Nitti, Nicola and Fischer, Julian L},
  issn         = {1532-4133},
  journal      = {Communications in Partial Differential Equations},
  keywords     = {Applied Mathematics, Analysis},
  number       = {7},
  pages        = {1394--1434},
  publisher    = {Taylor & Francis},
  title        = {{Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation}},
  doi          = {10.1080/03605302.2022.2056702},
  volume       = {47},
  year         = {2022},
}

@article{12305,
  abstract     = {This paper is concerned with the sharp interface limit for the Allen--Cahn equation with a nonlinear Robin boundary condition in a bounded smooth domain Ω⊂\R2. We assume that a diffuse interface already has developed and that it is in contact with the boundary ∂Ω. The boundary condition is designed in such a way that the limit problem is given by the mean curvature flow with constant α-contact angle. For α close to 90° we prove a local in time convergence result for well-prepared initial data for times when a smooth solution to the limit problem exists. Based on the latter we construct a suitable curvilinear coordinate system and carry out a rigorous asymptotic expansion for the Allen--Cahn equation with the nonlinear Robin boundary condition. Moreover, we show a spectral estimate for the corresponding linearized Allen--Cahn operator and with its aid we derive strong norm estimates for the difference of the exact and approximate solutions using a Gronwall-type argument.},
  author       = {Abels, Helmut and Moser, Maximilian},
  issn         = {1095-7154},
  journal      = {SIAM Journal on Mathematical Analysis},
  keywords     = {Applied Mathematics, Computational Mathematics, Analysis},
  number       = {1},
  pages        = {114--172},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°}},
  doi          = {10.1137/21m1424925},
  volume       = {54},
  year         = {2022},
}

@article{12307,
  abstract     = {Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences.},
  author       = {Shipman, Barbara A. and Stephenson, Elizabeth R},
  issn         = {1935-4053},
  journal      = {PRIMUS},
  keywords     = {Education, General Mathematics},
  number       = {5},
  pages        = {593--609},
  publisher    = {Taylor & Francis},
  title        = {{Tangible topology through the lens of limits}},
  doi          = {10.1080/10511970.2021.1872750},
  volume       = {32},
  year         = {2022},
}

