Find Academic Supervisors

Don BlasiusView profile

Professor

• Number theory
• arithmetic geometry
• automorphic forms

Don Blasius is a Professor of Mathematics at the University of California, Los Angeles (UCLA), serving as Managing Editor of the Pacific Journal of Mathematics and chair of the Mathematics-Economics Interdisciplinary Program (IDP). His research focuses on number theory, arithmetic geometry, and automorphic forms within the Department of Mathematics. His work centers on the deep connections between modular forms, elliptic curves, and fundamental conjectures in arithmetic geometry. Key investigations include generalizations of the Shimura-Taniyama conjecture, applications of Hilbert modular forms to Diophantine problems, and the role of Hodge theory in understanding algebraic cycles. His research frequently bridges automorphic representations with Galois cohomology to explore L-functions and arithmetic structures. Blasius's publication record reveals consistent thematic development since the 1990s, with increasing focus on modular forms and their geometric implications. His work demonstrates strong collaborative patterns, particularly with J. Rogawski on Shimura varieties and M. Borovoi on period torsors, while maintaining independent contributions to conjectural frameworks in number theory. No scientific awards were mentioned in the provided text. No information regarding student advising or research grants was provided in the text. He is an active member of the UCLA Number Theory Group, which drives collaborative research in modular forms, Diophantine equations, and related areas of pure mathematics through seminars and joint projects within the Department of Mathematics.

Pierre ColmezView profile

Researcher

• Arithmetic geometry
• Galois representations
• p-adic Hodge theory
• +1 more

Pierre Colmez is a French mathematician affiliated with the École Polytechnique (1993-2010) and the National Center for Scientific Research (CNRS) at the Institut de Mathématiques de Jussieu since 2010. His academic journey includes postdoctoral positions at the Institut Joseph Fourier (Grenoble) and the Max Planck Institute for Mathematics (Bonn). Ph.D. in 1988 (Grenoble) under Jean-Marc Fontaine and John Coates École Polytechnique: Professor (2006-2010), Teaching Professor (1993-2005) Colmez’s research lies at the intersection of arithmetic geometry , Galois representations , p-adic Hodge theory , and the Langlands program . His work explores connections between automorphic forms, p-adic analysis, and cohomological structures in number theory. His most recent publications focus on p-adic cohomology, Drinfeld towers, and syntomic complexes, reflecting his expertise in advanced topics of nonarchimedean geometry and Galois cohomology . Collaborations with Gabriel Dospinescu and Wiesława Nizioł highlight his contributions to modern arithmetic geometry. Prix Léonid Frank (2016) Aisenstadt Chair (2015) Prix Fermat (2005) Prix Gabrielle Sand et Guido Triossi (1999) Colmez has held editorial roles at Astérisque (1999-2004), directed the SMF Mathematical Documents collection (2001-2016), and served on editorial boards for Annales de l'ENS and Publications de l'IHES . His academic network includes collaborations with Laurent Berger, Christophe Breuil, and Jean-Pierre Serre.

Myrto MavrakiView profile

Assistant Professor

• Arithmetic Geometry
• Dynamical Systems
• Unlikely Intersections
• +7 more

Myrto Mavraki is an Assistant Professor in the Department of Mathematics at the University of Toronto, with affiliations to both the St. George and Mississauga campuses. She specializes in arithmetic geometry and dynamical systems, particularly the theory of unlikely intersections and canonical heights in families of rational maps. Institution: University of Toronto School: Faculty of Arts and Science Department: Department of Mathematics Rank: Assistant Professor Her research focuses on deep connections between arithmetic geometry and dynamical systems. Key areas include equidistribution, variation of canonical heights, preperiodic points, and unlikely intersections in families of maps, especially on the projective line and in elliptic surfaces. These topics lie at the heart of modern arithmetic dynamics and have strong ties to Diophantine geometry and number theory. The most recent publications show a sustained focus on canonical height variation, equidistribution, and the geometry of post-critically finite and preperiodic loci in parameter spaces. Collaborations with leading mathematicians such as Laura DeMarco, Harry Schmidt, and Hexi Ye reflect her central role in current developments in arithmetic dynamics. Her work combines algebraic, analytic, and arithmetic techniques to solve deep conjectures and establish foundational results. Her research is supported by an NSERC Discovery Grant and an Early Career Supplement (2024–2029), and previously by an NSF grant (DMS-2200981). She has mentored or collaborated with several prominent researchers and is likely supervising graduate students, though none are explicitly named. She does not list formal awards, but her publication record in top journals and prestigious fellowships indicate high recognition in the mathematical community. Mavraki held the Benjamin Peirce Fellowship at Harvard (2020–2023), a highly competitive postdoctoral position, and prior positions at the University of Basel and Northwestern University. She earned her PhD from the University of British Columbia under Dragos Ghioca.

