Related papers: The Cyclic Sieving Phenomenon for non-crossing for…

We consider an ergodic process on finitely many states, with positive entropy. Our first main result asserts that the distribution function of the normalized waiting time for the first visit to a small (i.e., over a long block) cylinder set…

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…

The uncertainty of multidimensional shift spaces draws attracted attention of researchers. For example, the emptiness problem is undecidable; there exist aperiodic shifts of finite type; there is a nonempty shift of finite type exhibiting…

A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…

We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.

We use subgroup distortion to determine the rate of escape of a simple random walk on a class of polycyclic groups, and we show that the rate of escape is invariant under changes of generating set for these groups. For metabelian groups, we…

We prove several new instances of the cyclic sieving phenomenon (CSP) on Catalan objects of type A and type B. Moreover, we refine many of the known instances of the CSP on Catalan objects. For example, we consider triangulations refined by…

We consider so-called simple families of labelled trees, which contain, e.g., ordered, unordered, binary and cyclic labelled trees as special instances, and study the global and local behaviour of the number of inversions. In particular we…

The recent years have seen interest into the possibility for (classical as well as quantum) causal structures that, while remaining logically consistent, feature a cyclic causal order between events, opening intriguing possibilities for new…

Given a solution to a recursive distributional equation, a natural (and non-trivial) question is whether the corresponding recursive tree process is endogenous. That is, whether the random environment almost surely defines the tree process.…

The forest of mutations associated to a multitype branching forest is obtained by merging together all vertices of its clusters and by preserving connections between them. We first show that the forest of mutations of any mulitype branching…

Consider a growing system of random walks on the 3,2-alternating tree, where generations of nodes alternate between having two and three children. Any time a particle lands on a node which has not been visited previously, a new particle is…

We prove the rather counterintuitive result that there exist finite transitive graphs H and integers k such that the Free Uniform Spanning Forest in the direct product of the k-regular tree and H has infinitely many trees almost surely.…

We propose a simple criterion to know if an abelian variety $A$ defined over a finite field $\mathbb{F}_q$ is cyclic, i.e., it has a cyclic group of rational points; this criterion is based on the endomorphism ring End$_{\mathbb{F}_q}(A)$.…

Given a bridgeless graph G, the well-known cycle double cover conjecture posits that there is a list of cycles of G, such that every edge appears in exactly two cycles. In this paper, we prove the cycle double cover conjecture. More…

We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a…

In this paper we investigate a new class of operators called weighted shifts on directed trees introduced recently in [Z. J. Jablonski, I. B. Jung and J. Stochel, A Non-hyponormal Operator Generating Stieltjes Moment Sequences, J. Funct.…

In this paper, a proof of the cycle double cover conjecture is presented. The cycle double cover conjecture purports that if a graph is bridgeless, then there exists a list of cycles in the graph such that every edge in the graph appears in…

Continuing the investigation for the number of crossing limit cycles of nonsmooth Li\'enard systems in [Nonlinearity 21(2008), 2121-2142] for the case of a unique equilibrium, in this paper we consider the case of any number of equilibria.…

We study properties of !-limit sets of multivalued semiflows like chain recurrence or the existence of cyclic chains. First, we prove that under certain conditions the omega-limit set of a trajectory is chain recurrent, applying this result…