Related papers: Birecurrent sets
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…
For every non-trivial finite abelian group $A$, we exhibit a bireversible automaton generating the lamplighter group $A \wr \mathbb{Z}$.
The Khintchine recurrence theorem asserts that on a measure preserving system, for every set $A$ and $\varepsilon>0$, we have $\mu(A\cap T^{-n}A)\geq \mu(A)^2-\varepsilon$ for infinitely many $n\in \mathbb{N}$. We show that there are…
We show that any open set in $\R^n$ is a union of an ascending sequence of bounded open sets with analytic boundary. This is just a technical result, which is probably known. We believe, however, that it can be useful for studing BVPs on…
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…
A recurrent neural network with noisy input is studied analytically, on the basis of a Discrete Time Master Equation. The latter is derived from a biologically realizable learning rule for the weights of the connections. In a numerical…
The present paper shows that the bounded control set of a linear system on a connected Lie group $G$ contains all the bounded orbits of the system. As a consequence, its closure is the continuous image of the cartesian product of the set of…
This paper considers discrete-time linear systems with bounded additive disturbances, and studies the convergence properties of the backward reachable sets of robust controlled invariant sets (RCIS). Under a simple condition, we prove that…
Recurrent connectivity in the visual cortex is believed to aid object recognition for challenging conditions such as occlusion. Here we investigate if and how artificial neural networks also benefit from recurrence. We compare architectures…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
A suffixient set is a novel combinatorial object that captures the essential information of repetitive strings in a way that, provided with a random access mechanism, supports various forms of pattern matching. In this paper, we study the…
We show that a persistence module (for a totally ordered indexing set) consisting of finite-dimensional vector spaces is a direct sum of interval modules. The result extends to persistence modules with the descending chain condition on…
The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive function {\psi} such that for every partial recursive function…
We study non-recurrence sets for weakly mixing dynamical systems by using linear dynamical systems. These are systems consisting of a bounded linear operator acting on a separable complex Banach space X, which becomes a probability space…
Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
In this paper we study a one-parameter family of attractive reversible nearest particle system on a finite interval. As the length of the interval increases, the time that the nearest particle system first hits the empty set increases in…
A subset $U$ of a set $S$ with a binary operation is called {\it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of…
The paper presents some new results on Z-related sets obtained by computational methods. We give a complete enumeration of all Z-related sets in $\mathbb{Z}_{N}$ for small $N$. Furthermore, we establish that there is a reasonable…