Related papers: Open Problems from CCCG 2002

Zero- and two-dimensional crystal defects form in open statistical ensembles, such as the grand canonical, that are usually inaccessible with conventional simulation techniques. This longstanding challenge is overcome with a new Hamiltonian…

We discuss conjectural scaling limits of discrete 2-dimensional aggregation models conditioned on a semi-axis considered by Levine and Peres in arXiv:0712.3378. These are certain problems about Hele-Show flows. We study moment properties of…

Lower bounds for some explicit decision problems over the complex numbers are given.

This paper is a write-up of the ideas that were presented, developed and discussed at the fourth International Workshop on QCD Challenges from pp to AA, which took place in February 2023 in Padua, Italy. The goal of the workshop was to…

We give here a compilation of papers presented at Lattice 98 (XVI Intl. Symposium on Lattice Field Theory, Boulder, Colorado, USA, 13-18 July 1998). The contents are in html form with clickable links to the papers that exist on the hep-lat…

These notes are based on the mini-course given in June 2004 in Cetraro, Italy, in the frame of a C.I.M.E. school. Of course, they contain much more material that I could present in the 6 hours course. The main goal is to give an idea of the…

This paper provides a set of cycling problems in linear programming. These problems should be useful for researchers to develop and test new simplex algorithms. As matter of the fact, this set of problems is used to test a recently proposed…

This volume contains the proceedings of the Second International Workshop on Developments in Implicit Computational complExity (DICE 2011), which took place on April 2-3 2011 in Saarbruecken, Germany, as a satellite event of the Joint…

We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from…

The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…

Addressing irregular cutting and packing (C&P) optimization problems poses two distinct challenges: the geometric challenge of determining whether or not an item can be placed feasibly at a certain position, and the optimization challenge…

PLACES 2012 (full title: Programming Language Approaches to Concurrency- and Communication-Centric Software) is the fifth edition of the PLACES workshop series. After the first PLACES, which was affiliated to DisCoTec in 2008, the workshop…

Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…

We consider the problem of finding embedded closed geodesics on the two-sphere with an incomplete metric defined outside a point. Various techniques including curve shortening methods are used.

We review various combinatorial problems with underlying classical or quantum integrable structures. (Plenary talk given at the International Congress of Mathematical Physics, Aalborg, Denmark, August 10, 2012.)

This is the expanded version of my talk at the workshop "Groups of Automorphisms in Birational and Affine Geometry", October 29--November 3, 2012, Levico Terme, Italy. The first section is focused on Jordan groups in abstract setting, the…

Modern hardware platforms, from the very small to the very large, increasingly provide parallel and distributed computing resources for applications to maximise performance. Many applications therefore need to make effective use of tens,…

The open problem of whether or not every pair of equal-area polygons has a hinged dissection is discussed.

ADG is a forum to exchange ideas and views, to present research results and progress, and to demonstrate software tools at the intersection between geometry and automated deduction. The conference is held every two years. The previous…

Language models are not accurate in numerical problems. Their architecture does not allow for anything less than a probabilistic next word. This paper introduces ComputeGPT: an approach of creating a chat model able to answer computational…