Related papers: Some results on combinators in the system TRC

Rational twisted power series over a (commutative) field are studied. We give several characterizations of such series, which are similar to the classical results concerning rational power series over a commutative field. In particular, we…

Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…

This work investigates the combinatorial structures underlying cyclic conditional freeness and introduces cumulants that serve to linearize the cyclic conditional additive convolution. In the process, we establish the notion of "cyclic…

This paper proposes a new logic RoCTL* to model robustness in concurrent systems. RoCTL* extends CTL* with the addition of Obligatory and Robustly operators, which quantify over failure-free paths and paths with one more failure…

Even though it is undoubtedly very appealing to interpret the latest T2K results as evidence of CP violation, this claim assumes CPT conservation in the neutrino sector to an extent that has not been tested yet. As we will show, T2K results…

Motivated by the controllability/reachability problems for switched linear control systems and some classes of nonlinear (mechanical) control systems we address a related problem of existence of a cyclic vector for an associative (matrix)…

We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants, functions and relations the program uses. The verification…

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;…

An uninterpreted program (UP) is a program whose semantics is defined over the theory of uninterpreted functions. This is a common abstraction used in equivalence checking, compiler optimization, and program verification. While simple, the…

We extend, in significant ways, the theory of truncated boolean representable simplicial complexes introduced in 2015. This theory, which includes all matroids, represents the largest class of finite simplicial complexes for which…

The notion of normal forms is ubiquitous in various equivalent transformations. Confluence (CR), one of the central properties of term rewriting systems (TRSs), concerns uniqueness of normal forms. Yet another such property, which is weaker…

We rigorously establish some exact properties of reflection symmetric spin systems with antiferromagnetic crossing bonds: At least one ground state has total spin zero and a positive semidefinite coefficient matrix. The crossing bonds obey…

The correlators of two-dimensional rational conformal field theories that are obtained in the TFT construction of [FRSI,FRSII,FRSIV] are shown to be invariant under the action of the relative modular group and to obey bulk and boundary…

Several authors have introduced various type of coherent-like rings and proved analogous results on these rings. It appears that all these relative coherent rings and all the used techniques can be unified. In [2], several coherent-like…

General spin-1/2 chains with symmetric nearest-neighbor interaction are studied. We rigorously prove that all spin models in this class, except for known integrable systems, are non-integrable in the sense that they possess no nontrivial…

We show that there are links whose individual components are concordant to the unknot, but which are not concordant to any link with unknotted components. We give examples in the topological category, and examples in the smooth category…

We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.

We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…

We consider tiling dynamical systems and topological conjugacies between them. We prove that the criterion of being finite type is invariant under topological conjugacy. For substitution tiling systems under rather general conditions,…

We introduce the notion of non commutative truncated polynomial extension of an algebra A. We study two families of these extensions. For the first one we obtain a complete classification and for the second one, which we call upper…