• Cryptography
• Computer Security
• Coding Theory
• +2 more

Elette Boyle is an Associate Professor at the Efi Arazi School of Computer Science, Reichman University (IDC Herzliya), Israel. She serves as the Director of the FACT Research Center and is a Senior Scientist at NTT Research. Additionally, she heads the RRIS International Program. Her academic career spans prestigious institutions including MIT, Technion, and Cornell. Dr. Boyle received her Ph.D. in Mathematics from MIT under the guidance of Shafi Goldwasser and Yael Tauman Kalai. Following her doctorate, she completed postdoctoral research at the Technion Israel Institute of Technology (2013-2015) hosted by Yuval Ishai, and a short-term postdoc at Cornell University (Summer 2013) hosted by Rafael Pass. She completed her undergraduate studies in mathematics at Caltech. Her research focuses on the theoretical foundations of computer security and cryptography, with particular expertise in secure multiparty computation, function secret sharing, distributed point functions, and memory checking protocols. Her work bridges theoretical computer science with practical cryptographic applications, developing protocols that balance security guarantees with computational efficiency. Dr. Boyle's research has significantly advanced the field of cryptography, particularly in understanding the fundamental limits and possibilities of secure computation protocols. Analysis of her recent publications reveals a strong focus on the theoretical foundations of secure computation, with particular emphasis on understanding computational and communication complexity limits. Her work spans multiple dimensions of cryptography including foundational protocols, complexity analysis, and practical implementations. A recurring theme in her research is developing efficient cryptographic primitives that minimize communication overhead while maintaining strong security guarantees. Her contributions to function secret sharing, distributed point functions, and pseudorandom correlation generators have been particularly influential in the field. Dr. Boyle has advised several graduate students including Pierre Meyer (Ph.D., co-advised with Geoffroy Couteau), Matan Hamilis (Ph.D.), and D'or Banon (MSc., co-advised with Ran Cohen). Her research has been supported by various grants enabling her to lead significant projects in cryptography and secure computation. As Director of the FACT Research Center, she leads a team focused on foundational aspects of computer science and cryptography. Her center collaborates with researchers worldwide and serves as a hub for advancing cryptographic research in Israel and internationally.

Jürg KramerView profile

Professor

• Arakelov Geometry
• Automorphic Forms
• Modular Forms
• +5 more

Prof. Jürg Kramer is a Professor of Mathematics at Humboldt University of Berlin, affiliated with the Faculty of Mathematics and Natural Sciences and the Institute of Mathematics. His research focuses on Arakelov geometry, automorphic forms (particularly modular forms), and their intersections. Notable contributions include advancements in arithmetic intersection theory with logarithmic singularities and sup-norm bounds for modular forms. He is also deeply engaged in mathematics education, leading initiatives for teacher training and promoting mathematical talent through networks like the Berlin School Mathematics Network. Active in academic service, he served as EMS Education Committee Chair (2017–2022) and President of the German Mathematical Society (2013/14). His work bridges pure mathematics with pedagogical innovation, emphasizing public understanding through popular science publications. Research: Arakelov geometry, modular forms, L-functions, hyperbolic geometry methods Education: Teacher training programs, math talent promotion, textbook authorship Affiliations: Leibniz Institute for Science and Mathematics Education (IPN), EMS, Deutsche Akademie der Technikwissenschaften Key educational contributions include Felix-Klein teacher training programs and co-authoring standards for mathematics teacher education. His publications span advanced mathematical research and accessible expositions on topics like Fermat’s Last Theorem and Riemann Hypothesis.

Arno BergerView profile

Professor

• Dynamical Systems
• Ergodic Theory
• Benford's Law
• +5 more

