English
Related papers

Related papers: Cobham's theorem for substitutions

200 papers

Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…

Information Theory · Computer Science 2025-01-07 Daniel J. Katz , Adeebur Rahman , Michael J Ward

Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations.…

Combinatorics · Mathematics 2017-09-06 Rutilo Moreno , Luis Manuel Rivera

For a fixed alphabet $A$, an infinite sequence $X$ is said to be normal if every word $w$ over $A$ appears in $X$ with the same frequency as any other word of the same length. A classical result of Agafonov (1966) relates normality to…

Formal Languages and Automata Theory · Computer Science 2025-02-19 Laurent Bienvenu , Hugo Gimbert , Subin Pulari

The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial…

Geometric Topology · Mathematics 2019-08-27 Nikolai V. Ivanov

In this article we investigate different forms of multiplicative independence between the sequences $n$ and $\lfloor n \alpha \rfloor$ for irrational $\alpha$. Our main theorem shows that for a large class of arithmetic functions $a, b…

Number Theory · Mathematics 2023-12-08 David Crnčević , Felipe Hernández , Kevin Rizk , Khunpob Sereesuchart , Ran Tao

Let $\mathcal{S}$ be a commutative semigroup, and let $T$ be a sequence of terms from the semigroup $\mathcal{S}$. We call $T$ an (additively) {\sl irreducible} sequence provided that no sum of its some terms vanishes. Given any element $a$…

Combinatorics · Mathematics 2015-06-25 Guoqing Wang

Let $\mathscr{A}$ be a nonempty set of infinite matrices of linear operators between two topological vector spaces. We show that a sequence is uniformly $\mathscr{A}$-summable if and only if it is $B$-summable for all matrices $B$ of linear…

Functional Analysis · Mathematics 2025-09-09 Paolo Leonetti

Using Schmidt's Subspace Theorem, this paper improves and extends an existing transcendence result for sequences of algebraic numbers. The theorems thus produced correspond to a central theorem on the irrationality of sequences due to…

Number Theory · Mathematics 2025-03-18 Mathias L. Laursen

After a brief review of existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then…

Number Theory · Mathematics 2022-01-19 Xiang-dong Hou , Vincenzo Pallozzi Lavorante

We extend the notion of quantum exchangeability, introduced by K\"ostler and Speicher in arXiv:0807.0677, to sequences (\rho_1,\rho_2,...c) of homomorphisms from an algebra C into a noncommutative probability space (A,\phi), and prove a…

Operator Algebras · Mathematics 2009-07-03 Stephen Curran

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

Number Theory · Mathematics 2016-02-08 Tigran Hakobyan

Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…

Computational Complexity · Computer Science 2007-05-23 Michel Rigo

We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…

Formal Languages and Automata Theory · Computer Science 2015-12-01 Théo Pierron , Thomas Place , Marc Zeitoun

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

Number Theory · Mathematics 2019-09-04 Jagannath Bhanja , Ram Krishna Pandey

Using a diagrammatic reformulation of Bayes' theorem, we provide a necessary and sufficient condition for the existence of Bayesian inference in the setting of finite-dimensional $C^*$-algebras. In other words, we prove an analogue of…

Quantum Physics · Physics 2022-03-22 Arthur J. Parzygnat , Benjamin P. Russo

Let $\alpha$ and $\beta$ belong to the same quadratic field. We show that the inhomogeneous Beatty sequence $(\lfloor n \alpha + \beta \rfloor)_{n \geq 1}$ is synchronized, in the sense that there is a finite automaton that takes as input…

Number Theory · Mathematics 2026-04-03 Luke Schaeffer , Jeffrey Shallit , Stefan Zorcic

We introduce an adiabatic perturbation theory for quantum systems with degenerate energy spectra. This perturbative series enables one to rigorously establish conditions for the validity of the adiabatic theorem of quantum mechanics for…

Quantum Physics · Physics 2015-05-18 Gustavo Rigolin , Gerardo Ortiz

In standard quantum mechanics, complex numbers are used to describe the wavefunction. Although complex numbers have proven sufficient to predict the results of existing experiments, there is no apparent theoretical reason to choose them…

Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…

Logic in Computer Science · Computer Science 2023-08-02 Artur Jeż , Anthony W. Lin , Oliver Markgraf , Philipp Rümmer

We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the case of infinite-dimensional cubes. It is obtained as a corollary to an infinitary extension of the Lebesgue Covering Dimension Theorem.

General Topology · Mathematics 2007-05-23 Aarno Hohti