English
Related papers

Related papers: Almost everywhere balanced sequences of complexity…

200 papers

Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…

Machine Learning · Computer Science 2007-07-16 Marcus Hutter , Andrej Muchnik

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

Combinatorics · Mathematics 2023-08-08 Édouard Bonnet , Romain Bourneuf , Colin Geniet , Stéphan Thomassé

Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange…

Dynamical Systems · Mathematics 2021-06-23 France Gheeraert , Marie Lejeune , Julien Leroy

Let $n>c_1\ge c_2$ and $\Sigma$ be positive integers with $n\cdot c_1\ge \Sigma \ge n\cdot c_2.$ Let $\mD=\dds{n}{\Sigma}{c_1}{c_2}$ denote the set of all degree sequences of length $n$ with the even sum $\Sigma$ and satisfying $c_1\ge…

Combinatorics · Mathematics 2025-11-18 Péter L. Erdős , Gábor Lippner , Na'ama Nevo , Lajos Soukup

The multiplicities a_{lambda,mu} of simple modules L(mu) in the composition series of Kac modules V(lambda) for the Lie superalgebra gl(m/n) were described by Serganova, leading to her solution of the character problem for gl(m/n). In…

Representation Theory · Mathematics 2007-05-23 J. Van der Jeugt , R. B. Zhang

A word $u$ defined over an alphabet $\mathcal{A}$ is $c$-balanced ($c\in\mathbb{N}$) if for all pairs of factors $v$, $w$ of $u$ of the same length and for all letters $a\in\mathcal{A}$, the difference between the number of letters $a$ in…

Combinatorics · Mathematics 2010-11-02 Ondřej Turek

We resolve a long-standing open question, about the existence of a constant-factor approximation algorithm for the average-case \textsc{Decision Tree} problem with uniform probability distribution over the hypotheses. We answer the question…

Data Structures and Algorithms · Computer Science 2026-04-29 Michał Szyfelbein

For every couple (p;q) of strictly positive integers, the `` alternate congruo-harmonic '' series parametrized by (p;q), whose general term is (-1)^k/(pk+q), converges infra-linearly and very slowly. On the basis of a generalized continued…

Classical Analysis and ODEs · Mathematics 2022-07-06 David Pouvreau

A diagram $\mathcal{D} = (G, l)$ over a monoid $M$ is an oriented graph $G = (V, E)$ endowed with a labeling $l\colon E \to M$. A diagram is commutative if and only if for any two oriented paths with the same endpoints, the products in $M$…

Combinatorics · Mathematics 2025-09-16 Artem Malko , Igor Spiridonov

We show that for any positive integer $d$, there are families of switched linear systems---in fixed dimension and defined by two matrices only---that are stable under arbitrary switching but do not admit (i) a polynomial Lyapunov function…

Optimization and Control · Mathematics 2015-04-16 Amir Ali Ahmadi , Raphael Jungers

Celebrated work of Jerrum, Sinclair, and Vigoda has established that the permanent of a {0,1} matrix can be approximated in randomized polynomial time by using a rapidly mixing Markov chain. A separate strand of the literature has pursued…

Computational Complexity · Computer Science 2009-06-10 Cristopher Moore , Alexander Russell

Complementary symmetric Rote sequences are binary sequences which have factor complexity $\mathcal{C}(n) = 2n$ for all integers $n \geq 1$ and whose languages are closed under the exchange of letters. These sequences are intimately linked…

Combinatorics · Mathematics 2018-12-11 Kateřina Medková , Edita Pelantová , Laurent Vuillon

The random numbers driving Markov chain Monte Carlo (MCMC) simulation are usually modeled as independent U(0,1) random variables. Tribble [Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences (2007)…

Statistics Theory · Mathematics 2011-05-11 S. Chen , J. Dick , A. B. Owen

We study the factorization of the numbers $N = X^2+c$, where $c$ is a fixed constant, and this independently of the value of gcd$(X,c)$. We prove the existence of a family of sequences with arithmetic difference $(U_n, Z_n)$ generating…

General Mathematics · Mathematics 2023-11-13 Marc Wolf , François Wolf

By using the work of Frantzikinakis and Wierdl, we can see that for all $d\in\mathbb{N}$, $\alpha\in(d,d+1)$, and integers $k\ge d+2$ and $r\ge1$, there exist infinitely many $n\in\mathbb{N}$ such that the sequence…

Number Theory · Mathematics 2021-02-16 Kota Saito , Yuuya Yoshida

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,...,d_{k}],$ with all partial quotients $d_1,d_2,...,d_{k}$…

Number Theory · Mathematics 2013-06-04 Dmitriy Frolenkov , Igor D. Kan

A {\it two-dimensional continued fraction expansion} is a map $\mu$ assigning to every $x \in\mathbb R^2\setminus\mathbb Q^2$ a sequence $\mu(x)=T_0,T_1,\dots$ of triangles $T_n$ with vertices $x_{ni}=(p_{ni}/d_{ni},q_{ni}/d_{ni})\in\mathbb…

Number Theory · Mathematics 2017-05-10 Daniele Mundici

Let $(X,\mathcal{B},\mu,T)$ be a measure preserving system. We say that a function $f\in L^2(X,\mu)$ is $\mu$-mean equicontinuous if for any $\epsilon>0$ there is $k\in \mathbb{N}$ and measurable sets ${A_1,A_2,\cdots,A_k}$ with…

Dynamical Systems · Mathematics 2018-07-17 Tao Yu

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many…

Number Theory · Mathematics 2017-07-04 Sudhansu Sekhar Rout

Virtually all questions that one can ask about the behavioral and structural complexity of a stochastic process reduce to a linear algebraic framing of a time evolution governed by an appropriate hidden-Markov process generator. Each type…

Chaotic Dynamics · Physics 2018-04-18 Paul M. Riechers , James P. Crutchfield