Sharp conditions for the convergence of greedy expansions with prescribed coefficients

Greedy expansions with prescribed coefficients were introduced by V. N. Temlyakov in a general case of Banach spaces. In contrast to Fourier series expansions, in greedy expansions with prescribed coefficients, a sequence of coefficients { c n } n = 1 ∞ {\left\{{c}_{n}\right\}}_{n=1}^{\infty } is fixed in advance and does not depend on an expanded element. During the expansion, only expanding elements are constructed (or, more precisely, selected from a predefined set – a dictionary). For symmetric dictionaries, V. N. Temlyakov obtained conditions on a sequence of coefficients sufficient for a convergence of a greedy expansion with these coefficients to an expanded element. In case of a Hilbert space these conditions take the form ∑ n = 1 ∞ c n = ∞ {\sum }_{n=1}^{\infty }{c}_{n}=\infty and ∑ n = 1 ∞ c n 2 < ∞ {\sum }_{n=1}^{\infty }{c}_{n}^{2}\lt \infty . In this paper, we study a possibility of relaxing the latter condition. More specifically, we show that the convergence is guaranteed for c n = o 1 n {c}_{n}=o\left(\frac{1}{\sqrt{n}}\right) , but can be violated if c n ≍ 1 n {c}_{n}\hspace{0.33em}\asymp \hspace{0.33em}\frac{1}{\sqrt{n}} .

On the specification property and synchronization of unique q-expansions

Given a positive integer M and $q \in (1, M+1]$ we consider expansions in base q for real numbers $x \in [0, {M}/{q-1}]$ over the alphabet $\{0, \ldots , M\}$ . In particular, we study some dynamical properties of the natural occurring subshift $(\boldsymbol{{V}}_q, \sigma )$ related to unique expansions in such base q. We characterize the set of $q \in \mathcal {V} \subset (1,M+1]$ such that $(\boldsymbol{{V}}_q, \sigma )$ has the specification property and the set of $q \in \mathcal {V}$ such that $(\boldsymbol{{V}}_q, \sigma )$ is a synchronized subshift. Such properties are studied by analysing the combinatorial and dynamical properties of the quasi-greedy expansion of q. We also calculate the size of such classes as subsets of $\mathcal {V}$ giving similar results to those shown by Blanchard [ 10 ] and Schmeling in [ 36 ] in the context of $\beta $ -transformations.

Efficient Localized Inference for Large Graphical Models

We propose a new localized inference algorithm for answering marginalization queries in large graphical models with the correlation decay property. Given a query variable and a large graphical model, we define a much smaller model in a local region around the query variable in the target model so that the marginal distribution of the query variable can be accurately approximated. We introduce two approximation error bounds based on the Dobrushin’s comparison theorem and apply our bounds to derive a greedy expansion algorithm that efficiently guides the selection of neighbor nodes for localized inference. We verify our theoretical bounds on various datasets and demonstrate that our localized inference algorithm can provide fast and accurate approximation for large graphical models.

Addition and multiplication of beta-expansions in generalized Tribonacci base

International audience We study properties of β-numeration systems, where β > 1 is the real root of the polynomial x3 - mx2 - x - 1, m ∈ ℕ, m ≥ 1. We consider arithmetic operations on the set of β-integers, i.e., on the set of numbers whose greedy expansion in base β has no fractional part. We show that the number of fractional digits arising under addition of β-integers is at most 5 for m ≥ 3 and 6 for m = 2, whereas under multiplication it is at most 6 for all m ≥ 2. We thus generalize the results known for Tribonacci numeration system, i.e., for m = 1. We summarize the combinatorial properties of infinite words naturally defined by β-integers. We point out the differences between the structure of β-integers in cases m = 1 and m ≥ 2.