相关论文: Characterization of circular D0L systems

Circular-shift linear network coding (LNC) is a class of vector LNC with low encoding and decoding complexities, and with local encoding kernels chosen from cyclic permutation matrices. When $L$ is a prime with primitive root $2$, it was…

In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We…

In this paper, we will study the statistical behaviors of orbits. Firstly, we will show that for a dynamical systems have the shadowing property or almost specification property, the set of nonrecurrent points has full topological entropy.…

Let $D(\mu)$ denote a harmonically weighted Dirichlet space on the unit disc $\mathbb D$. We show that outer functions $f\in D(\mu)$ are cyclic in $D(\mu)$, whenever $\log f$ belongs to the Pick-Smirnov class $N^+(D(\mu))$. If $f$ has…

We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…

We consider classical dynamical properties of a particle in a constant gravitational force and making specular reflections with circular, elliptic or oval boundaries. The model and collision map are described and a detailed study of the…

Data replication is used in distributed systems to maintain up-to-date copies of shared data across multiple computers in a network. However, despite decades of research, algorithms for achieving consistency in replicated systems are still…

Let $G$ be a graph and let $\mathrm{cl}(G)$ be the number of distinct induced cycle lengths in $G$. We show that for $c,t\in \mathbb N$, every graph $G$ that does not contain an induced subgraph isomorphic to $K_{t+1}$ or $K_{t,t}$ and…

In this paper, we propose a discrete circular distribution obtained by extending the wrapped Poisson distribution. This new distribution, the Invariant Wrapped Poisson (IWP), enjoys numerous advantages: simple tractable density,…

Recently several authors studied the segregation of particles for a system composed of mono-dispersed inelastic spheres contained in a box divided by a wall in the middle. The system exhibited a symmetry breaking leading to an…

We give a complete list of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We derive some of the basic properties of these codes such as the cardinality and the minimum…

Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…

In this paper we consider a representative a priori unstable Hamiltonian system with 2+1/2 degrees of freedom, to which we apply the geometric mechanism for diffusion introduced in the paper Delshams et al., Mem. Amer. Math. Soc. 2006, and…

In this paper we show that, under certain generic conditions, billiards on ovals have only a finite number of periodic orbits, for each period, all non-degenerate and at least one of them is hyperbolic. Moreover, the invariant curves of two…

This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that…

It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…

The causal representation of multi-loop scattering amplitudes, obtained from the application of the loop-tree duality formalism, comprehensively elucidates, at integrand level, the behaviour of only physical singularities. This…

In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non-Hamiltonian cycle are contained in a cycle of length one greater. We disprove this conjecture by constructing…

This paper describes the celebrated aperiodic hat tiling by Smith et al. [Comb. Theory 8 (2024), 6] as generated by an overlapping iterated function system. We briefly introduce and study infinite sequences of iterated function systems that…

Every simple drawing of a graph in the plane naturally induces a rotation system, but it is easy to exhibit a rotation system that does not arise from a simple drawing in the plane. We extend this to all surfaces: for every fixed surface…