Dr. Arno Berger is a Professor in the Department of Mathematical and Statistical Sciences at the University of Alberta. He holds a Dipl.Ing. (ME) and Dipl.Ing. (MSc) in Mechanical Engineering and Applied Mathematics from TU Wien (Vienna University of Technology), followed by a Dr. techn (PhD) and Habilitation in Applied Mathematics from the same institution. His research focuses on dynamical systems, ergodic theory, Benford's Law, nonautonomous dynamics, bifurcation theory, applied probability, and dimensional analysis. He has held visiting positions at prestigious institutions including Georgia Tech, University of Warwick, Goethe University Frankfurt, and University of Canterbury. His recent work includes studies on Saint-Venant-Polya inequalities, planar curves with position-dependent curvature, and distributions of logarithmic functions. He co-authored the seminal book An Introduction to Benford's Law (2015), and maintains the Benford Online Bibliography. His teaching spans courses like Differential Equations and Real Variables. Dr. Berger’s research has explored Benford’s Law in diverse contexts, from stochastic processes to finite-time dynamics. His articles often bridge theoretical insights with practical applications, emphasizing the ubiquity of Benford’s Law in mathematical systems.

Nai-Hui ChiaView profile

Assistant Professor

• Quantum Algorithms
• Quantum Complexity Theory
• Quantum Cryptography
• +3 more

Nai-Hui Chia is an Assistant Professor in the Department of Computer Science at Rice University. Previously, he held positions at Indiana University Bloomington (2021-2022), the University of Maryland's Joint Center for Quantum Information and Computer Science (2020-2021), and the University of Texas at Austin (2018-2020). He earned his Ph.D. in Computer Science and Engineering from Penn State University (2018) and a Bachelor's degree from National Taiwan University (2010). His research focuses on quantum algorithms, quantum complexity theory, and quantum cryptography. Key questions include exploring quantum advantages, computational limits, and the impact of quantum computing on computer science. He has contributed to foundational work on quantum circuit complexity, verification, and cryptographic protocols resilient to quantum attacks. Dr. Chia has received prestigious awards, including the NSF CAREER Award (2024), DOE Quantum Testbed Pathfinder Award (2023), and Google Scholar Award (2023). He actively participates in program committees for major conferences like TQC, Asiacrypt, and Crypto. Advising includes students like Yu-Ching Shen and Chia-Ying Lin, along with postdoctoral researchers. His work bridges theoretical computer science and quantum computing, with grants supporting research into quantum circuit size problems and post-quantum cryptography.

• Theoretical Computer Science
• Graph Algorithms
• Lower Bounds
• +7 more

Nicole Wein is an Assistant Professor in the Department of Electrical Engineering and Computer Science at the University of Michigan, where she is a member of the Theory of Computation Lab within the Computer Science and Engineering Division. Her research focuses on theoretical computer science, particularly graph algorithms and lower bounds across various domains including distance-estimation, dynamic, parameterized, distributed, and online algorithms. Education: PhD in Computer Science from MIT, advised by Virginia Vassilevska Williams Master's in Computer Science from Stanford University B.S. in Computer Science/Mathematics from Harvey Mudd College Nicole's research centers on theoretical aspects of graph algorithms and computational complexity. She investigates fundamental questions about how algorithms can efficiently handle changing data, extract information from graphs in linear time, and understand the structure of shortest paths, especially in directed graphs. Her work spans multiple algorithmic paradigms including dynamic algorithms that adapt to changing inputs, parameterized approaches for hard problems, and fine-grained complexity that establishes precise relationships between problem difficulty. Analysis of Nicole's recent publications reveals a strong focus on graph algorithms, particularly shortest path problems, spanners, and hardness results. Her work often bridges theoretical insights with practical implications, developing novel techniques for distance estimation, dynamic graph processing, and approximation algorithms. A significant portion of her research examines the structural properties of graphs that enable or constrain efficient computation, with applications across computer science. Nicole actively mentors students at various levels. She currently advises PhD student Jubayer Nirjhor and has worked with undergraduate researchers including Sam Hiken (now a pre-doc at MIT), Michael Wang, and Tony Zhang. Her teaching includes foundational courses like EECS 376: Foundations of Computer Science and specialized courses such as EECS 598: Graph Algorithms. Nicole contributes to the academic community through service as a program committee member for major conferences including SOSA 2025, FOCS 2025, SODA 2025, and others. She co-organized the June 2023 DIMACS workshop on Modern Techniques in Graph Algorithms and previously organized Algorithms Office Hours at MIT to improve communication between theory and applications of algorithms.

