Related papers: Open Problems from CCCG 2002

We survey some recent work on topological quantum computation with gapped boundaries and boundary defects and list some open problems.

Those notes rest on the Samuel Eilenberg Lectures I gave at Columbia University, NY, in the fall 2022. I thank all the mathematicians who participated in their elaboration, directly or indirectly. They are meant to be published as a…

This is an overview of math.AG/0310186, math.AG/0309290, math.AG/0501247, math.AG/0401002 and math.AG/0504584 written for the Proceedings of the AMS Meeting on Algebraic Geometry, Seattle, 2005.

This is the Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, which was held in Edinburgh, Scotland July 26 - 29 2005.

Four pedagogical Lectures at the NATO-ASI on "Quantum Geometry" in Akureyri, Iceland, August 1999. Contents: 1. O(N) Vector Models, 2. Large-N QCD, 3. QCD in Loop Space, 4. Large-N Reduction

This volume contains the proceedings of EXPRESS/SOS 2024: the Combined 31st International Workshop on Expressiveness in Concurrency and the 21st Workshop on Structural Operational Semantics, which was held in Calgary, Canada, as an…

We present a list of problems in arithmetic topology posed at the June 2019 PIMS/NSF workshop on "Arithmetic Topology". Three problem sessions were hosted during the workshop in which participants proposed open questions to the audience and…

In this note, we propose some open problems and questions about bounded convex domains in $\mathbb C^N$, specifically about visibility and iteration theory.

This collection of thirty two reviewed articles covers several fields of General Topology. Several contributions represent invited presentations at the Ninth Prague Topological Symposium.

We discuss some challenging open problems in the geometric control theory and sub-Riemannian geometry.

This note is an expansion of three lectures given at the workshop "Topology, Complex Analysis and Arithmetic of Hyperbolic Spaces" held at Kyoto University in December of 2006 and will appear in the proceedings for this workshop.

The paper surveys open problems and questions related to interplay between the theory of integrable systems with infinitely and finitely many degrees of freedom and Nijenhuis geometry. This text has grown out from preparatory materials for…

The paper proposes open problems in classical Kolmogorov complexity. Each problem is presented with background information and thus the article also surveys some recent studies in the area.

The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked - a state which is revealed only upon reaching an incident vertex. Originally stated by Papadimitriou and Yannakakis…

In this paper, we consider the quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces. By using the Legendre property of quadratic forms or the compactness of operators in the presentations of…

A Grid testbed has been established using resources at 12 sites across Canada involving researchers from particle physics as well as other fields of science. We describe our use of the testbed with the BaBar Monte Carlo production and the…

Computational models pervade all branches of the exact sciences and have in recent times also started to prove to be of immense utility in some of the traditionally 'soft' sciences like ecology, sociology and politics. This volume is a…

The 2007 Midwest Geometry Conference included a panel discussion devoted to open problems and the general direction of future research in fields related to the main themes of the conference. This paper summarizes the comments made during…

This is an expanded version of the notes for the two lectures at the 2004 International Mathematics Conference (Chonbuk National University, August 4-6, 2004). The first lecture discusses the origins of cluster algebras, with the focus on…

We study the two-center problem on cactus graphs in facility locations, which aims to place two facilities on the graph network to serve customers in order to minimize the maximum transportation cost. In our problem, the location of each…