Related papers: Non-dominating sequences of vectors using only res…

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

The denominators $d_n$ of the harmonic number $1+\frac12+\frac13+\cdots+\frac1n$ do not increase monotonically with~$n$. It is conjectured that $d_n=D_n={\rm LCM}(1,2,\ldots,n)$ infinitely often. For an odd prime $p$, the set…

We present a randomized approximation scheme for the permanent of a matrix with nonnegative entries. Our scheme extends a recursive rejection sampling method of Huber and Law (SODA 2008) by replacing the upper bound for the permanent with a…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $\gamma(D)$ the domination number of the incidence (Levy) graph of $D$. We obtain a number of results…

In this paper we consider the model of $n$ non-intersecting squared Bessel processes with parameter $\alpha$, in the confluent case where all particles start, at time $t=0$, at the same positive value $x=a$, remain positive, and end, at…

We consider a special case of Dickson's lemma: for any two functions $f,g$ on the natural numbers there are two numbers $i<j$ such that both $f$ and $g$ weakly increase on them, i.e., $f_i\le f_j$ and $g_i \le g_j$. By a combinatorial…

Dyson's integration theorem is widely used in the computation of eigenvalue correlation functions in Random Matrix Theory. Here we focus on the variant of the theorem for determinants, relevant for the unitary ensembles with Dyson index…

We study a) the limit of the ratio of two consecutive terms in such a sequence and b) the limit of the ratio of two terms in which one has a lag equal to 2. In the general case limit a) does not exist but we have two limiting values…

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Dyson's model is a one-dimensional system of Brownian motions with long-range repulsive forces acting between any pair of particles with strength proportional to the inverse of distances with proportionality constant $\beta/2$. We give…

Given a one-dimensional shift $X$, let $|F_X(n)|$ be the number of follower sets of words of length $n$ in $X$, and $|P_X(n)|$ be the number of predecessor sets of words of length $n$ in $X$. We call the sequence $\{|F_X(n)|\}_{n \in…

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

Zeckendorf's Theorem states that every positive integer can be uniquely represented as a sum of non-adjacent Fibonacci numbers, indexed from $1, 2, 3, 5,\ldots$. This has been generalized by many authors, in particular to constant…

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

We consider a diffusion on a bounded domain, assuming that the system is irreducible inside the domain and that the diffusion has varying degree of degeneracy on the domain's boundary. The long-term statistical properties of typical…

Let ${X}_{k}=(x_{k1}, \cdots, x_{kp})', k=1,\cdots,n$, be a random sample of size $n$ coming from a $p$-dimensional population. For a fixed integer $m\geq 2$, consider a hypercubic random tensor $\mathbf{{T}}$ of $m$-th order and rank $n$…