Jörn SteudingView profile

Professor

• Zeta and L-Functions
• Diophantine Analysis
• Modular Forms and Elliptic Curves
• +12 more

Professor Jörn Steuding holds the Professorship for Number Theory at the University of Würzburg since 2006, where he is affiliated with the Institute of Mathematics within the Faculty of Mathematics and Computer Science. His academic career includes a Ramon y Cajal research position at Universidad Autónoma de Madrid (2004-2006), postdoctoral work at the University of Frankfurt under Professors W. Schwarz and J. Wolfart (1999-2004), and completion of his habilitation at Frankfurt in 2004. His educational background includes a PhD from the University of Hannover in 1999 under Prof. G.J. Rieger, where he also served as an assistant from 1996-1999, and undergraduate studies in mathematics at Hannover from 1991-1995. Professor Steuding's research spans multiple areas of number theory, with particular focus on Zeta and L-functions (including zero distribution, universality properties, and connections to Random Matrix Theory), Diophantine analysis (covering approximation theory, equations, and the abc conjecture), elliptic curves and modular forms , algebraic number theory (including arithmetically equivalent fields), and elementary number theory with applications to primality testing and factorization. His work often bridges theoretical foundations with historical perspectives, as evidenced by his research on the Hurwitz brothers' contributions to complex continued fractions. His publication record demonstrates consistent contributions to leading journals in number theory, with research trends showing evolution from foundational work on Riemann zeta function zeros to broader investigations of L-functions in the Selberg class, Diophantine problems over quadratic fields, and historical aspects of number theory. His publications appear in prestigious journals including Mathematische Annalen, Acta Arithmetica, and the Bulletin of the American Mathematical Society. Professor Steuding has authored significant monographs including Diophantine Analysis (CRC Press/Chapman-Hall, 2005), Value distribution of L-functions (Springer Lecture Notes in Mathematics 1877, 2007), and Elementary Number Theory: A Gentle Introduction to Higher Mathematics (Springer Spektrum, 2015, co-authored with N. Oswald). He serves as the Erasmus Coordinator for his department alongside Dr. Jens Jordan, facilitating international academic exchanges. His research collaborations span multiple institutions, with notable co-authors including N. Oswald, M. Technau, H. Nagoshi, and L. Pankowski. Professor Steuding leads the Number Theory team at the University of Würzburg, maintaining an active research group focused on contemporary problems in analytic and algebraic number theory. His work continues to explore connections between classical number theory and modern mathematical physics through Random Matrix Theory applications.

Nicola NicoliciView profile

Professor

• Digital Integrated Circuit Design
• Hardware Testing
• Post-Silicon Validation
• +7 more

Nicola Nicolici is a Professor in the Department of Electrical and Computer Engineering at McMaster University. His research focuses on methods and algorithms for the design of digital integrated circuits and systems, with significant contributions in manufacturing test, post-silicon validation and debug. His work has expanded to include embedded systems, low-energy computing, and custom hardware-accelerated computing systems. Professor Nicolici's research interests span multiple areas of digital system design and validation. His early work focused on manufacturing test methodologies and power-aware testing strategies for integrated circuits. More recently, he has made significant contributions to post-silicon validation techniques, including constrained-random stimuli generation, trace signal selection, and bit-flip detection. His research has evolved to address emerging challenges in embedded computing systems, low-energy design, and specialized hardware acceleration for various applications including deep neural networks and signal processing. His recent publications reveal a strong trend toward hardware acceleration for specialized computing tasks. The research spans matrix multiplication algorithms (Strassen and Karatsuba), memory system optimization (DDR5 calibration), FPGA-based radar processing, and neural network acceleration. His work consistently bridges theoretical algorithm development with practical hardware implementation considerations, particularly focusing on precision analysis, fault tolerance, and energy efficiency. The research demonstrates a clear progression from traditional digital circuit testing to more complex system-level validation and acceleration techniques. Professor Nicolici has been actively involved in teaching courses related to system-on-chip design and test, digital systems, and embedded systems. His teaching portfolio includes advanced courses such as System-on-Chip (SOC) Design and Test and Digital Systems Design , reflecting his expertise in the field. While specific grant information isn't detailed in the provided text, his extensive publication record suggests ongoing research funding support. His research has contributed significantly to the fields of digital circuit testing, post-silicon validation, and hardware acceleration. The work has practical applications in semiconductor manufacturing, embedded systems design, and specialized computing architectures. His recent focus on neural network acceleration and memory system optimization reflects the evolving landscape of computer architecture research.

