Related papers: Une liste de probl\`emes

For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

In this paper, we introduce a set of tools for providing user-friendly explanations in an explanation-based constraint programming system. The idea is to represent the constraints of a problem as an hierarchy (a tree). Users are then…

The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set…

We describe a list of open problems in random matrix theory and the theory of integrable systems that was presented at the conference Asymptotics in Integrable Systems, Random Matrices and Random Processes and Universality, Centre de…

While open-source software has enabled significant levels of reuse to speed up software development, it has also given rise to the dreadful dependency hell that all software practitioners face on a regular basis. This article provides a…

This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.

This is the written version of a set of introductory lectures on string theory.

This document presents a series of open questions arising in matrix computations, i.e., the numerical solution of linear algebra problems. It is a result of working groups at the workshop Linear Systems and Eigenvalue Problems, which was…

This note presents a discussion of the algebraic and combinatorial aspects of the theory of pure O-sequences. Various instances where pure O-sequences appear are described. Several open problems that deserve further investigation are also…

Modern information and communication systems have become increasingly challenging to manage. The ubiquitous system logs contain plentiful information and are thus widely exploited as an alternative source for system management. As log files…

We discuss various problems in frame theory that have been open for some years. A short discussion of frame theory is also provided, but it only contains the information that is necessary in order to understand the open problems and their…

People solve different problems and know that some of them are simple, some are complex and some insoluble. The main goal of this work is to develop a mathematical theory of algorithmic complexity for problems. This theory is aimed at…

The work consists of solutions of metric problems for convex and finite subsets of geodesic spaces.

Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…

Organizations have realized the importance of data analysis and its benefits. This in combination with Machine Learning algorithms has allowed to solve problems more easily, making these processes less time-consuming. Neural networks are…

This is a very basic introduction to some notions related to logic and complexity.

OPM is a small collection of CUTEst unconstrained and bound-constrained nonlinear optimization problems, which can be used in Matlab for testing optimization algorithms directly (i.e. without installing additional software).

This very preliminary text is related to ``Algorithms on Texts'', also called ``Algorithmic Stringology''. It is an extension of the book ``125 Problems in Text Algorithms'' providing, in the same compact style, more problems with…

This is an overview and a preview of the theory of "mixed motives of level 1" explaining some results, projects, ideas and indicating a bunch of problems.