Related papers: A dynamical characterization of C sets
Many important dynamic systems, time series models or even algorithms exhibit non-strong mixing properties. In this paper, we introduce the general concept of $\mathcal{C}_{p,\mathcal{F}}$-mixing to cover such cases, where assumptions on…
The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets,…
In the theory of zero-dimensional systems and their relation to $C^*$-algebras, Poon (1990) introduced a class of closed sets. We call the closed sets quasi-sections. Medynets (2006) introduced basic sets that are part of quasi-sections in…
Furstenberg has associated to every topological group $G$ a universal boundary $\partial(G)$. If we consider in addition a subgroup $H<G$, the relative notion of $(G,H)$-boundaries admits again a maximal object $\partial(G,H)$. In the case…
A natural and intrinsic characterization of the structure of the set $\mathfrak{C}$ of positive unital maps is given, i.e. it is shown that $\mathfrak{C}$ is isometrically isomorphic to the subset $\gD$ of bp-positive density matrices…
Using a result of Behrend concerning sets without arithmetic progressions, we construct some examples of dynamical systems with slow time of multiple recurrence. Our theorem is a quatitative analog of Furstenberg's Correspondence Principle.
In this work, we aim to advance the development of a fractal theory for sets of integers. The core idea is to utilize the fractal structure of $p$-adic integers, where $p$ is a prime number, and compare this with conventional densities and…
We introduce a notion of noncommutative Choquet simplex, or briefly an nc simplex, that generalizes the classical notion of a simplex. While every simplex is an nc simplex, there are many more nc simplices. They arise naturally from…
Given a standard myopic dynamic process among coalition structures, an absorbing set is a minimal collection of such structures that is never left once entered through that process. Absorbing sets are an important solution concept in…
The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories. Some of important general solution concepts of choice problems when the set of best alternatives does…
The free central-limit theorem, a fundamental theorem in free probability, states that empirical averages of freely independent random variables are asymptotically semi-circular. We extend this theorem to general dynamical systems of…
Let $X$ be a completely regular topological space. We assign to each (set theoretic) ideal of $X$ an (algebraic) ideal of $C_B(X)$, the normed algebra of continuous bounded complex valued mappings on $X$ equipped with the supremum norm. We…
Suppose that $\mathcal{C}$ is the space of all middle Cantor sets. We characterize all triples $(\alpha,~\beta,~\lambda)\in \mathcal{C}\times\mathcal{C}\times \mathbb{R}^*$ that satisfy $C_\alpha- \lambda C_\beta=[-\lambda,~1]. $ Also all…
In \cite{D3}, Donaldson defines a dynamical system on the space of Fubini-Study metrics on a polarized compact K\"ahler manifold. Sano proved that if there exists a balanced metric for the polarization, then this dynamical system always…
An aperiodic tile set was first constructed by R.Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics…
Dynamical systems are ubiquitous in science and engineering as models of phenomena that evolve over time. Although complex dynamical systems tend to have important modular structure, conventional modeling approaches suppress this structure.…
Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many different centrality measures exist, most of them apply to…
We construct, in locally compact, second countable, amenable groups, sets with large density that fail to have certain combinatorial properties. For the property of being a shift of a set of measurable recurrence we show that this is…
We introduce the notion of a rational dynamical system extending the classical notion of a topological dynamical system and we prove (multiple) recurrence results for such systems via a partition theorem for the rational numbers proved by…
A construction of reversible extensions of dynamical systems which applies to arbitrary mappings (not necessarily with open range) is presented. It is based on calculating the maximal ideal space of C*-algebras that extends endomorphisms to…