Related papers: Continuous Tasks and the Chromatic Simplicial Appr…
Let $C_b(X)$ be the C*-algebra of bounded continuous functions on some non-compact, but locally compact Hausdorff space $X$. Moreover, let $A_0$ be some ideal and $A_1$ be some unital C*-subalgebra of $C_b(X)$. For $A_0$ and $A_1$ having…
Absolute Parallelism (AP) has many interesting features: large symmetry group of equations; field irreducibility with respect to this group; vast list of consistent second order equations not restricted to Lagrangian ones. There is the…
Stanley [9] introduced the chromatic symmetric function ${\bf X}_G$ associated to a simple graph $G$ as a generalization of the chromatic polynomial of $G$. In this paper we present a novel technique to write ${\bf X}_G$ as a linear…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
We study a chromatic theory of asymptotic approximate groups for tuples of subsets of abelian groups, combining Nathanson's chromatic sumset formalism with asymptotic covering ideas from approximate group theory. This framework encodes…
This study deals with analysis and control of cooperative synchronization for identical agents interacting on a directed graph topology. The agents are considered to have general continuous linear time-invariant dynamics with homogeneous…
The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…
Coordination is essential for dynamic distributed systems whose components exhibit interactive and autonomous behaviors. Spatially distributed, locally interacting, propagating computational fields are particularly appealing for allowing…
A task is a distributed problem for $n$ processes, in which each process starts with a private input value, communicates with other processes, and eventually decides an output value. A task is colorless if each process can adopt the input…
Compatible equations, Singularities of solutions, Topological charges and quasi-charges. PhD thesis (translated frorm Russian). The book shows the sights of Absolute Parallelism (AP), and contains useful information on the problem of…
We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…
A topological space $A$ is said to be compatible with a set $\Sigma$ of equations (involving operation symbols $F_t$) iff there are continuous operations $\overline F_t$ identically satisfying $\Sigma$ on $A$. The paper's main focus is on…
We introduce a quasisymmetric class function associated with a group acting on a double poset or on a directed graph. The latter is a generalization of the chromatic quasisymmetric function of a digraph introduced by Ellzey, while the…
We consider approximations of a continuous function on a countable normed Fr\'{e}chet space by analytic and $*$-analytic. Also we found a criterium of the existence of an extension of a continuous function from a dense subspace of a…
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a…
In this paper, we hope to bring closer graph theory and consensus algorithms. Firstly, we give a brief introduction to graph theory by listing a concise definition. Then we analyze and visualize some commonly used graphs. Secondly, we…
Continual graph learning (CGL) aims to learn from dynamically evolving graphs while mitigating catastrophic forgetting. Existing CGL approaches typically adopt a task-based formulation, where the data stream is partitioned into a sequence…
Holomorphic functions are amazing because their values in an ever so small disk in the complex plane completely determine the function values at arbitrary points in their maximum possible domain. The process of extending such a function…
In the mid-1990s, Stanley and Stembridge conjectured that the chromatic symmetric functions of claw-free co-comparability (also called incomparability) graphs were e-positive. The quest for the proof of this conjecture has led to an…
We propose a decision-theoretic framework for computational complexity, complementary to classical theory: moving from syntactic exactness (Turing / Shannon) to semantic simulability (Le Cam). While classical theory classifies problems by…