Related papers: Disjoint frequently hypercyclic pseudo-shifts
We construct a finitely generated subgroup of $\text{Diff}^{\infty}(\mathbb{S}^3 \times \mathbb{S}^1)$ where every element is conjugate to an isometry but such that the group action itself is far from isometric (the group has "exponential…
Let $G$ be a locally compact group, and let $1\le p < \infty$. Consider the weighted $L^p$-space $L^p(G,\omega)=\{f:\int|f\omega|^p<\infty\}$, where $\omega:G\to \mathbb R$ is a positive measurable function. Under appropriate conditions on…
Let \(\cU\) be the multiplicative group of order~\(n\) in the splitting field \(\bbF_{q^m}\) of \(x^n-1\) over the finite field \(\bbF_q\). Any map of the form \(x\rightarrow cx^t\) with \(c\in \cU\) and \(t=q^i\), \(0\leq i<m\), is…
Given a Furstenberg family F and a subset {\Gamma} of C, we introduce and explore the notions of F_{\Gamma}-hypercyclic operator and F-hypercyclic scalar set. First, the study of F_C-hypercyclic operators yields new interesting information…
We discuss local supercurrents as sources of the super-Einstein equations in the superconformal approach in the old and new minimal (auxiliary fields) formulation. Modifications of the Ward identity giving the covariant divergence of the…
In a recent paper [15], Hilbert space operators $T$ with the property that each sequence of the form $\{\|T^n h\|^2\}_{n=0}^{\infty}$ is conditionally positive definite in a semigroup sense were introduced. In the present paper, this line…
The cyclicity problem, crucial in analyzing planar vector fields, consists in estimating the number of limit cycles emanating from monodromic singularities. Traditionally, this estimation relies on Lyapunov coefficients. However, in…
After relating the notion of $\omega$-recurrence in skew products to the range of values taken by partial ergodic sums and Lyapunov exponents, ergodic $\mathbb{Z}$-valued cocycles over an irrational rotation are presented in detail. First,…
In this note, we prove that if G is a countable group that contains a nonabelian free subgroup then every pair of nontrivial Bernoulli shifts over G are weakly isomorphic.
Homoclinic classes of generic $C^1$-diffeomorphisms are maximal transitive sets and pairwise disjoint. We here present a model explaining how two different homoclinic classes may intersect, failing to be disjoint. For that we construct a…
We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these subcomplexes capture many important structural properties of…
The article addresses some open questions about the relations between the topological weak mixing property and the transitivity of the map $f\times f^2 \times...\times f^m$, where $f\colon X\ra X$ is a topological dynamical system on a…
Analogous to the case of the binomial random graph $G(d+1,p)$, it is known that the behaviour of a random subgraph of a $d$-dimensional hypercube, where we include each edge independently with probability $p$, which we denote by $Q^d_p$,…
Let $X_1, X_2, \ldots$ be i.i.d. random variables with values in $\mathbb{Z}^d$ satisfying $\mathbb{P} \left(X_1=x\right) = \mathbb{P} \left(X_1=-x\right) = \Theta \left(\|x\|^{-s}\right)$ for some $s>d$. We show that the random walk…
We prove that for integers $2 \leq \ell < k$ and a small constant $c$, if a $k$-uniform hypergraph with linear minimum codegree is randomly `perturbed' by changing non-edges to edges independently at random with probability $p \geq…
We develop sufficient analytic conditions for recurrence and transience of non-sectorial perturbations of possibly non-symmetric Dirichlet forms on a general state space. These form an important subclass of generalized Dirichlet forms which…
Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…
We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$…
Let $A$ be a finite set and $G$ a group. A closed subset $X$ of $A^G$ is called a subshift if the action of $G$ on $A^G$ preserves $X$. If $K$ is a closed subset of $A^G$ such that membership in $K$ is determined by looking at a fixed…
There are noncomputable c.e.\ sets, computable from every SJT-hard c.e.\ set. This yields a natural pseudo-jump operator, increasing on all sets, which cannot be inverted back to a minimal pair or even avoiding an upper cone.