@article{11739, abstract = {We consider finite-volume approximations of Fokker--Planck equations on bounded convex domains in $\mathbb{R}^d$ and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker--Planck equation via the method of evolutionary $\Gamma$-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalizing the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality.}, author = {Forkert, Dominik L and Maas, Jan and Portinale, Lorenzo}, issn = {1095-7154}, journal = {SIAM Journal on Mathematical Analysis}, keywords = {Fokker--Planck equation, gradient flow, evolutionary $\Gamma$-convergence}, number = {4}, pages = {4297--4333}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Evolutionary $\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions}}, doi = {10.1137/21M1410968}, volume = {54}, year = {2022}, } @article{11740, abstract = {We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each k, each set of k+1 vertices forms an edge with some probability pk independently. As a special case, this contains an extensively studied model of a (uniform) random simplicial complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34 (2009), no. 3, pp. 408–417]. We consider a higher-dimensional notion of connectedness on this new model according to the vanishing of cohomology groups over an arbitrary abelian group R. We prove that this notion of connectedness displays a phase transition and determine the threshold. We also prove a hitting time result for a natural process interpretation, in which simplices and their downward-closure are added one by one. In addition, we determine the asymptotic behaviour of cohomology groups inside the critical window around the time of the phase transition.}, author = {Cooley, Oliver and Del Giudice, Nicola and Kang, Mihyun and Sprüssel, Philipp}, issn = {1077-8926}, journal = {Electronic Journal of Combinatorics}, number = {3}, publisher = {Electronic Journal of Combinatorics}, title = {{Phase transition in cohomology groups of non-uniform random simplicial complexes}}, doi = {10.37236/10607}, volume = {29}, year = {2022}, } @phdthesis{11777, abstract = {In this dissertation we study coboundary expansion of simplicial complex with a view of giving geometric applications. Our main novel tool is an equivariant version of Gromov's celebrated Topological Overlap Theorem. The equivariant topological overlap theorem leads to various geometric applications including a quantitative non-embeddability result for sufficiently thick buildings (which partially resolves a conjecture of Tancer and Vorwerk) and an improved lower bound on the pair-crossing number of (bounded degree) expander graphs. Additionally, we will give new proofs for several known lower bounds for geometric problems such as the number of Tverberg partitions or the crossing number of complete bipartite graphs. For the aforementioned applications one is naturally lead to study expansion properties of joins of simplicial complexes. In the presence of a special certificate for expansion (as it is the case, e.g., for spherical buildings), the join of two expanders is an expander. On the flip-side, we report quite some evidence that coboundary expansion exhibits very non-product-like behaviour under taking joins. For instance, we exhibit infinite families of graphs $(G_n)_{n\in \mathbb{N}}$ and $(H_n)_{n\in\mathbb{N}}$ whose join $G_n*H_n$ has expansion of lower order than the product of the expansion constant of the graphs. Moreover, we show an upper bound of $(d+1)/2^d$ on the normalized coboundary expansion constants for the complete multipartite complex $[n]^{*(d+1)}$ (under a mild divisibility condition on $n$). Via the probabilistic method the latter result extends to an upper bound of $(d+1)/2^d+\varepsilon$ on the coboundary expansion constant of the spherical building associated with $\mathrm{PGL}_{d+2}(\mathbb{F}_q)$ for any $\varepsilon>0$ and sufficiently large $q=q(\varepsilon)$. This disproves a conjecture of Lubotzky, Meshulam and Mozes -- in a rather strong sense. By improving on existing lower bounds we make further progress towards closing the gap between the known lower and upper bounds on the coboundary expansion constants of $[n]^{*(d+1)}$. The best improvements we achieve using computer-aided proofs and flag algebras. The exact value even for the complete $3$-partite $2$-dimensional complex $[n]^{*3}$ remains unknown but we are happy to conjecture a precise value for every $n$. %Moreover, we show that a previously shown lower bound on the expansion constant of the spherical building associated with $\mathrm{PGL}_{2}(\mathbb{F}_q)$ is not tight. In a loosely structured, last chapter of this thesis we collect further smaller observations related to expansion. We point out a link between discrete Morse theory and a technique for showing coboundary expansion, elaborate a bit on the hardness of computing coboundary expansion constants, propose a new criterion for coboundary expansion (in a very dense setting) and give one way of making the folklore result that expansion of links is a necessary condition for a simplicial complex to be an expander precise.}, author = {Wild, Pascal}, isbn = {978-3-99078-021-3}, issn = {2663-337X}, pages = {170}, publisher = {Institute of Science and Technology Austria}, title = {{High-dimensional expansion and crossing numbers of simplicial complexes}}, doi = {10.15479/at:ista:11777}, year = {2022}, } @article{11783, abstract = {We consider a gas of N bosons with interactions in the mean-field scaling regime. We review the proof of an asymptotic expansion of its low-energy spectrum, eigenstates, and dynamics, which provides corrections to Bogoliubov theory to all orders in 1/ N. This is based on joint works with Petrat, Pickl, Seiringer, and Soffer. In addition, we derive a full asymptotic expansion of the ground state one-body reduced density matrix.}, author = {Bossmann, Lea}, issn = {1089-7658}, journal = {Journal of Mathematical Physics}, keywords = {Mathematical Physics, Statistical and Nonlinear Physics}, number = {6}, publisher = {AIP Publishing}, title = {{Low-energy spectrum and dynamics of the weakly interacting Bose gas}}, doi = {10.1063/5.0089983}, volume = {63}, year = {2022}, } @inproceedings{11808, abstract = {In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.}, author = {Hanauer, Kathrin and Henzinger, Monika H and Schulz, Christian}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks}, isbn = {9783959772242}, issn = {1868-8969}, location = {Virtual}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Recent advances in fully dynamic graph algorithms}}, doi = {10.4230/LIPIcs.SAND.2022.1}, volume = {221}, year = {2022}, } @inproceedings{11812, abstract = {This paper presents a comprehensive study of algorithms for maintaining the number of all connected four-vertex subgraphs in a dynamic graph. Specifically, our algorithms maintain the number of paths of length three in deterministic amortized O(m^{1/2}) update time, and any other connected four-vertex subgraph which is not a clique in deterministic amortized update time O(m^{2/3}). Queries can be answered in constant time. We also study the query times for subgraphs containing an arbitrary edge that is supplied only with the query as well as the case where only subgraphs containing a vertex s that is fixed beforehand are considered. For length-3 paths, paws, 4-cycles, and diamonds our bounds match or are not far from (conditional) lower bounds: Based on the OMv conjecture we show that any dynamic algorithm that detects the existence of paws, diamonds, or 4-cycles or that counts length-3 paths takes update time Ω(m^{1/2-δ}). Additionally, for 4-cliques and all connected induced subgraphs, we show a lower bound of Ω(m^{1-δ}) for any small constant δ > 0 for the amortized update time, assuming the static combinatorial 4-clique conjecture holds. This shows that the O(m) algorithm by Eppstein et al. [David Eppstein et al., 2012] for these subgraphs cannot be improved by a polynomial factor.}, author = {Hanauer, Kathrin and Henzinger, Monika H and Hua, Qi Cheng}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks}, isbn = {9783959772242}, issn = {1868-8969}, location = {Virtual}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Fully dynamic four-vertex subgraph counting}}, doi = {10.4230/LIPIcs.SAND.2022.18}, volume = {221}, year = {2022}, } @article{11841, abstract = {Primary nucleation is the fundamental event that initiates the conversion of proteins from their normal physiological forms into pathological amyloid aggregates associated with the onset and development of disorders including systemic amyloidosis, as well as the neurodegenerative conditions Alzheimer’s and Parkinson’s diseases. It has become apparent that the presence of surfaces can dramatically modulate nucleation. However, the underlying physicochemical parameters governing this process have been challenging to elucidate, with interfaces in some cases having been found to accelerate aggregation, while in others they can inhibit the kinetics of this process. Here we show through kinetic analysis that for three different fibril-forming proteins, interfaces affect the aggregation reaction mainly through modulating the primary nucleation step. Moreover, we show through direct measurements of the Gibbs free energy of adsorption, combined with theory and coarse-grained computer simulations, that overall nucleation rates are suppressed at high and at low surface interaction strengths but significantly enhanced at intermediate strengths, and we verify these regimes experimentally. Taken together, these results provide a quantitative description of the fundamental process which triggers amyloid formation and shed light on the key factors that control this process.}, author = {Toprakcioglu, Zenon and Kamada, Ayaka and Michaels, Thomas C.T. and Xie, Mengqi and Krausser, Johannes and Wei, Jiapeng and Šarić, Anđela and Vendruscolo, Michele and Knowles, Tuomas P.J.}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, number = {31}, publisher = {National Academy of Sciences}, title = {{Adsorption free energy predicts amyloid protein nucleation rates}}, doi = {10.1073/pnas.2109718119}, volume = {119}, year = {2022}, } @article{11842, abstract = {We consider the flow of two viscous and incompressible fluids within a bounded domain modeled by means of a two-phase Navier–Stokes system. The two fluids are assumed to be immiscible, meaning that they are separated by an interface. With respect to the motion of the interface, we consider pure transport by the fluid flow. Along the boundary of the domain, a complete slip boundary condition for the fluid velocities and a constant ninety degree contact angle condition for the interface are assumed. In the present work, we devise for the resulting evolution problem a suitable weak solution concept based on the framework of varifolds and establish as the main result a weak-strong uniqueness principle in 2D. The proof is based on a relative entropy argument and requires a non-trivial further development of ideas from the recent work of Fischer and the first author (Arch. Ration. Mech. Anal. 236, 2020) to incorporate the contact angle condition. To focus on the effects of the necessarily singular geometry of the evolving fluid domains, we work for simplicity in the regime of same viscosities for the two fluids.}, author = {Hensel, Sebastian and Marveggio, Alice}, issn = {1422-6952}, journal = {Journal of Mathematical Fluid Mechanics}, number = {3}, publisher = {Springer Nature}, title = {{Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities}}, doi = {10.1007/s00021-022-00722-2}, volume = {24}, year = {2022}, } @inproceedings{11844, abstract = {In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this model is stable leader election, in which all nodes start in an identical state and the aim is to reach a configuration in which (1) exactly one node is elected as leader and (2) this node remains as the unique leader no matter what sequence of interactions follows. On cliques, the complexity of this problem has recently been settled: time-optimal protocols stabilize in Θ(n log n) expected steps using Θ(log log n) states, whereas protocols that use O(1) states require Θ(n2) expected steps. In this work, we investigate the complexity of stable leader election on general graphs. We provide the first non-trivial time lower bounds for leader election on general graphs, showing that, when moving beyond cliques, the complexity landscape of leader election becomes very diverse: the time required to elect a leader can range from O(1) to Θ(n3) expected steps. On the upper bound side, we first observe that there exists a protocol that is time-optimal on many graph families, but uses polynomially-many states. In contrast, we give a near-time-optimal protocol that uses only O(log2n) states that is at most a factor log n slower. Finally, we show that the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state protocol. Moreover, among constant-state protocols, this protocol has near-optimal average case complexity on dense random graphs.}, author = {Alistarh, Dan-Adrian and Rybicki, Joel and Voitovych, Sasha}, booktitle = {Proceedings of the Annual ACM Symposium on Principles of Distributed Computing}, isbn = {9781450392624}, location = {Salerno, Italy}, pages = {246--256}, publisher = {Association for Computing Machinery}, title = {{Near-optimal leader election in population protocols on graphs}}, doi = {10.1145/3519270.3538435}, year = {2022}, } @article{11858, abstract = {This paper is a continuation of Part I of this project, where we developed a new local well-posedness theory for nonlinear stochastic PDEs with Gaussian noise. In the current Part II we consider blow-up criteria and regularization phenomena. As in Part I we can allow nonlinearities with polynomial growth and rough initial values from critical spaces. In the first main result we obtain several new blow-up criteria for quasi- and semilinear stochastic evolution equations. In particular, for semilinear equations we obtain a Serrin type blow-up criterium, which extends a recent result of Prüss–Simonett–Wilke (J Differ Equ 264(3):2028–2074, 2018) to the stochastic setting. Blow-up criteria can be used to prove global well-posedness for SPDEs. As in Part I, maximal regularity techniques and weights in time play a central role in the proofs. Our second contribution is a new method to bootstrap Sobolev and Hölder regularity in time and space, which does not require smoothness of the initial data. The blow-up criteria are at the basis of these new methods. Moreover, in applications the bootstrap results can be combined with our blow-up criteria, to obtain efficient ways to prove global existence. This gives new results even in classical 𝐿2-settings, which we illustrate for a concrete SPDE. In future works in preparation we apply the results of the current paper to obtain global well-posedness results and regularity for several concrete SPDEs. These include stochastic Navier–Stokes equations, reaction– diffusion equations and the Allen–Cahn equation. Our setting allows to put these SPDEs into a more flexible framework, where less restrictions on the nonlinearities are needed, and we are able to treat rough initial values from critical spaces. Moreover, we will obtain higher-order regularity results.}, author = {Agresti, Antonio and Veraar, Mark}, issn = {1424-3202}, journal = {Journal of Evolution Equations}, keywords = {Mathematics (miscellaneous)}, number = {2}, publisher = {Springer Nature}, title = {{Nonlinear parabolic stochastic evolution equations in critical spaces part II}}, doi = {10.1007/s00028-022-00786-7}, volume = {22}, year = {2022}, } @article{11916, abstract = {A domain is called Kac regular for a quadratic form on L2 if every functions vanishing almost everywhere outside the domain can be approximated in form norm by functions with compact support in the domain. It is shown that this notion is stable under domination of quadratic forms. As applications measure perturbations of quasi-regular Dirichlet forms, Cheeger energies on metric measure spaces and Schrödinger operators on manifolds are studied. Along the way a characterization of the Sobolev space with Dirichlet boundary conditions on domains in infinitesimally Riemannian metric measure spaces is obtained.}, author = {Wirth, Melchior}, issn = {2538-225X}, journal = {Advances in Operator Theory}, keywords = {Algebra and Number Theory, Analysis}, number = {3}, publisher = {Springer Nature}, title = {{Kac regularity and domination of quadratic forms}}, doi = {10.1007/s43036-022-00199-w}, volume = {7}, year = {2022}, } @article{11917, abstract = {We study the many-body dynamics of an initially factorized bosonic wave function in the mean-field regime. We prove large deviation estimates for the fluctuations around the condensate. We derive an upper bound extending a recent result to more general interactions. Furthermore, we derive a new lower bound which agrees with the upper bound in leading order.}, author = {Rademacher, Simone Anna Elvira and Seiringer, Robert}, issn = {1572-9613}, journal = {Journal of Statistical Physics}, keywords = {Mathematical Physics, Statistical and Nonlinear Physics}, publisher = {Springer Nature}, title = {{Large deviation estimates for weakly interacting bosons}}, doi = {10.1007/s10955-022-02940-4}, volume = {188}, year = {2022}, } @inproceedings{11918, abstract = {Statistics of small subgraph counts such as triangles, four-cycles, and s-t paths of short lengths reveal important structural properties of the underlying graph. These problems have been widely studied in social network analysis. In most relevant applications, the graphs are not only massive but also change dynamically over time. Most of these problems become hard in the dynamic setting when considering the worst case. In this paper, we ask whether the question of small subgraph counting over dynamic graphs is hard also in the average case. We consider the simplest possible average case model where the updates follow an Erdős-Rényi graph: each update selects a pair of vertices (u, v) uniformly at random and flips the existence of the edge (u, v). We develop new lower bounds and matching algorithms in this model for counting four-cycles, counting triangles through a specified point s, or a random queried point, and st paths of length 3, 4 and 5. Our results indicate while computing st paths of length 3, and 4 are easy in the average case with O(1) update time (note that they are hard in the worst case), it becomes hard when considering st paths of length 5. We introduce new techniques which allow us to get average-case hardness for these graph problems from the worst-case hardness of the Online Matrix vector problem (OMv). Our techniques rely on recent advances in fine-grained average-case complexity. Our techniques advance this literature, giving the ability to prove new lower bounds on average-case dynamic algorithms.}, author = {Henzinger, Monika H and Lincoln, Andrea and Saha, Barna}, booktitle = {33rd Annual ACM-SIAM Symposium on Discrete Algorithms}, location = {Alexandria, VA, United States}, pages = {459--498}, publisher = {Society for Industrial and Applied Mathematics}, title = {{The complexity of average-case dynamic subgraph counting}}, doi = {10.1137/1.9781611977073.23}, year = {2022}, } @inproceedings{11930, abstract = {We present a practically efficient algorithm for maintaining a global minimum cut in large dynamic graphs under both edge insertions and deletions. While there has been theoretical work on this problem, our algorithm is the first implementation of a fully-dynamic algorithm. The algorithm uses the theoretical foundation and combines it with efficient and finely-tuned implementations to give an algorithm that can maintain the global minimum cut of a graph with rapid update times. We show that our algorithm gives up to multiple orders of magnitude speedup compared to static approaches both on edge insertions and deletions.}, author = {Henzinger, Monika H and Noe, Alexander and Schulz, Christian}, booktitle = {2022 Proceedings of the Symposium on Algorithm Engineering and Experiments}, location = {Alexandria, VA, United States}, pages = {13--26}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Practical fully dynamic minimum cut algorithms}}, doi = {10.1137/1.9781611977042.2}, year = {2022}, } @article{11938, abstract = {A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge.}, author = {Aichholzer, Oswin and Arroyo Guevara, Alan M and Masárová, Zuzana and Parada, Irene and Perz, Daniel and Pilz, Alexander and Tkadlec, Josef and Vogtenhuber, Birgit}, issn = {1526-1719}, journal = {Journal of Graph Algorithms and Applications}, number = {2}, pages = {225--240}, publisher = {Brown University}, title = {{On compatible matchings}}, doi = {10.7155/jgaa.00591}, volume = {26}, year = {2022}, } @phdthesis{11945, abstract = {G protein-coupled receptors (GPCRs) respond to specific ligands and regulate multiple processes ranging from cell growth and immune responses to neuronal signal transmission. However, ligands for many GPCRs remain unknown, suffer from off-target effects or have poor bioavailability. Additional challenges exist to dissect cell-type specific responses when the same GPCR is expressed on several cell types within the body. Here, we overcome these limitations by engineering DREADD-based GPCR chimeras that selectively bind their agonist clozapine-N-oxide (CNO) and mimic a GPCR-of-interest in a desired cell type. We validated our approach with β2-adrenergic receptor (β2AR/ADRB2) and show that our chimeric DREADD-β2AR triggers comparable responses on second messenger and kinase activity, post-translational modifications, and protein-protein interactions. Since β2AR is also enriched in microglia, which can drive inflammation in the central nervous system, we expressed chimeric DREADD-β2AR in primary microglia and successfully recapitulate β2AR-mediated filopodia formation through CNO stimulation. To dissect the role of selected GPCRs during microglial inflammation, we additionally generated DREADD-based chimeras for microglia-enriched GPR65 and GPR109A/HCAR2. In a microglia cell line, DREADD-β2AR and DREADD-GPR65 both modulated the inflammatory response with a similar profile as endogenously expressed β2AR, while DREADD-GPR109A showed no impact. Our DREADD-based approach provides the means to obtain mechanistic and functional insights into GPCR signaling on a cell-type specific level.}, author = {Schulz, Rouven}, issn = {2663-337X}, pages = {133}, publisher = {Institute of Science and Technology Austria}, title = {{Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function}}, doi = {10.15479/at:ista:11945}, year = {2022}, } @article{11951, abstract = {The mammalian hippocampal formation (HF) plays a key role in several higher brain functions, such as spatial coding, learning and memory. Its simple circuit architecture is often viewed as a trisynaptic loop, processing input originating from the superficial layers of the entorhinal cortex (EC) and sending it back to its deeper layers. Here, we show that excitatory neurons in layer 6b of the mouse EC project to all sub-regions comprising the HF and receive input from the CA1, thalamus and claustrum. Furthermore, their output is characterized by unique slow-decaying excitatory postsynaptic currents capable of driving plateau-like potentials in their postsynaptic targets. Optogenetic inhibition of the EC-6b pathway affects spatial coding in CA1 pyramidal neurons, while cell ablation impairs not only acquisition of new spatial memories, but also degradation of previously acquired ones. Our results provide evidence of a functional role for cortical layer 6b neurons in the adult brain.}, author = {Ben Simon, Yoav and Käfer, Karola and Velicky, Philipp and Csicsvari, Jozsef L and Danzl, Johann G and Jonas, Peter M}, issn = {2041-1723}, journal = {Nature Communications}, keywords = {General Physics and Astronomy, General Biochemistry, Genetics and Molecular Biology, General Chemistry, Multidisciplinary}, publisher = {Springer Nature}, title = {{A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory}}, doi = {10.1038/s41467-022-32559-8}, volume = {13}, year = {2022}, } @article{11955, abstract = {Covalent organic frameworks (COFs) are structurally tuneable, porous and crystalline polymers constructed through the covalent attachment of small organic building blocks as elementary units. Using the myriad of such building blocks, a broad spectrum of functionalities has been applied for COF syntheses for broad applications, including heterogeneous catalysis. Herein, we report the synthesis of a new family of porous and crystalline COFs using a novel acridine linker and benzene-1,3,5-tricarbaldehyde derivatives bearing a variable number of hydroxy groups. With the broad absorption in the visible light region, the COFs were applied as photocatalysts in metallaphotocatalytic C−N cross-coupling. The fully β-ketoenamine linked COF showed the highest activity, due to the increased charge separation upon irradiation. The COF showed good to excellent yields for several aryl bromides, good recyclability and even catalyzed the organic transformation in presence of green light as energy source.}, author = {Traxler, Michael and Gisbertz, Sebastian and Pachfule, Pradip and Schmidt, Johannes and Roeser, Jérôme and Reischauer, Susanne and Rabeah, Jabor and Pieber, Bartholomäus and Thomas, Arne}, issn = {1521-3773}, journal = {Angewandte Chemie International Edition}, number = {21}, publisher = {Wiley}, title = {{Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling}}, doi = {10.1002/anie.202117738}, volume = {61}, year = {2022}, } @article{11991, abstract = {The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP, has started to gain prominence. In this survey, we explain the importance of promise CSP and highlight many new very interesting features that the study of promise CSP has brought to light. The complexity classification quest for the promise CSP is wide open, and we argue that, despite the promise CSP being more general, this quest is rather more accessible to a wide range of researchers than the dichotomy-led study of the CSP has been.}, author = {Krokhin, Andrei and Opršal, Jakub}, issn = {2372-3491}, journal = {ACM SIGLOG News}, number = {3}, pages = {30--59}, publisher = {Association for Computing Machinery}, title = {{An invitation to the promise constraint satisfaction problem}}, doi = {10.1145/3559736.3559740}, volume = {9}, year = {2022}, } @article{11993, abstract = {Moulding refers to a set of manufacturing techniques in which a mould, usually a cavity or a solid frame, is used to shape a liquid or pliable material into an object of the desired shape. The popularity of moulding comes from its effectiveness, scalability and versatility in terms of employed materials. Its relevance as a fabrication process is demonstrated by the extensive literature covering different aspects related to mould design, from material flow simulation to the automation of mould geometry design. In this state-of-the-art report, we provide an extensive review of the automatic methods for the design of moulds, focusing on contributions from a geometric perspective. We classify existing mould design methods based on their computational approach and the nature of their target moulding process. We summarize the relationships between computational approaches and moulding techniques, highlighting their strengths and limitations. Finally, we discuss potential future research directions.}, author = {Alderighi, Thomas and Malomo, Luigi and Auzinger, Thomas and Bickel, Bernd and Cignoni, Paulo and Pietroni, Nico}, issn = {1467-8659}, journal = {Computer Graphics Forum}, keywords = {Computer Graphics and Computer-Aided Design}, number = {6}, pages = {435--452}, publisher = {Wiley}, title = {{State of the art in computational mould design}}, doi = {10.1111/cgf.14581}, volume = {41}, year = {2022}, }