• graph algorithms
• optimization
• high-dimensional geometry
• +3 more

Yang P. Liu is an Assistant Professor in the Computer Science Department at Carnegie Mellon University's School of Computer Science. Previously, he was a Postdoctoral Member at the Institute for Advanced Study and earned his PhD from Stanford University under the supervision of Aaron Sidford. He completed his undergraduate studies at MIT, graduating in May 2018. His educational background includes: PhD in Computer Science, Stanford University (Advisor: Aaron Sidford) Bachelor's degree, Massachusetts Institute of Technology (graduated May 2018) Dr. Liu's research spans the intersection of mathematics and computer science, with particular focus on graph algorithms , optimization , high-dimensional geometry , and additive combinatorics . His work often develops novel algorithmic techniques that bridge theoretical insights with practical applications. He has made significant contributions to areas such as convex optimization, linear programming, and combinatorial problems. His teaching includes courses like "A Principled Approach to Optimization" (CS 15-759), which covers rigorous treatments of convex optimization topics including gradient descent, interior point methods, linear regression, linear programming, and sparsification. His extensive publication record in top-tier conferences (FOCS, STOC, SODA) demonstrates a consistent focus on developing almost-linear time algorithms for fundamental graph problems, optimization techniques, and combinatorial theorems. Recent work shows increasing emphasis on combinatorial lines, corners theorem, and k-CSP approximability, while maintaining strong connections to optimization theory and graph algorithms. Dr. Liu has received notable recognition for his work: National Defense Science and Engineering Graduate (NDSEG) Fellowship (2018-2021) Google PhD Fellowship (2022-2023) Best Paper award at FOCS 2022 for "Maximum Flow and Minimum-Cost Flow in Almost Linear Time" Best Student Paper at STOC 2021 for "Discrepancy Minimization via a Self-Balancing Walk" His research has been supported by prestigious fellowships including the NDSEG Fellowship and Google PhD Fellowship. His work on graph algorithms, optimization, and combinatorics involves collaborations with researchers across theoretical computer science and mathematics. His publications often involve co-authors from multiple institutions, suggesting active research collaborations across the field. Dr. Liu maintains an active research program with a focus on developing efficient algorithms for fundamental computational problems. His recent work continues to push the boundaries of what's computationally feasible in graph algorithms, optimization, and combinatorial mathematics, with particular emphasis on achieving almost-linear time complexity for challenging problems.

Abdellah SebbarView profile

Professor

• Number Theory
• Algebraic Geometry
• Arithmetic Geometry
• +7 more

