Related papers: Digital Collections of Examples in Mathematical Sc…
In this short note we extend some of the recent results on matrix completion under the assumption that the columns of the matrix can be grouped (clustered) into subspaces (not necessarily disjoint or independent). This model deviates from…
We introduce a set of eight universal Rules of Inference by which computer programs with known properties (axioms) are transformed into new programs with known properties (theorems). Axioms are presented to formalize a segment of Number…
Approximate Bayesian computation (ABC) has gained popularity in recent years owing to its easy implementation, nice interpretation and good performance. Its advantages are more visible when one encounters complex models where maximum…
By nature, transmissible human knowledge is enumerable: every sentence, movie, audio record can be encoded in a sufficiently long string of 0's and 1's. The works of G\"odel, Turing and others showed that there are inherent limits and…
This is an expanded version of the notes of our lectures given at the conference "Current Developments in Mathematics 2003" held at Harvard University on November 21--22, 2003. We present an overview of the main definitions, results and…
Humans spend a significant part of their lives being a part of groups. In this document we propose research directions that would make it possible to computationally form productive groups. We bring to light several issues that need to be…
Computer simulations are enabling researchers to investigate systems which are extremely difficult to handle analytically. In the particular case of General Relativity, numerical models have proved extremely valuable for investigations of…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
The increasing power of computer technology does not dispense with the need to extract meaningful in- formation out of data sets of ever growing size, and indeed typically exacerbates the complexity of this task. To tackle this general…
Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to constrained-random verification. While the theory of these…
The unification problem in algebras capable of describing sets has been tackled, directly or indirectly, by many researchers and it finds important applications in various research areas--e.g., deductive databases, theorem proving, static…
The use of statistical software in academia and enterprises has been evolving over the last years. More often than not, students, professors, workers, and users, in general, have all had, at some point, exposure to statistical software.…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to deal, which is especially true for AI. This raises a big…
We analyse some aspects of the notion of algebraic exponentiation introduced by the second author [16] and satisfied by the category of groups. We show how this notion provides a new approach to the categorical-algebraic question of the…
In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising…
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…
A coset relation algebra is one embeddable into some full coset relation algebra, the latter is an algebra constructed from a system of groups, a coordinated system of isomorphisms between quotients of these groups, and a system of cosets…
We prove various extensions of the Tennenbaum phenomenon to the case of computable quotient presentations of models of arithmetic and set theory. Specifically, no nonstandard model of arithmetic has a computable quotient presentation by a…
Multi-model databases are designed to store, manage, and query data in various models, such as relational, hierarchical, and graph data, simultaneously. In this paper, we provide a theoretical basis for querying categorical databases. We…