Related papers: Topological Sequence Entropy of co-Induced Systems
Let $X$ be a first countable Hausdorff topological group. The limit of a sequence in $X$ defines a function denoted by $lim$ from the set of all convergence sequences to $X$. This definition was modified by Connor and Grosse-Erdmann for…
We revisit the maximum-entropy inference of the state of a finite-level quantum system under linear constraints. The constraints are specified by the expected values of a set of fixed observables. We point out the existence of…
A general framework to describe a vast majority of biology-inspired systems is to model them as stochastic processes in which multiple couplings are in play at the same time. Molecular motors, chemical reaction networks, catalytic enzymes,…
The phenomenon of entropy concentration provides strong support for the maximum entropy method, MaxEnt, for inferring a probability vector from information in the form of constraints. Here we extend this phenomenon, in a discrete setting,…
The entanglement entropy in one dimensional critical systems with boundaries has been associated with the noninteger ground state degeneracy. This quantity, being a characteristic of boundary fixed points, decreases under renormalization…
Let $X$ be a compact, geodesically complete, locally CAT(0) space such that the universal cover admits a rank one axis. Assume $X$ is not homothetic to a metric graph with integer edge lengths. Let $P_t$ be the number of parallel classes of…
For almost finite groupoids, we study how their homology groups reflect dynamical properties of their topological full groups. It is shown that two clopen subsets of the unit space has the same class in H_0 if and only if there exists an…
Sofic entropy is an invariant for probability-preserving actions of sofic groups. It was introduced a few years ago by Lewis Bowen, and shown to extend the classical Kolmogorov-Sinai entropy from the setting of amenable groups. Some parts…
We study the maximum induced matching problem on a graph g. Induced matchings correspond to independent sets in L2(g), the square of the line graph of g. The problem is NP-complete on bipartite graphs. In this work, we show that for a…
A group action is said to be highly-transitive if it is $k$-transitive for every $k \ge 1$. The main result of this thesis is the following: Main Theorem: The fundamental group of a closed, orientable surface of genus > 1 admits a…
Consider a Hamiltonian action of a compact Lie group H on a compact symplectic manifold (M,w) and let G be a subgroup of the diffeomorphism group Diff(M). We develop techniques to decide when the maps on rational homotopy and rational…
The inducibility of a graph $H$ is about the maximum number of induced copies of $H$ in a graph on $n$ vertices. We consider its edge version, that is, the maximum number of induced copies of $H$ in a graph with $m$ edges. Let $c(G,H)$ be…
We introduce the concept of action space, a set $\boldsymbol{X}$ endowed with an action cost $\mathsf{a}:(0,+\infty)\times \boldsymbol{X}\times \boldsymbol{X}\to [0,+\infty)$ satisfying suitable axioms, which turn out to provide a `dynamic'…
In this paper, we introduce a new entropy-like invariant, named Hausdorff metric entropy, for finitely generated semigroups acting on compact metric spaces from a set-valued view and study its properties. We establish the relation between…
Entropy is a fundamental concept from Thermodynamics and it can be used to study models on context of Creation Cold Dark Matter (CCDM). From conditions on the first ($\dot{S}\geq0$)\footnote{Throughout the present work we will use dots to…
Let $(X, T)$ be a topological dynamical system. Denote by $h (T, K)$ and $h^B (T, K)$ the covering entropy and dimensional entropy of $K\subseteq X$, respectively. $(X, T)$ is called D-{\it lowerable} (resp. {\it lowerable}) if for each…
We define the notion of entropy for a cross section of an action of continuous amenable group and relate it to the entropy of the ambient action. As a result, we are able to answer a question of J.P. Thouvenot about completely positive…
We study the maximal entropy per unit generator of push-point mapping classes on the punctured disk. Our work is motivated by fluid mixing by rods in a planar domain. If a single rod moves among N-fixed obstacles, the resulting fluid…
A plug-in estimator of entropy is the entropy of the distribution where probabilities of symbols or blocks have been replaced with their relative frequencies in the sample. Consistency and asymptotic unbiasedness of the plug-in estimator…
In our previous paper [9], we have introduced topological nearly entropy, Ent_N (f) by restricting X into a class of nearly compact spaces. In the present paper, some additional properties of this notion are studied. Furthermore, we…