English
Related papers

Related papers: Cobham's theorem for substitutions

200 papers

Let $\beta$ be any permutation on $n$ symbols and let $c(k, \beta)$ be the number of permutations that $k$-commute with $\beta$. The cycle type of a permutation $\beta$ is a vector $(c_1, \dots, c_n)$ such that $\beta$ has exactly $c_i$…

Combinatorics · Mathematics 2015-12-01 Luis Manuel Rivera

Recently 't Hooft demonstrated that ``For any quantum system there exists at least one deterministic model that reproduces all its dynamics after prequantization''. An extension is presented here which covers quantum systems that are…

Quantum Physics · Physics 2009-11-13 Hans-Thomas Elze

The main theorem here is the K-theoretic analogue of the cohomological `stable double component formula' for quiver functions in [Knutson, Miller, and Shimozono, math.AG/0308142]. This K-theoretic version is still in terms of lacing…

Combinatorics · Mathematics 2007-05-23 Ezra Miller

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

Number Theory · Mathematics 2007-05-23 Thomas Garrity

It is well known that any power series over a finite field represents a rational function if and only if its sequence of coefficients is ultimately periodic. The famous Christol's Theorem states that a power series over a finite field is…

Number Theory · Mathematics 2024-04-16 Chunlin Wang

The comma sequence (1, 12, 35, 94, ...) is the lexicographically earliest sequence such that the difference of consecutive terms equals the concatenation of the digits on either side of the comma separating them. The behavior of a…

Number Theory · Mathematics 2024-09-27 Robert Dougherty-Bliss , Natalya Ter-Saakov

The first aim of this article is to give information about the algebraic properties of alternate bases $\boldsymbol{\beta}=(\beta_0,\dots,\beta_{p-1})$ determining sofic systems. We show that a necessary condition is that the product…

Combinatorics · Mathematics 2022-02-09 Émilie Charlier , Célia Cisternino , Zuzana Masáková , Edita Pelantová

We consider a homogeneous system of linear equations of the form $A_\alpha^{\otimes N} {\bf x} = 0$ arising from the distinguishability of two quantum operations by $N$ uses in parallel, where the coefficient matrix $A_\alpha$ depends on a…

Quantum Physics · Physics 2020-03-06 Chi-Kwong Li , Yue Liu , Chao Ma , Diane Christine P. Pelejo

In this paper we present an extension of the removal lemma to integer linear systems over abelian groups. We prove that, if the $k$--determinantal of an integer $(k\times m)$ matrix $A$ is coprime with the order $n$ of a group $G$ and the…

Combinatorics · Mathematics 2012-07-02 Daniel Král' , Oriol Serra , Lluís Vena

We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$. We determine with the accuracy of $\pm 1$ the maximal number of…

Discrete Mathematics · Computer Science 2007-05-23 Lubomíra Balková , Edita Pelantová , Ondřej Turek

Suppose that $\alpha,\beta\in\mathbb{R}$. Let $\alpha\geqslant1$ and $c$ be a real number in the range $1<c< 12/11$. In this paper, it is proved that there exist infinitely many primes in the generalized Piatetski--Shapiro sequence, which…

Number Theory · Mathematics 2022-11-21 Jinjiang Li , Jinyun Qi , Min Zhang

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…

Dynamical Systems · Mathematics 2015-02-24 D. Damanik , D. Lenz

For real power series whose non-zero coefficients satisfy $|a_m|^{1/m}\to~1$ we prove a stronger version of Fabry theorem relating the frequency of sign changes in the coefficients and analytic continuation of the sum of the power series.

Complex Variables · Mathematics 2012-02-07 Alexandre Eremenko

Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…

Formal Languages and Automata Theory · Computer Science 2017-08-17 Radu Iosif , Xiao Xu

The celebrated Primitive Normal Basis Theorem states that for any $n\ge 2$ and any finite field $\mathbb F_q$, there exists an element $\alpha\in \mathbb F_{q^n}$ that is simultaneously primitive and normal over $\mathbb F_q$. In this…

Number Theory · Mathematics 2017-12-29 Giorgos Kapetanakis , Lucas Reis

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

We consider numeration systems where digits are integers and the base is an algebraic number $\beta$ such that $|\beta|>1$ and $\beta$ satisfies a polynomial where one coefficient is dominant in a certain sense. For this class of bases…

Number Theory · Mathematics 2011-06-21 Christiane Frougny , Edita Pelantová , Milena Svobodová

Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…

Number Theory · Mathematics 2017-12-27 Nadir Murru

For a fairly general class of two-dimensional tiling substitutions, we prove that if the length expansion $\beta$ is a Pisot number, then the tilings defined by the substitution must be locally finite. We also give a simple example of a…

Dynamical Systems · Mathematics 2012-08-27 Natalie Priebe Frank , E. Arthur Robinson,

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Probability · Mathematics 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler