Related papers: The Run Transform
Quantum resources exist in a hierarchy of multiple levels. At order zero, quantum states are transformed by linear maps (channels, or gates) in order to perform computations or simulate other states. At order one, gates and channels are…
We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
For any odd positive integer $x$, define $(x_n)_{n\geqslant 0} $ and $(a_n )_{n\geqslant 1} $ by setting $x_{0}=x, \,\, x_n =\cfrac{3x_{n-1} +1}{2^{a_n }}$ such that all $x_n $ are odd. The 3x+1 problem asserts that there is an $x_n =1$ for…
We define impulse response sequence in the set of all linear recurring sequences satisfying a linear recurrence relation of order $r$. The generating function and expression of the impulse response sequence are presented. Some identities of…
We classify flips of buildings arising from non-degenerate unitary spaces of dimension at least 4 over finite fields of odd characteristic in terms of their action on the underlying vector space. We also construct certain geometries related…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…
Sequence models in reinforcement learning require task knowledge to estimate the task policy. This paper presents a hierarchical algorithm for learning a sequence model from demonstrations. The high-level mechanism guides the low-level…
Given an increasing process $(A_t)_{t\geq 0}$, we characterize the right-continuous non-decreasing functions $f: \R_+\to \R_+$ that map $A$ to a pure-jump process. As an example of application, we show for instance that functions with…
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
Many models such as Long Short Term Memory (LSTMs), Gated Recurrent Units (GRUs) and transformers have been developed to classify time series data with the assumption that events in a sequence are ordered. On the other hand, fewer models…
The authors propose a new variation of random walks called ladder chains $L(r,s,p)$. We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take $L(2,2,p)$ for instance, we find…
Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n…
The paper proposes a numerically stable recursive algorithm for the exact computation of the linear-chain conditional random field gradient. It operates as a forward algorithm over the log-domain expectation semiring and has the purpose of…
A sequence of non-negative integers is exactly realizable as the fixed point counts sequence of a dynamical system if and only if it gives rise to a sequence of non-negative orbit counts. This provides a simple realizability criterion based…
We define focus-method interfaces and some connections between such interfaces and instruction sequences, giving rise to instruction sequence components. We provide a flexible and practical notation for interfaces using an abstract datatype…
Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…