English
Related papers

Related papers: Ten Conferences WORDS: Open Problems and Conjectur…

200 papers

We present a list of open questions in the theory of holomorphic foliations, possibly with singularities. Some problems have been around for a while, others are very accessible.

Complex Variables · Mathematics 2018-07-17 Tien-Cuong Dinh , Nessim Sibony

Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints may take various…

Artificial Intelligence · Computer Science 2020-12-29 Jian Zhang , Cunjing Ge , Feifei Ma

Speech summarization has become an essential tool for efficiently managing and accessing the growing volume of spoken and audiovisual content. However, despite its increasing importance, speech summarization remains loosely defined. The…

Computation and Language · Computer Science 2025-10-20 Fabian Retkowski , Maike Züfle , Andreas Sudmann , Dinah Pfau , Shinji Watanabe , Jan Niehues , Alexander Waibel

New cases of the multiplicity conjecture are considered.

Commutative Algebra · Mathematics 2007-05-23 Juergen Herzog , Xinxian Zheng

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

Computational Complexity · Computer Science 2009-09-25 Erik D. Demaine , Robert A. Hearn

We choose random points in the hyperbolic disc and claim that these points are already word representations. However, it is yet to be uncovered which point corresponds to which word of the human language of interest. This correspondence can…

Computation and Language · Computer Science 2022-04-27 Sultan Nurmukhamedov , Thomas Mach , Arsen Sheverdin , Zhenisbek Assylbekov

Work in progress concerning alternative formalizations of arithmetic.

Logic · Mathematics 2018-01-04 David M. Cerna

This survey is intended to provide an overview of one of the oldest and most celebrated open problems in combinatorial algebra: the word problem for one-relation monoids. We provide a history of the problem starting in 1914, and give a…

Group Theory · Mathematics 2021-07-28 Carl-Fredrik Nyberg-Brodda

The need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web. A number of researchers addressed this problem by proposing a unified semantics for hybrid knowledge…

Artificial Intelligence · Computer Science 2011-07-27 Martin Slota , João Leite

This volume contains the proceedings of the 17th International Workshop on Expressiveness in Concurrency (EXPRESS'10), which took place on 30th August 2010 in Paris, co-located with CONCUR'10. The EXPRESS workshop series aim at bringing…

Logic in Computer Science · Computer Science 2010-11-30 Sibylle Fröschle , Frank D. Valencia

These five lectures on undecidability were given to students with a good level in mathematics but with no special knowledge on logic. The first conference presents the formalization of mathematics with a short historical survey, the…

Logic · Mathematics 2007-11-30 Nicolas Bouleau , Jean-Yves Girard , Alain Louveau

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…

Formal Languages and Automata Theory · Computer Science 2026-02-26 Volker Diekert , Silas Natterer , Alexander Thumm

This is a list of problems that were collected from participants at the Comparative Prime Number Theory Symposium held at UBC from June 17 to June 21, 2024. Its goal is to stimulate research and future collaborations in this growing field.…

Number Theory · Mathematics 2024-07-08 Alia Hamieh , Habiba Kadiri , Greg Martin , Nathan Ng

We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.

Combinatorics · Mathematics 2016-07-08 Sven Schäge

This article surveys recent advances in applying algebraic techniques to constraint satisfaction problems.

Logic in Computer Science · Computer Science 2007-05-23 Hubie Chen

Linguistic relations in oral conversations present how opinions are constructed and developed in a restricted time. The relations bond ideas, arguments, thoughts, and feelings, re-shape them during a speech, and finally build knowledge out…

Computation and Language · Computer Science 2017-03-02 Ceyda Sanli , Anupam Mondal , Erik Cambria

In the talk at the workshop my aim was to demonstrate the usefulness of graph techniques for tackling problems that have been studied predominantly as problems on the term level: increasing sharing in functional programs, and addressing…

Logic in Computer Science · Computer Science 2019-02-07 Clemens Grabmayer

In this tutorial, we will survey known results on the complexity of conjunctive query evaluation in different settings, ranging from Boolean queries over counting to more complex models like enumeration and direct access. A particular focus…

Databases · Computer Science 2025-06-24 Stefan Mengel

Semantic role theory considers roles as a small universal set of unanalyzed entities. It means that formally there are no restrictions on role combinations. We argue that the semantic roles co-occur in verb representations. It means that…

Computation and Language · Computer Science 2018-10-10 Aliaksandr Huminski , Hao Zhang , Gangeshwar Krishnamurthy

We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.

Dynamical Systems · Mathematics 2022-02-24 Fedor Pakovich