اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAlmost everywhere balanced sequences of complexity $2n+1$
181
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study ternary sequences associated with a multidimensional continued fraction algorithm introduced by the first author. The algorithm is defined by two matrices and we show that it is measurably isomorphic to the shift on the set ${1,2}^mathbb{N}$ of directive sequences. For a given set $mathcal{C}$ of two substitutions, we show that there exists a $mathcal{C}$-adic sequence for every vector of letter frequencies or, equivalently, for every directive sequence. We show that their factor complexity is at most $2n+1$ and is $2n+1$ if and only if the letter frequencies are rationally independent if and only if the $mathcal{C}$-adic representation is primitive. It turns out that in this case, the sequences are dendric. We also prove that $mu$-almost every $mathcal{C}$-adic sequence is balanced, where $mu$ is any shift-invariant ergodic Borel probability measure on ${1,2}^mathbb{N}$ giving a positive measure to the cylinder $[12121212]$. We also prove that the second Lyapunov exponent of the matrix cocycle associated with the measure $mu$ is negative.
قيم البحث
اقرأ أيضاً
We study aperiodic balanced sequences over finite alphabets. A sequence v of this type is fully characterised by a Sturmian sequence u and two constant gap sequences y and y. We show that the language of v is eventually dendric and we focus on return
words to its factors. We deduce a method computing critical exponent and asymptotic critical exponent of balanced sequences provided the associated Sturmian sequence u has a quadratic slope. The method is based on looking for the shortest return words to bispecial factors in v. We illustrate our method on several examples, in particular we confirm a conjecture of Rampersad, Shallit and Vandomme that two specific sequences have the least critical exponent among all balanced sequences over 9- resp. 10-letter alphabets.
We study the differential properties of higher-order statistical probabilistic programs with recursion and conditioning. Our starting point is an open problem posed by Hongseok Yang: what class of statistical probabilistic programs have densities tha
t are differentiable almost everywhere? To formalise the problem, we consider Statistical PCF (SPCF), an extension of call-by-value PCF with real numbers, and constructs for sampling and conditioning. We give SPCF a sampling-style operational semantics a la Borgstrom et al., and study the associated weight (commonly referred to as the density) function and value function on the set of possible execution traces. Our main result is that almost-surely terminating SPCF programs, generated from a set of primitive functions (e.g. the set of analytic functions) satisfying mild closure properties, have weight and value functions that are almost-everywhere differentiable. We use a stochastic form of symbolic execution to reason about almost-everywhere differentiability. A by-product of this work is that almost-surely terminating deterministic (S)PCF programs with real parameters denote functions that are almost-everywhere differentiable. Our result is of practical interest, as almost-everywhere differentiability of the density function is required to hold for the correctness of major gradient-based inference algorithms.
The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of period $4N$ w
ith optimal autocorrelation values have been constructed by Tang and Gong based on interleaving certain kinds of sequences of period $N$. In this paper, we use the interleaving technique to construct a binary sequence with the optimal autocorrelation of period $2N$, then we calculate its autocorrelation values and its distribution, and give a lower bound of linear complexity. Results show that these sequences have low autocorrelation and the linear complexity satisfies the requirements of cryptography.
Let $L$ be a non-negative self-adjoint operator acting on the space $L^2(X)$, where $X$ is a metric measure space. Let ${ L}=int_0^{infty} lambda dE_{ L}({lambda})$ be the spectral resolution of ${ L}$ and $S_R({ L})f=int_0^R dE_{ L}(lambda) f$ denot
e the spherical partial sums in terms of the resolution of ${ L}$. In this article we give a sufficient condition on $L$ such that $$ lim_{Rrightarrow infty} S_R({ L})f(x) =f(x), {rm a.e.} $$ for any $f$ such that ${rm log } (2+L) fin L^2(X)$. These results are applicable to large classes of operators including Dirichlet operators on smooth bounded domains, the Hermite operator and Schrodinger operators with inverse square potentials.
We investigate maximal exceptional sequences of line bundles on (P^1)^3, i.e. those consisting of 2^r elements. For r=3 we show that they are always full, meaning that they generate the derived category. Everything is done in the discrete setup: Exce
ptional sequences of line bundles appear as special finite subsets s of the Picard group Z^r of (P^1)^r, and the question of generation is understood like a process of contamination of the whole Z^r out of an infectious seed s.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
