Related papers: A note on the run length function for intermittenc…
We study periodic billiard trajectories on a compact Riemannian manifold with boundary, by applying Morse theory to Lagrangian action functionals on the loop space of the manifold. Based on the approximation method due to Benci-Giannoni, we…
We study the problem of extending an order-preserving real-valued Lipschitz map defined on a subset of a partially ordered metric space without increasing its Lipschitz constant and preserving its monotonicity. We show that a certain type…
We prove strong statistical stability of a large class of one-dimensional maps which may have an arbitrary finite number of discontinuities and of non-degenerate critical points and/or singular points with infinite derivative, and satisfy…
In [1] it is shown that recurrent neural networks (RNNs) can learn - in a metric entropy optimal manner - discrete time, linear time-invariant (LTI) systems. This is effected by comparing the number of bits needed to encode the…
We investigate gaps of $n$-term arithmetic progressions $x, x+y, \ldots, x+(n-1)y$ inside a positive measure subset $A$ of the unit cube $[0,1]^d$. If lengths of their gaps $y$ are evaluated in the $\ell^p$-norm for any $p$ other than $1,…
In this note we prove a new result about (finite) multiplier sequences, i.e. linear operators acting diagonally in the standard monomial basis of R[x] and sending polynomials with all real roots to polynomials with all real roots. Namely,…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…
Enumerating minimal dominating sets with polynomial delay in bipartite graphs is a long-standing open problem. To date, even the subcase of chordal bipartite graphs is open, with the best known algorithm due to Golovach, Heggernes, Kant\'e,…
We propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage…
The interval numbers is the set of compact intervals of $\mathbb{R}$ with addition and multiplication operation, which are very useful for solving calculations where there are intervals of error or uncertainty, however, it lacks an…
We consider perturbations of interval maps with indifferent fixed points, which we refer to as wobbly interval intermittent maps, for which stable laws for general H\"older observables fail. We obtain limit laws for such maps and H\"older…
For a word $\pi$ and integer $i$, we define $L^i(\pi)$ to be the length of the longest subsequence of the form $i(i+1)\cdots j$, and we let $L(\pi):=\max_i L^i(\pi)$. In this paper we estimate the expected values of $L^1(\pi)$ and $L(\pi)$…
In this paper, we study the stability result of a well-known theorem of Bondy. We prove that for any 2-connected non-hamiltonian graph, if every vertex except for at most one vertex has degree at least $k$, then it contains a cycle of…
We present a novel bit-parallel representation, based on the run-length encoding, of the nondeterministic KMP and suffix automata for a string $P$ with at least two distinct symbols. Our method is targeted to the case of long strings over…
We shall study degree-monotone paths in graphs, a problem inspired by the celebrated theorem of Erd{\H{o}}s-Szekeres concerning the longest monotone subsequence of a given sequence of numbers. A path P in a graph G is said to be a degree…
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…
We present a complete characterization of the asymptotic behaviour of a correlated Bernoulli sequence { which depends on the parameter $\theta \in [0,1]$. A martingale theory based approach will allow} us to prove versions of the law of…
Motivated by the problem of enumerating all tree decompositions of a graph, we consider in this article the problem of listing all the minimal chordal completions of a graph. In \cite{carmeli2020} (\textsc{Pods 2017}) Carmeli \emph{et al.}…
Explicit formulas are obtained for the number of periodic points and maximum tail length of split polynomial maps over finite fields for affine and projective space. This work includes a detailed analysis of the structure of the directed…
The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…