Related papers: On Dold condition and fail factor of linear recurr…

In this paper, we establish an almost sure central limit theorem for a general random sequence under a strong approximation condition. Additionally, we derive the law of the iterated logarithm for the center of mass corresponding to a…

We establish optimal convergence rates up to a log-factor for a class of deep neural networks in a classification setting under a restraint sometimes referred to as the Tsybakov noise condition. We construct classifiers in a general setting…

Dependent Object Types (DOT) is a calculus with path dependent types, intersection types, and object self-references, which serves as the core calculus of Scala 3. Although the calculus has been proven sound, it remains open whether type…

In this note, we present explicit conditions for symmetric gradient type Dirichlet forms to be recurrent. This type of Dirichlet form is typically strongly local and hence associated to a diffusion. We consider the one dimensional case and…

Let $a_1 = 1$ and, for $n > 1$, $a_n = a_{n-1} + a_{\left \lfloor \frac{n}{2} \right \rfloor}$. In this paper we will look at congruence properties and the growth rate of this sequence. First we will show that if $x \in \{1, 2, 3, 5, 6, 7…

The modularity of a graph is a parameter that measures its community structure; the higher its value (between $0$ and $1$), the more clustered the graph is. In this paper we show that the modularity of a random $3$-regular graph is at least…

We give an extension of a criterion of van der Corput on uniform distribution of sequences. Namely, we prove that a sequence $x_n$ is uniformly distributed modulo 1 if it is weakly monotonic and satisfies the conditions $\Delta^2x_n\to…

Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…

We construct maximal green sequences of maximal length for any affine quiver of type $A$. We determine which sets of modules (equivalently $c$-vectors) can occur in such sequences and, among these, which are given by a linear stability…

Fix a sequence c=(c_1,...,c_n) of non-negative integers with sum n-1. We say a rooted tree T has child sequence c if it is possible to order the nodes of T as v_1,...,v_n so that for each 1 <= i <= n, v_i has exactly c_i children. Let T be…

A sequence $(x_{n})$ of points in a topological group is called $\Delta$-quasi-slowly oscillating if $(\Delta x_{n})$ is quasi-slowly oscillating, and is called quasi-slowly oscillating if $(\Delta x_{n})$ is slowly oscillating. A function…

Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria - linearizability with…

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Suppose that $\mathcal{X}$ is a sequentially complete Hausdorff locally convex space over a scalar field $\mathbb{K}$, $V$ is a bounded subset of $\mathcal{X}$, $(a_n)_{n\ge 0}$ is a sequence in $\mathbb{K}\setminus\{0\}$ with the property\…

This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied in the past, the problem of designing efficient algorithms…

We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$. The…

We analyze the asymptotic behavior of sequences of random variables defined by an initial condition, a stationary and ergodic sequence of random matrices, and an induction formula involving multiplication is the so-called max-plus algebra.…

The condition number of a differentiable convex function, namely the ratio of its smoothness to strong convexity constants, is closely tied to fundamental properties of the function. In particular, the condition number of a quadratic convex…

Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…