Abdellah Sebbar is a Full Professor in the Department of Mathematics and Statistics at the University of Ottawa. He holds a PhD from Stony Brook University (1993-1997) and prior degrees from Rabat and Strasbourg. His research focuses on number theory, algebraic geometry, and modular forms, with specialties in elliptic curves, moonshine theory, and quantum groups. He has authored over 40 publications, including works on Schwarzian equations and equivariant functions. His career includes roles as CRM-ISM Postdoctoral Fellow (1997-1999), CMS Instructor (1999-2001), and Associate Professor (2004-2013) before attaining his current rank. He advises graduate students and collaborates on projects involving modular subgroups and automorphic forms. Education: 1992: BSc in Pure Mathematics, Rabat 1992-1993: DEA (Master's), Strasbourg 1993-1997: PhD in Mathematics, Stony Brook (Fulbright Scholar) Research Interests: Modular forms and functions Elliptic curves and surfaces Discrete groups and moonshine Quantum groups and mathematical physics Schwarzian differential equations Professional Timeline: 2013–Present: Full Professor, UOttawa 2004–2013: Associate Professor, UOttawa 2001–2004: Assistant Professor, UOttawa His recent work emphasizes applications of Schwarzian equations to modular forms and automorphic differential equations. Collaborative efforts with Hicham Saber and others explore equivariant functions and vector-valued modular forms. He has supervised multiple PhD/MSc students, including co-supervision with Damien Roy.

• Mathematical Logic
• Number Theory
• Model Theory
• +4 more

Jonathan Pila is a Reader in Mathematical Logic at the University of Oxford's Mathematical Institute, with a focus on model theory and number theory. He is affiliated with the Mathematical Logic and Number Theory research groups. BScHons (University of Melbourne, 1984) PhD (Stanford University, 1988) His research explores intersections of mathematical logic with number theory, particularly via o-minimality, addressing problems like the Andre-Oort conjecture, Zilber-Pink conjecture, and Ax-Schanuel theorems in algebraic and Diophantine geometry. Recent work includes advancements on functional transcendence, canonical heights in Shimura varieties, and uniform parameterization techniques with applications to Diophantine problems. Leverhulme Trust Research Fellowship (2008-2010) Clay Research Award (2011) LMS Senior Whitehead Prize (2011) ASL Karp Prize (2013) Elected FRS (2015) Rolf Schock Prize (2022) Frontiers of Science Award (2023)

Patrick IngramView profile

Associate Professor

• Number Theory
• Diophantine Geometry
• Arithmetic of Elliptic Curves and Surfaces
• +4 more

Patrick Ingram is an Associate Professor at the Department of Mathematics and Statistics , Faculty of Science , York University . His research focuses on number theory and diophantine geometry , particularly the arithmetic of elliptic curves and surfaces , and dynamical systems over global fields . His scholarly work includes significant contributions to the study of canonical heights , post-critically finite maps , and primitive divisors in arithmetic dynamics . His research often bridges complex dynamics with number theory, exploring the interplay between Galois representations , Drinfeld modules , and polynomial iterations . Patrick has received the Top Cited Article 2007 - 2011 award from the Journal of Number Theory . He collaborates with leading mathematicians in arithmetic dynamics, including Joseph H. Silverman , and has published extensively in top-tier journals such as the Duke Mathematical Journal , Proceedings of the London Mathematical Society , and Transactions of the American Mathematical Society . His work spans both theoretical advancements and computational techniques in algebraic divisibility sequences and rigidity theorems .

Donald SpectorView profile

Professor

• Supersymmetry
• Particle Theory
• Quantum Field Theory
• +16 more

Donald Spector is Professor of Physics at Hobart and William Smith Colleges (HWS), where he has been a faculty member since 1989. He holds a Ph.D. in Physics from Harvard University (1986) and has taught at Harvard, Cornell, and the University of Utrecht. He is affiliated with the Department of Physics in the School of Natural and Social Sciences and has served as coordinator of the Engineering Program and chair of the Physics Department. Ph.D., Harvard University, 1986 A.M., Harvard University, 1983 A.B., Harvard University, 1981, magna cum laude His research centers on supersymmetry, quantum field theory, and mathematical physics, with significant contributions to Q-balls, magnetic monopoles, and duality in supersymmetric quantum mechanics. He explores the intersection of physics with number theory, set theory, and computational complexity. His interdisciplinary work spans physics and the arts, particularly music (e.g., John Cage, Terry Riley) and theatre (e.g., Waiting for Godot ). His recent publications reveal a strong trend toward foundational questions in physics and information theory, especially the application of set-theoretic forcing to generalize information theory. His work bridges theoretical physics, mathematics, and the humanities, often drawing analogies between physical principles and artistic expression. Scientific awards and honors include: Teaching awards at Harvard and Cornell NSF-NATO Postdoctoral Fellowship KITP Scholar (2005–2008) Japan Society for the Promotion of Science Visiting Fellowship Philip J. Moorad Professor of Science (2005–2010) FQXi Grant (2013–2015) Spector has been regularly funded by the National Science Foundation, FQXi, KITP, and JSPS. He has supervised student research in quantum mechanics and simulated annealing. He is a founding member and board member of the Anacapa Society, which promotes theoretical physics at undergraduate institutions. He teaches courses such as Quantum Computing, Modern Physics, and interdisciplinary seminars like Physics through Star Trek and Time Travel & Multiple Universes . He is involved in multiple labs and collaborative initiatives, including organizing workshops at the Kavli Institute for Theoretical Physics and contributing to interdisciplinary projects at the Institute for Science and Interdisciplinary Studies. His recent work includes performing in plays and providing dramaturgical support for theatre productions.