Related papers: Ten Conferences WORDS: Open Problems and Conjectur…
$\texttt{Randomstrasse101}$ is a blog dedicated to Open Problems in Mathematics, with a focus on Probability Theory, Computation, Combinatorics, Statistics, and related topics. This manuscript serves as a stable record of the Open Problems…
Causality and causal inference have emerged as core research areas at the interface of modern statistics and domains including biomedical sciences, social sciences, computer science, and beyond. The field's inherently interdisciplinary…
We present an empirical study aimed at analysing the use of viewpoints in an industrial Concurrent Engineering context. Our focus is on the viewpoints expressed in the argumentative process taking place in evaluation meetings. Our results…
We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…
Recent conditional language models are able to continue any kind of text source in an often seemingly fluent way. This fact encouraged research in the area of open-domain conversational systems that are based on powerful language models and…
This talk is a brief summary of some theoretical issues in the field of hot and dense QCD matter and ultra-relativistic heavy ion collisions.
Increasing amounts of available data have led to a heightened need for representing large-scale probabilistic knowledge bases. One approach is to use a probabilistic database, a model with strong assumptions that allow for efficiently…
Searching for new information requires talking to the system. In this research, an Open-domain Conversational information search system has been developed. This system has been implemented using the TREC CAsT 2019 track, which is one of the…
In this note we briefly survey and propose some open problems related to isoparametric theory.
Speech is one of the interaction modalities that we increasingly come across in natural user interfaces. However, its use in collaborative scenarios has not yet been thoroughly investigated. In this reflection statement, we discuss the…
We have recently begun a project to develop a more effective and efficient way to marshal inferences from background knowledge to facilitate deep natural language understanding. The meaning of a word is taken to be the entities,…
To build a large library of mathematics, it seems more efficient to take advantage of the inherent structure of mathematical theories. Various theory presentation combinators have been proposed, and some have been implemented, in both…
The increasingly concurrent and parallel landscape of hardware and software infrastructures demands the exploration and understanding of a wide variety of foundational and practical ideas. The International Workshop on Programming Language…
The first three sections of this survey represent an updated and much expanded version of the abstract of my talk at FPSAC'2010: new results are incorporated and several concrete conjectures on the interactions between the three…
This is an informal discussion on one of the basic problems in the theory of empirical processes, addressed in our preprint "Combinatorics of random processes and sections of convex bodies", which is available at ArXiV and from our web…
Learning word embeddings using distributional information is a task that has been studied by many researchers, and a lot of studies are reported in the literature. On the contrary, less studies were done for the case of multiple languages.…
This is a collection of open problems and research ideas following the presentations and the discussions of the AGATES Kickoff Workshop held at the Institute of Mathematics of the Polish Academy of Sciences (IMPAN) and at the Department of…
For positive integers $n$ and $k$ such that $k$ is at most $n$, we find an explicit one-to-one correspondence between the following two sets: the set of words consisting of $k$ $R$s, $k$ $U$s, and $n - k$ $D$s, where the first letter of the…
A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive…
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word…