Related papers: The Attractor-Cycle Notation for Finite Transforma…

In this article we combinatorially describe the triangles that are present in two types of line arrangements, those which have global cyclicity and those which are infinity type line arrangements. A combinatorial nomenclature has been…

We define natural A_infinity-transformations and construct A_infinity-category of A_infinity-functors. The notion of non-strict units in an A_infinity-category is introduced. The 2-category of (unital) A_infinity-categories, (unital)…

We consider dissipative one-dimensional systems subject to a periodic force and study numerically how a time-varying friction affects the dynamics. As a model system, particularly suited for numerical analysis, we investigate the driven…

We show that a ring of phase oscillators coupled with transmission delays can be used as a pattern recognition system. The introduced model encodes patterns as stable periodic orbits. We present a detailed analysis of the underlying…

These notes follow my articles [1, 6], and give some new important details. We propose here a new combinatorial method of encoding of measure spaces with measure preserving transformations, (or groups of transformations) in order to give…

In this paper, the intuitive idea of tilt is formalised into the rigorous concept of tilt rotations. This is motivated by the high relevance that pure tilt rotations have in the analysis of balancing bodies in 3D, and their applicability to…

Traditional human-computer interaction takes place through formally-specified systems like structured UIs and programming languages. Recent AI systems promise a new set of informal interactions with computers through natural language and…

This article handles in a short manner a few Laplace transform pairs and some extensions to the basic equations are developed. They can be applied to a wide variety of functions in order to find the Laplace transform or its inverse when…

We consider a constructive modification of quantum-mechanical formalism. Replacement of a general unitary group by unitary representations of finite groups makes it possible to reproduce quantum formalism without loss of its empirical…

Motivated by the intermediate Lang conjectures on hyperbolicity and rational points, we prove new finiteness results for non-constant morphisms from a fixed variety to a fixed variety defined over a number field by applying Faltings's…

It is widely acknowledged that function symbols are an important feature in answer set programming, as they make modeling easier, increase the expressive power, and allow us to deal with infinite domains. The main issue with their…

Continuous unitary transformations can be used to diagonalize or approximately diagonalize a given Hamiltonian. In the last four years, this method has been applied to a variety of models of condensed matter physics and field theory. With a…

Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the notion of "period" inherent in the definition of a PFT causes it to…

We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…

An $n\times n$ matrix $M=[m_{ij}]$ with $m_{ij}\in U_n=\{1,2,\ldots,n\}$ will be called a cycle matrix if $(U_n,\cdot)$ is a cycle set, where $i\cdot j=m_{ij}$. We study these matrices in this article. Using these matrices, we give some…

For classical lattice systems with finite (Ising) spins, we show that the implementation of momentum-space renormalization at the level of Hamiltonians runs into the same type of difficulties as found for real-space transformations:…

We formulate and explain the extended Burrows-Wheeler transform of Mantaci et al from the viewpoint of permutations on a chain taken as a union of partial order-preserving mappings. In so doing we establish a link with syntactic semigroups…

We study a finite uni-directional array of "cascading" or "threshold coupled" chaotic maps. Such systems have been proposed for use in nonlinear computing and have been applied to classification problems in bioinformatics. We describe some…

We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…