Related papers: Uniqueness vs non-uniqueness in complete connectio…

The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying that $\limsup_n C(x|n)$ equals $C^{0'}(x)$. Then we use the…

We find a new structural feature of equilibrium complex random networks without multiple and self-connections. We show that if the number of connections is sufficiently high, these networks contain a core of highly interconnected vertices.…

Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…

We consider an evolving random discrete tree model called Preferential Attachment with Vertex Death, as introduced by Deijfen. Initialised with an alive root labelled $1$, at each step $n\geq1$ either a new vertex with label $n+1$ is…

We study recurrence, and multiple recurrence, properties along the $k$-th powers of a given set of integers. We show that the property of recurrence for some given values of $k$ does not give any constraint on the recurrence for the other…

In this paper, we study the existence of perfect matchings and Hamiltonian cycles in the preferential attachment model. In this model, vertices are added to the graph one by one, and each time a new vertex is created it establishes a…

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…

We give an example, which demonstrates that in the situation of the Picard-Lindel\"of theorem, the Lipschitz condition on the right hand side $f(x,y)$ with respect to $y$, cannot be replaced by Lipschitz continuity in $y$ for every $x$. We…

Let $(m, n, k)$ be a tuple of integers with the property that if $i \leq k$, then $m + i$ and $n + i$ have the same radical. Using a result on the abc Conjecture, we bound $k$ from above, improving a result of Balasubramanian, Shorey, and…

The paper studies the higher-order absolute differences taken from progressive terms of time-homogenous binary Markov chains. Two theorems presented are the limiting theorems for these differences, when their order $k$ converges to…

We give an elementary proof of a monotone selection principle which allows to pass from increasing nets to increasing sequences in the Hermitian part of a $\sigma$-finite von Neumann algebra. This is to be seen as a ``monotone version'' of…

Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…

Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…

May's classical theorem states that in a single-winner choose-one voting system with just two candidates, majority rule is the only social choice function satisfying anonimity, neutrality and positive responsiveness axiom. Anonimity and…

The main scope of this article is to define the concept of principal eigenvalue for fully non linear second order operators in bounded domains that are elliptic and homogenous. In particular we prove maximum and comparison principle, Holder…

Various controllability conditions have been obtained by researchers for heterogeneous networked systems with linear dynamics. However, the literature for nonlinear, heterogeneous networked systems is comparatively less. In this paper we…

We improve and subsume the conditions of Johansson and \"Oberg [18] and Berbee [2] for uniqueness of a g-measure, i.e., a stationary distribution for chains with complete connections. In addition, we prove that these unique g-measures have…

A repeated claim in linguistics is that the majority of linguistic utterances are unique. For example, Pinker (1994: 10), summarizing an argument by Noam Chomsky, states that "virtually every sentence that a person utters or understands is…

We represent the generalized Collatz function with the recursive ruler function r(2n) = r(n) + 1 and r(2n + 1) = 1. We generate even-only and odd-only Collatz subsequences that contain significantly fewer elements term by term, to 2 and 1,…