Related papers: Continuous Tasks and the Chromatic Simplicial Appr…
A few recent papers introduced the concept of topological synchronisation. We refer in particular to \cite{TS}, where the theory was illustrated by means of a skew product system, coupling two logistic maps. In this case, we show that the…
The \emph{Continuity Problem} is the question whether effective operators are continuous, where an effective operator $F$ is a function on a space of constructively given objects $x$, defined by mapping construction instructions for $x$ to…
Chromatic quasisymmetric functions of labeled graphs were defined by Shareshian and Wachs as a refinement of Stanley's chromatic symmetric functions. In this extended abstract, we consider an extension of their definition from labeled…
The interaction between discrete and continuous mathematics lies at the heart of many fundamental problems in applied mathematics and computational sciences. In this paper we discuss the problem of discretizing vector-valued functions…
Persistent homology is a topological feature used in a variety of applications such as generating features for data analysis and penalizing optimization problems. We develop an approach to accelerate persistent homology computations…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
"What is an algorithm?" is a fundamental question of computer science. Gurevich's behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial answer by defining (non-deterministic) sequential algorithms…
Building on our previous work, we give a thorough presentation of the techniques developed for synchronizing dynamical systems in the special case of synchronizing shift spaces. Following work of Thomsen, we give a construction of the…
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…
Let $P$ be a poset, $inc(P)$ its incomparability graph, and $X_{inc(P)}$ the corresponding chromatic symmetric function, as defined by Stanley in {\em Adv. Math.}, {\bf 111} (1995) pp.~166--194. Certain conditions on $P$ imply that the…
The celebrated \emph{asynchronous computability theorem} provides a characterization of the class of decision tasks that can be solved in a wait-free manner by asynchronous processes that communicate by writing and taking atomic snapshots…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
The chromatic symmetric $X_G$ function is a symmetric function generalization of the chromatic polynomial of a graph, introduced by Stanley (1995). Stanley gave an expansion formula for $X_G$ in terms of the power sum symmetric functions…
A classical limit theorem of stochastic process theory concerns the sample cumulative distribution function (CDF) from independent random variables. If the variables are uniformly distributed then these centered CDFs converge in a suitable…
When used in high-stakes settings, AI systems are expected to produce decisions that are transparent, interpretable and auditable, a requirement increasingly expected by regulations. Decision trees such as CART provide clear and verifiable…
Some formal aspects of the Semantic Spacetime graph model are presented, with reference to its use for directed knowledge representations and process modelling. A finite $\gamma(3,4)$ representation is defined to form a closed set of…
We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…
This paper studies continual learning (CL) of a sequence of aspect sentiment classification(ASC) tasks in a particular CL setting called domain incremental learning (DIL). Each task is from a different domain or product. The DIL setting is…
In collaborative tasks, autonomous agents fall short of humans in their capability to quickly adapt to new and unfamiliar teammates. We posit that a limiting factor for zero-shot coordination is the lack of shared task abstractions, a…
The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan. At the end of the first section I examine tree-balancing. In the second section I summarize the…