Related papers: Sharkovsky's Ordering in the Mandelbrot Set
We prove a discreteness result for the possible orders of harmonic maps from surfaces to Euclidean buildings; in particular for a building of type $W$ the order is of the form $\frac mk$ where $k$ divides $|W|$. This generalizes, in the…
In this article, we study the behaviour of discrete one-dimensional dynamical systems associated to functions on finite sets. We formalise the global orbit pattern formed by all the periodic orbits (gop) as the ordered set of periods when…
Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…
It is well known that the mathematically accurate description of ordering and related symmetry breaking in statistical systems requires to consider the thermodynamic limit. But the order does not appear from nowhere, and yet before the…
This paper considers a Markovian model of a limit order book where time-dependent rates are allowed. With the objective of understanding the mechanisms through which a microscopic model of an orderbook can converge to more general diffusion…
We continue our study of orderings on Bratteli diagrams started in previous work, joint with Jan Kwiatkowski, where Bratteli diagrams of finite rank were considered. We extend the notions of languages, permutations (called correspondences…
In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of…
Identification of fractional order systems is considered from an algebraic point of view. It allows for a simultaneous estimation of model parameters and fractional (or integer) orders from input and output data. It is exact in that no…
A poset $P= (X, \prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in $P$ if and only if $I_x$ lies completely to the left of $I_y$. Such orders are called \emph{interval…
Using the ordered analogue of Farley-Sabalka's discrete gradient field on the configuration space of a graph, we unravel a levelwise behavior of the generators of the pure braid group on a tree. This allows us to generalize Farber's…
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…
Recently, Yakubovich [Opuscula Math. 26 (2006) 161--172] and Passian et al. [J. Math. Anal. Appl. doi:10.1016/j.jmaa.2009.06.067] have presented alternative proofs of an orthogonality relation obeyed by the Macdonald functions of imaginary…
It is proposed that the observation of orbital ordering in manganite materials should be possible at the L_II and L_III edges of manganese using X-ray resonant scattering. If performed, dipole selection rules would make the measurements…
For a given set of points $U$ on a sphere $S$, the order $k$ spherical Voronoi diagram $SV_k(U)$ decomposes the surface of $S$ into regions whose points have the same $k$ nearest points of $U$. Hyeon-Suk Na, Chung-Nim Lee, and Otfried…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with…
This study examines a modified Kantorovich approach applied to generalized sampling series. The paper establishes that the approximation order to a function using these modified operators is atleast as good as that achieved by classical…
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we…
We study the limiting object of a sequence of Markov chains analogous to the limits of graphs, hypergraphs, and other objects which have been studied. Following a suggestion of Aldous, we assign to a sequence of finite Markov chains with…
This paper describes a predictive control method to search for unstable periodic orbits of the generalized tent map. The invariant set containing periodic orbits is a repelling set with a complicated Cantor-like structure. Therefore, a…
As a directed analog of Sidorenko's conjecture in extremal graph theory, Fox, Himwich, Zhou, and the second author defined an oriented graph $H$ to be tournament Sidorenko (anti-Sidorenko) if the random tournament asymptotically minimizes…