Related papers: Free Boolean Topological Groups
Topological data analysis refers to approaches for systematically and reliably computing abstract ``shapes'' of complex data sets. There are various applications of topological data analysis in life and data sciences, with growing interest…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
The goal of this tutorial is to promote interest in the study of random Boolean networks (RBNs). These can be very interesting models, since one does not have to assume any functionality or particular connectivity of the networks to study…
Strongly zero-dimensional topological groups $G_1$, $G_2$, and $G$ such that $G_1\times G_2$ has positive covering dimension and $G$ contains a closed subgroup of positive covering dimension are constructed. Moreover, all finite powers of…
The dynamics of Boolean networks (the N-K model) with scale-free topology are studied here. The existence of a phase transition governed by the value of the scale-free exponent of the network is shown analytically by analyzing the overlap…
A group is called metahamiltonian if all non-abelian subgroups of it are normal. This concept is a natural generalization of Hamiltonian groups. In this paper, the properties of finite metahamiltonian $p$-groups are investigated.
Concept of bi-soft topological spaces is introduced. Several notions of a soft topological space are generalized to study bi-soft topological spaces. Separation axioms play a vital role in study of topological spaces. These concepts have…
We study topological groups of monotonic autohomeomorphisms on a generalized ordered space $L$. We find a condition that is necessary and sufficient for the set of all monotonic autohomeomorphisms on $L$ along with the function composition…
The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…
Through the question of singular topologies in the Boulatov model, we illustrate and summarize some of the recent advances in Group Field Theory.
This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
In this paper we discuss some physical applications of topological *-algebras of unbounded operators. Our first example is a simple system of free bosons. Then we analyze different models which are related to this one. We also discuss the…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
Classes SSGP(n)(n < \omega) of topological groups are defined, and the class-theoretic inclusions SSGP(n) \subseteq SSGP(n+1) \subseteq m.a.p. are established and shown proper. These classes are investigated with respect to the properties…
This expository paper explores the interaction of group ordering with topological questions, especially in dimensions 2 and 3. Among the topics considered are surfaces, braid groups, 3-manifolds and their structures such as foliations and…
This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the study of subgroups of the free group, with the main accent on algorithmic aspects. Consequently,…
This review explains in a self-contained way the properties of random Boolean networks and their attractors, with a special focus on critical networks. Using small example networks, analytical calculations, phenomenological arguments, and…
Without assuming the field structure on the additive group of real numbers $\mathbb{R}$ with the usual order $<,$ we explore the fact that every proper subgroup of $\mathbb{R}$ is either closed or dense. This property of subgroups of the…
It is proved that fundamental groups of boolean representable simplicial complexes are free and the rank is determined by the number and nature of the connected components of their graph of flats for dimension $\geq 2$. In the case of…