Related papers: Sharkovsky's Ordering in the Mandelbrot Set
In this paper we introduce the concept of sliding Shilnikov orbits for $3$D Filippov systems. In short, such an orbit is a piecewise smooth closed curve, composed by Filippov trajectories, which slides on the switching surface and connects…
For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by…
In this paper, we introduce the concepts of $\omega$-limit sets and pseudo orbits for a tree-shift defined on a Markov-Cayley tree, extending the results of tree-shifts defined on $d$-trees [5,6]. Firstly, we establish the relationships…
Let $G$ be an $n$-vertex connected graph. A cyclic base ordering of $G$ is a cyclic ordering of all edges such that every cyclically consecutive $n-1$ edges induce a spanning tree of $G$. In this project, we study cyclic base ordering of…
Some partial orderings which compare probability distributions with the expo- nential distribution, are found to be very useful to understand the phenomenon of ageing. Here, we introduce some new generalized partial orderings which de-…
The Minkowski product of unit quaternion sets is introduced and analyzed, motivated by the desire to characterize the overall variation of compounded spatial rotations that result from individual rotations subject to known uncertainties in…
For any continuous self-map of a compact metric space, we prove a saturation of distributionally scrambled Mycielski sets under a type of shadowing and the chain transitivity.
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…
We explore a generalization of the Markov numbers that is motivated by a specific generalized cluster algebra arising from an orbifold, in the sense of Chekhov and Shapiro. We give an explicit algorithm for computing these generalized…
Maximal Orders over an algebra are a generalization of the concept of a Dedekind domain. The definition given in Maximal Orders by Reiner, assumes that the field over which the algebra is defined is in the center of the order. Since we want…
This paper is dedicated to clarifying and introducing the correct application of Melnikov method in fractional dynamics. Attention to the complex dynamics of hyperbolic orbits and to fractional calculus can be, respectively, traced back to…
Let $B$ be the group of invertible upper-triangular complex $n\times n$ matrices, $\mathfrak{u}$ the space of upper-triangular complex matrices with zeroes on the diagonal and $\mathfrak{u}^*$ its dual space. The group $B$ acts on…
We characterise the respective semigroups of mappings that preserve, or that preserve or reverse orientation of a finite cycle, in terms of their actions on oriented triples and oriented quadruples. This leads to a proof that the latter…
The structure of hierarchical networks in biological and physical systems has long been characterized using the Horton-Strahler ordering scheme. The scheme assigns an integer order to each edge in the network based on the topology of…
In this paper, we study the Markovian Pandora's Box Problem, where decisions are governed by both order constraints and Markovianly correlated rewards, structured within a shared directed acyclic graph. To the best of our knowledge,…
A method for the semiclassical quantization of chaotic maps is proposed, which is based on harmonic inversion. The power of the technique is demonstrated for the baker's map as a prototype example of a chaotic map.
We present the first succinct distance oracles for (unweighted) interval graphs and related classes of graphs, using a novel succinct data structure for ordinal trees that supports the mapping between preorder (i.e., depth-first) ranks and…
We study the classical version of the 120-degree model. This is an attractive nearest-neighbor system in three dimensions with XY (rotor) spins and interaction such that only a particular projection of the spins gets coupled in each…
Stochastic orders are binary relations defined on probability distributions which capture intuitive notions like being larger or being more variable. This paper introduces stochastic ordering of interference distributions in large-scale…
Canonical orderings and their relatives such as st-numberings have been used as a key tool in algorithmic graph theory for the last decades. Recently, a unifying concept behind all these orders has been shown: they can be described by a…