English
Related papers

Related papers: Dynamical IP$^{\star}$-sets in weak rings

200 papers

We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…

Dynamical Systems · Mathematics 2023-09-15 Darren Creutz , Ronnie Pavlov

A number $m$ is said to be a $\textit{de Polignac number}$, if infinitely many pairs of consecutive primes exist, such that $m$ can be written as the difference of those consecutive prime numbers. Recently in [ W. D. Banks: Consecutive…

Number Theory · Mathematics 2024-07-02 Sayan Goswami

In the present work, we generalize the setting of dimers with potential gain and loss which have been extensively considered recently in $\mathcal{P T}$-symmetric contexts. We consider a pair of waveguides which are evanescently coupled but…

Pattern Formation and Solitons · Physics 2015-06-19 H. Xu , P. G. Kevrekidis , A. Saxena

We show by a constructive proof that in all aperiodic dynamical system, for all sequences $(a_n)_{n\in\N}\subset\R_+$ such that $a_n\nearrow\infty$ and $\frac{a_n}{n}\to 0$ as $n\to\infty$, there exists a set $A\in\A$ having the property…

Dynamical Systems · Mathematics 2009-11-05 Olivier Durieu , Dalibor Volny

In this paper we study some additive properties of subsets of the set $\nats$ of positive integers: A subset $A$ of $\nats$ is called {\it $k$-summable} (where $k\in\ben$) if $A$ contains $\textstyle \big{\sum_{n\in F}x_n | \emp\neq…

Combinatorics · Mathematics 2013-03-05 Michelangelo Bucci , Neil Hindman , Svetlana Puzynina , Luca Q. Zamboni

We address highly dynamic distributed systems modeled by time-varying graphs (TVGs). We interest in proof of impossibility results that often use informal arguments about convergence. First, we provide a distance among TVGs to define…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-12-19 Nicolas Braud-Santoni , Swan Dubois , Mohamed-Hamza Kaaouachi , Franck Petit

We show that for a non-trivial transitive dynamical system, it has a dense Mycielski invariant strongly scrambled set if and only if it has a fixed point, and it has a dense Mycielski invariant $\delta$-scrambled set for some $\delta>0$ if…

Dynamical Systems · Mathematics 2016-06-01 Magdalena Foryś , Wen Huang , Jian Li , Piotr Oprocha

We demonstrate a set A and a value of s for which the sequence of N-point discrete minimal Riesz s-energy configurations on A does not have an asymptotic distribution in the weak-star sense as N tends to infinity.

Classical Analysis and ODEs · Mathematics 2011-09-21 Matthew T. Calef

We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…

Combinatorics · Mathematics 2025-09-05 G. Conant , C. Terry

In this paper we consider dynamical systems generated by $(3,2)$-rational functions on the field of $p$-adic complex numbers. Each such function has three fixed points. We show that Siegel disks of the dynamical system may either coincide…

Dynamical Systems · Mathematics 2019-09-04 I. A. Sattarov

We prove that if an involution in a ring is the sum of an idempotent and a nilpotent then the idempotent in this decomposition must be 1. As a consequence, we completely characterize weakly nil-clean rings introduced recently in [Breaz,…

Rings and Algebras · Mathematics 2017-10-03 Janez Šter

In this paper, we consider higher regularity of a weak solution $({\bf u},p)$ to stationary Stokes systems with variable coefficients. Under the assumptions that coefficients and data are piecewise $C^{s,\delta}$ in a bounded domain…

Analysis of PDEs · Mathematics 2023-09-14 Hongjie Dong , Haigang Li , Longjuan Xu

Let $d\in\mathbb{Z}$ and $p_i$ be an integral polynomial with $p_i(0)=0,1\leq i\leq d$. It is shown that if $S$ is thickly syndetic in $\mathbb{Z}$, then $\{(m,n)\in\mathbb{Z}^2:m+p_i(n),m+p_2(n),\ldots,m+p_d(n)\in S\}$ is thickly syndetic…

Dynamical Systems · Mathematics 2023-04-07 Qinqi Wu

We examine the question whether random set attractors for continuous-time random dynamical systems on a connected state space are connected. In the deterministic case, these attractors are known to be connected. In the probabilistic setup,…

Dynamical Systems · Mathematics 2017-09-22 Michael Scheutzow , Isabell Vorkastner

We prove a quantitative partial result in support of the Dynamical Mordell-Lang Conjecture (also known as the DML conjecture) in positive characteristic. More precisely, we show the following: given a field $K$ of characteristic $p$, given…

Number Theory · Mathematics 2020-12-29 Dragos Ghioca , Alina Ostafe , Sina Saleh , Igor E. Shparlinski

For a commutative non-autonomous dynamical system we show that topological transitivity of the non-autonomous system induced on probability measures (hyperspaces) is equivalent to the weak mixing of the induced systems. Several counter…

Dynamical Systems · Mathematics 2019-09-05 Mohammad Salman , Ruchi Das

A dynamical system of points moving along the edges of a graph could be considered as a geometrical discrete dynamical system or as a discrete version of a quantum graph with localized wave packets. We study the set of such systems over…

Discrete Mathematics · Computer Science 2022-01-11 Leonid W. Dworzanski

In real-world networks the interactions between network elements are inherently time-delayed. These time-delays can not only slow the network but can have a destabilizing effect on the network's dynamics leading to poor performance. The…

Optimization and Control · Mathematics 2024-09-23 David Reber , Benjamin Webb

Consider an invertible measure-preserving transformation of a probability space. A finite partition of the space is called weakly independent if there are infinitely many images of this partition under powers of the transformation that are…

Dynamical Systems · Mathematics 2007-06-13 Boris Begun , Andres del Junco

Sum-networks are networks where all the terminals demand the sum of the symbols generated at the sources. It has been shown that for any finite set/co-finite set of prime numbers, there exists a sum-network which has a vector linear…

Information Theory · Computer Science 2016-10-27 Niladri Das , Brijesh Kumar Rai