Related papers: Substitutive systems and a finitary version of Cob…
The functional approach to compositional distributional semantics considers transitive verbs to be linear maps that transform the distributional vectors representing nouns into a vector representing a sentence. We conduct an initial…
We say that a fusion system is the composition product of two subsystems if every morphism can be factored as a morphism in one fusion system followed by a morphism in the other. We establish a relationship between the characteristic…
The extended de Finetti theorem characterizes exchangeable infinite random sequences as conditionally i.i.d. and shows that the apparently weaker distributional symmetry of spreadability is equivalent to exchangeability. Our main result is…
Changes of variables giving the dual model are constructed explicitly for sigma-models without isotropy. In particular, the jacobian is calculated to give the known results. The global aspects of the abelian case as well as some of those of…
Let $W$ be an infinite word over finite alphabet $A$. We get combinatorial criteria of existence of interval exchange transformations that generate the word W.
A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…
We study a random dynamical system such that one transformation is randomly selected from a family of transformations and then applied on each iteration. For such random dynamical systems, we consider estimates of absolutely continuous…
We study mechanical systems subject to constraint functions that can be dependent at some points and independent at the rest. Such systems are modelled by means of generalized codistributions. We discuss how the constraint force can…
We introduce a new formulation of the axiom of dependent choice that can be viewed as an abstract termination principle, which generalises the recursive path orderings used to establish termination of rewrite systems. We consider several…
A general solution is found for a large class of time continuous autonomous nonlinear dynamical systems, the so-called quasi-polynomial systems. This solution is expressed in terms of a new type of special functions defined via their Taylor…
Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…
Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic…
This work explores the tensor and combinatorial constructs underlying the linearised higher-order variational equations of a generic autonomous system along a particular solution. The main result of this paper is a compact yet explicit and…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
We extend de Finetti's (1937) notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than (linear) previsions. We prove…
A Lie system is a nonautonomous system of first-order differential equations possessing a superposition rule, i.e. a map expressing its general solution in terms of a generic finite family of particular solutions and some constants.…
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
In this paper, we consider infinite words that arise as fixed points of primitive substitutions on a finite alphabet and finite colorings of their factors. Any such infinite word exhibits a "hierarchal structure" that will allow us to…
Supmech, which is noncommutative Hamiltonian mechanics \linebreak (NHM) (developed in paper I) with two extra ingredients : positive observable valued measures (PObVMs) [which serve to connect state-induced expectation values and classical…
The thesis is devoted to relations between algebra and symbolic dynamics. Various generalisations of sturmian sequences are discoursed. Let $W$ be an infinite word over a finite alphabet $A$. The combinatorial criteria of existence of…