Related papers: Degenerated third order linear recurrences

Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…

The famous result of Landesman and Lazer [10] dealt with resonance at a simple eigenvalue. Soon after publication of [10], Williams [14] gave an extension for repeated eigenvalues. The conditions in Williams [14] are rather restrictive, and…

We derive some simple relations that demonstrate how the posterior convergence rate is related to two driving factors: a "penalized divergence" of the prior, which measures the ability of the prior distribution to propose a nonnegligible…

The main goal of this paper is the study of two kinds of nonlinear problems depending on parameters in unbounded domains. Using a nonstandard variational approach, we first prove the existence of bounded solutions for nonlinear eigenvalue…

Serfozo (2009, Theorem 2.65) gives a useful central limit theorem for processes with regenerative increments. Unfortunately, there is a gap in the proof. We fill this gap, and at the same time we weaken the assumptions. Furthermore, we give…

We review how the monotone pattern compares to other patterns in terms of enumerative results on pattern avoiding permutations. We consider three natural definitions of pattern avoidance, give an overview of classic and recent formulas, and…

For $s=3,4$, we prove the existence of arbitrarily long sequences of consecutive integers none of which is a sum of $s$ nonnegative $s$-th powers. More generally, we study the existence of gaps between the values $\leq N$ of diagonal forms…

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

In this paper, we study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed complementarity problem on the non-negative orthant. We…

We consider Rote words, which are infinite binary words with factor complexity $2n$. We prove that the repetition threshold for this class is $5/2$. Our technique is purely computational, using the Walnut theorem prover and a new technique…

Gibbons and Korach studied a fundamental problem in 1997: given an observed sequence of reads and writes of a multi-threaded program, does there exist an interleaving which is sequentially consistent? Apart from applications in testing…

Despite strong performance on a variety of tasks, neural sequence models trained with maximum likelihood have been shown to exhibit issues such as length bias and degenerate repetition. We study the related issue of receiving…

We consider entailment problems involving powerful constraint languages such as guarded existential rules, in which additional semantic restrictions are put on a set of distinguished relations. We consider restricting a relation to be…

We study the finitary satisfiability problem for first order logic with two variables and two binary relations, corresponding to the induced successor relations of two finite linear orders. We show that the problem is decidable in NEXPTIME.

We deal with initial-boundary value problems for systems of conservation laws in one space dimension and we focus on the boundary Riemann problem. It is known that, in general, different viscous approximations provide different limits. In…

Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…

We give combinatorial descriptions of the terms occurring in continuants of general continued fractions that diverge to three limits. Equating these with the usual combinatorial descriptions due to Euler, Sylvester, and Minding induces…

We present a deterministic relationship between relative primes and twin primes in successively larger sequences of the natural numbers. This enables setting a finite lower limit on the occurrence of actual twin primes in an unbounded…

Let $(X,T,\mu,d)$ be a metric measure-preserving system. If $B(x,r_n(x))$ is a sequence of balls such that, for each $n$, the measure of $B(x,r_n(x))$ is constant, then we obtain a self-norming CLT for recurrence for systems satisfying a…

We establish some new Tur\'an's type inequalities for orthogonal polynomials defined by a three-term recurrence with monotonic coefficients. As a corollary we deduce asymptotic bounds on the extreme zeros of orthogonal polynomials with…