Related papers: Discrepancy of generalized $LS$-sequences
Recognizing subtle historical patterns is central to modeling and forecasting problems in time series analysis. Here we introduce and develop a new approach to quantify deviations in the underlying hidden generators of observed data…
A generic uniformly distributed sequence $(x_n)_{n \in \mathbb{N}}$ in $[0,1)$ possesses Poissonian pair correlations (PPC). Vice versa, it has been proven that a sequence with PPC is uniformly distributed. Grepstad and Larcher gave an…
The notion of $b$-regular sequences was generalized to abstract numeration systems by Maes and Rigo in 2002. Their definition is based on a notion of $\mathcal{S}$-kernel that extends that of $b$-kernel. However, this definition does not…
In [F. Xu, On the cohomology rings of small categories, J. Pure Appl. Algebra 212 (2008), 2555-2569], Xu constructs a LHS-spectral sequence for target regular extensions of small categories. We extend this construction to ext-groups and…
The Longest Common Subsequence (LCS) problem is a fundamental problem of sequence comparison. A natural approximation to this problem is a model in which every pairs of letters of two ``sequences'' are matched independently of the other…
For a set of mulitple sequences, their patterns,Longest Common Subsequences (LCS) and Shortest Common Supersequences (SCS) represent different aspects of these sequences profile, and they can all be used for biological sequence comparisons…
In this paper we extend a result of Levin, who proved a lower bound on the star discrepancy of generalized Halton sequences in positive integer bases, to rational bases.
We study the extreme $L_p$ discrepancy of infinite sequences in the $d$-dimensional unit cube, which uses arbitrary sub-intervals of the unit cube as test sets. This is in contrast to the classical star $L_p$ discrepancy, which uses…
Fixed point theorems are one of the many tools used to prove existence and uniqueness of differential equations. When the data involved contains products of distributions, some of these tools may not be useful. Thus rises the necessity to…
Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest common subsequences (LCS) of these strings when long blocks,…
Statistical inference based on divergence measures have a long history. Recently, Maji, Ghosh and Basu (2014) have introduced a general family of divergences called the logarithmic super divergence (LSD) family. This family acts as a…
The class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most general form by Niederreiter, are important examples of point sets and sequences that are commonly used in quasi-Monte Carlo algorithms for integration and…
In high-dimensional statistical inference, sparsity regularizations have shown advantages in consistency and convergence rates for coefficient estimation. We consider a generalized version of Sparse-Group Lasso which captures both…
We define sequence patterns of length $n$ and level $\ell$ to be equivalence classes of sequences that have $n$ elements from the set of $\ell$ integer symbols $\{1,2,\ldots,\ell\}$ with no restriction on repetition, where the equivalence…
In this paper we associate to any $LS$-sequence of partitions ${\rho_{L,S}^n}$ the corresponding $LS$-sequence of points ${\xi_{L,S}^n}$ obtained reordering the points of each partition with an explicit algorithm. The procedure begins with…
Given an increasing sequence of integers a(n), it is known (due to Weyl) that for almost all reals t, the fractional parts of the dilated sequence t*a(n) are uniformly distributed in the unit interval. Some effort has been made recently to…
We study the problem of constructing sequences $(x_n)_{n=1}^{\infty}$ on $[0,1]$ in such a way that $$ D_N^* = \sup_{0 \leq x \leq 1} \left| \frac{ \left\{1 \leq i \leq N: x_i \leq x \right\}}{N} - x \right|$$ is uniformly small. A result…
Somos 4 sequences are a family of sequences defined by a fourth-order quadratic recurrence relation with constant coefficients. For particular choices of the coefficients and the four initial data, such recurrences can yield sequences of…
Sequences whose terms are equal to the number of functions with specified properties are considered. Properties are based on the notion of derangements in a more general sense. Several sequences which generalize the standard notion of…
Regular sequences generalize the extensively studied automatic sequences. Let $S$ be an abstract numeration system. When the numeration language $L$ is prefix-closed and regular, a sequence is said to be $S$-regular if the module generated…