Related papers: Discrepancy of generalized $LS$-sequences

A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…

In this paper we look for the existence of large linear and algebraic structures of sequences of measurable functions with different modes of convergence. Concretely, the algebraic size of the family of sequences that are convergent in…

Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied by others, most notably by Dress, who gave them this name. Subsequently, it was found that tight-spans could be defined for more general maps, such…

We discuss the ACC conjecture and the LSC conjecture for minimal log discrepancies of generalized pairs. We prove that some known results on these two conjectures for usual pairs are still valid for generalized pairs. We also discuss the…

We give improved lower bounds for the number of solutions of some $S$-unit equations over the integers, by counting the solutions of some associated linear equations as the coefficients in those equations vary over sparse sets. This method…

We show that a discrete sequence $\Lambda$ of the complex plane is the union of $n$ interpolating sequences for the H\"ormander algebras $A_p$ if and only if the trace of $A_p$ on $\Lambda$ coincides with the space of functions on $\Lambda$…

Motivated by the study of the distribution of zeros of generalized Bessel-type functions, the principal goal of this paper is to identify new research directions in the theory of multiplier sequences. The investigations focus on multiplier…

Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…

For a sequence $x \in l_1 \setminus c_{00}$, one can consider the achievement set $E(x)$ of all subsums of series $\sum_{n=1}^{\infty} x(n)$. It is known that $E(x)$ is one of the following types of sets: * finite union of closed intervals,…

{\bf Abstract.} Considered is the distribution of the cross correlation between $m$-sequences of length $2^m-1$, where $m$ is even, and $m$-sequences of shorter length $2^{m/2}-1$. The infinite family of pairs of $m$-sequences with…

This is the first in a set of three papers providing an introduction to generalised Cesaro convergence. We start with traditional Cesaro methods for extending classical convergence and further generalise these to allow the calculation of…

We give an improved lower bound for the $L_2$-discrepancy of finite point sets in the unit square.

We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-$s$ {\em double DS} sequences, for all $s$, sharp bounds on sequences…

In this paper we provide explicit constructions of digital sequences over the finite field of order 2 in the infinite dimensional unit cube whose first $N$ points projected onto the first $s$ coordinates have $\mathcal{L}_q$ discrepancy…

A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…

Finding the longest common subsequence in $k$-length substrings (LCS$k$) is a recently proposed problem motivated by computational biology. This is a generalization of the well-known LCS problem in which matching symbols from two sequences…

The second author studied arithmetic properties of a class of sequences that generalize the sequence of derangements. The aim of the following paper is to disprove two conjectures stated in \cite{miska}. The first conjecture regards the set…

This paper proposes a novel similarity measure for clustering sequential data. We first construct a common state-space by training a single probabilistic model with all the sequences in order to get a unified representation for the dataset.…

This paper addresses a fundamental but largely unexplored challenge in sequential changepoint analysis: conducting inference following a detected change. We develop a very general framework to construct confidence sets for the unknown…

We develop a formal framework for the behavioral comparison of linear systems across different time domains. We accomplish this by introducing the notion of system interpolation, which determines whether the input-state trajectories of a…