Related papers: Discrepancy of generalized $LS$-sequences
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…
It is known that there is a constant $c > 0$ such that for every sequence $x_1, x_2, \ldots$ in $[0,1)$ we have for the star discrepancy $D_N^*$ of the first $N$ elements of the sequence that $N D_N^* \ge c \cdot \log N$ holds for…
Let $L_{a,b}$ be a line in the Euclidean plane with slope $a$ and intercept $b$. The dimension spectrum $\spec(L_{a,b})$ is the set of all effective dimensions of individual points on $L_{a,b}$. The dimension spectrum conjecture states…
The notion of a $\delta$-generic sequence of P-points is introduced in this paper. It is proved assuming the Continuum Hypothesis that for each $\delta < {\omega}_{2}$, any $\delta$-generic sequence of P-points can be extended to an…
Common intervals have been defined as a modelisation of gene clusters in genomes represented either as permutations or as sequences. Whereas optimal algorithms for finding common intervals in permutations exist even for an arbitrary number…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
We consider the general problem of the Longest Common Subsequence (LCS) on weighted sequences. Weighted sequences are an extension of classical strings, where in each position every letter of the alphabet may occur with some probability.…
This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…
Measuring the distance between data points is fundamental to many statistical techniques, such as dimension reduction or clustering algorithms. However, improvements in data collection technologies has led to a growing versatility of…
This paper considers estimation of a univariate density from an individual numerical sequence. It is assumed that (i) the limiting relative frequencies of the numerical sequence are governed by an unknown density, and (ii) there is a known…
Assuming the generalized Lindel\"{o}f hypothesis (GLH), a weak version of the generalized Ramanujan conjecture and a Rankin--Selberg type partial sum estimate, we establish the normality of the sum of coefficients of a general $L$-function…
In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group $G$, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided.…
New examples of Cameron-Liebler line classes in $\mathrm{PG}(3,q)$ are given with parameter $\frac{1}{2}(q^2 -1)$. These examples have been constructed for many odd values of $q$ using a computer search, by forming a union of line orbits…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
Scientists aim to extract simplicity from observations of the complex world. An important component of this process is the exploration of data in search of trends. In practice, however, this tends to be more of an art than a science. Among…
Consider two forecasters, each making a single prediction for a sequence of events over time. We ask a relatively basic question: how might we compare these forecasters, either online or post-hoc, while avoiding unverifiable assumptions on…
In this paper we develop a generalized likelihood ratio scan method (GLRSM) for multiple change-points inference in piecewise stationary time series, which estimates the number and positions of change-points and provides a confidence…
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality, monotonicity and so on). For scalability, we require fast…