Related papers: Dynamics in the Category Set
The Euler characteristic of a finite category is defined and shown to be compatible with Euler characteristics of other types of object, including orbifolds. A formula for the cardinality of the colimit of a diagram of sets is proved,…
The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…
A relevant category is a symmetric monoidal closed category with a diagonal natural transformation that satisfies some coherence conditions. Every cartesian closed category is a relevant category in this sense. The denomination 'relevant'…
In this paper, we give part-preserving bijections between three fundamental families of objects that serve as natural framework for many problems in enumerative combinatorics. Specifically, we consider compositions, Dyck paths, and…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the…
Path sets are spaces of one-sided infinite symbol sequences associated to pointed graphs (G_v_0), which are edge-labeled directed graphs G with a distinguished vertex v_0. Such sets arise naturally as address labels in geometric fractal…
A bijection from R to R is called an Erdos-Sierpinski mapping if it maps meager sets onto the first category sets and vice versa. We show that there is no Erdos-Sierpinski mapping preserving addition.
The paper discusses the fundamental characteristics distinguishing the natural and social systems from each other. It considers in detail the basic approaches, prospects, and possibilities of constructing mathematical description for social…
We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…
Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…
Let $(X,d)$ be a compact metric space and $f:X \to X$ be a self-map. The compact dynamical system $(X,f)$ is called sensitive or sensitivity depends on initial conditions, if there is a positive constant $\delta$ such that in each non-empty…
We characterize bijections on matrix spaces (operator algebras) preserving full rank (invertibility) of differences of matrix (operator) pairs in both directions.
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
This paper analyzes a certain action called "whirling" that can be defined on any family of functions between two finite sets equipped with a linear (or cyclic) ordering. Many maps of interest in dynamical algebraic combinatorics, such as…
Subsets of a matrix algebra over a field that are invariant under conjugation and contain the linear span of each two of their commuting elements are described. They obviously include the subsets of diagonalizable and nilpotent matrices. In…
Mathematics is the language of science. Fluent and productive use of mathematics requires one to understand the meaning embodied in mathematical symbols, operators, syntax, etc., which can be a difficult task. For instance, in algebraic…
Whether explicit or implicit, sets are a critical part of many pieces of software. As a result, it is necessary to develop abstractions of sets for the purposes of abstract interpretation, model checking, and deductive verification.…