English
Related papers

Related papers: Cobham's theorem for the Gaussian integers

200 papers

We make certain bounds in Krebs' proof of Cobham's theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic $a$-automatic sequence and an aperiodic $b$-automatic sequence, where $a$ and $b$ are…

Formal Languages and Automata Theory · Computer Science 2018-12-17 Lucas Mol , Narad Rampersad , Jeffrey Shallit , Manon Stipulanti

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progressions and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…

Combinatorics · Mathematics 2019-04-24 Aninda Chakraborty , Sayan Goswami

Let $n$ be an odd positive integer. It was proved by Brass and Schmeisser that for every quadrature $$\mathcal{Q}=\alpha_1f(x_1)+\dots+\alpha_mf(x_m),$$ (with positive weights) of order at least $n+1$ and for every $n-$convex function $f,$…

Classical Analysis and ODEs · Mathematics 2023-08-28 Tomasz Szostok

We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the notion of two independent substitutions. Our main result is…

Combinatorics · Mathematics 2009-07-28 Fabien Durand , Michel Rigo

If a non-periodic sequence $X$ is the image by a morphism of a fixed point of both a primitive substitution $\sigma$ and a primitive substitution $\tau$, then the dominant eigenvalues of the matrices of $\sigma$ and of $\tau$ are…

Combinatorics · Mathematics 2008-07-23 Fabien Durand

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 conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…

Number Theory · Mathematics 2016-10-14 Jakub Byszewski , Jakub Konieczny

Let $\Gamma \subset \operatorname{PU}(1,n)$ be a lattice, and $S_\Gamma$ the associated ball quotient. We prove that, if $S_\Gamma$ contains infinitely many maximal totally geodesic subvarieties, then $\Gamma$ is arithmetic. We also prove…

Algebraic Geometry · Mathematics 2023-09-25 Gregorio Baldi , Emmanuel Ullmo

In this note we settle two open problems in the theory of permanents by using recent results from other areas of mathematics. Bapat conjectured that certain quotients of permanents, which generalize symmetric function means, are concave. We…

Rings and Algebras · Mathematics 2012-04-18 Petter Brändén

Posner and Robinson (1981) proved that if $S \subseteq \omega$ is non-computable, then there exists a $G \subseteq \omega$ such that $S \oplus G \geq_T G'$. Shore and Slaman (1999) extended this result to all $n \in \omega$, by showing that…

Logic · Mathematics 2012-09-17 Adam R. Day , Damir D. Dzhafarov

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is…

Combinatorics · Mathematics 2014-07-01 Eric Balandraud , Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

Let $n \ge 2$ be a natural number, $M$ a real $n \times n$ matrix, $s$ the sum of the entries of $M$ and $q$ the sum of their squares. With $\alpha := s/n$ and $\beta := q/n$, Gasper's determinant bound says that $ |\det M| \le…

Combinatorics · Mathematics 2018-04-10 Markus Sigg

The tensor square conjecture states that for $n \geq 10$, there is an irreducible representation $V$ of the symmetric group $S_n$ such that $V \otimes V$ contains every irreducible representation of $S_n$. Our main result is that for large…

Combinatorics · Mathematics 2020-11-10 Sammy Luo , Mark Sellke

We prove that if a Bessel sequence in a Hilbert space, that is indexed by a countably infinite group in an invariant manner, can be partitioned into finitely many Riesz basic sequences, then each of the sets in the partition can be chosen…

Operator Algebras · Mathematics 2010-01-26 Vern I. Paulsen

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Data Structures and Algorithms · Computer Science 2023-10-19 Andreas Björklund , Petteri Kaski

We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…

Combinatorics · Mathematics 2016-10-24 Julian Sahasrabudhe

For $\beta > 1$ a real algebraic integer ({\it the base}), the finite alphabets $\mathcal{A} \subset \mathbb{Z}$ which realize the identity $\mathbb{Q}(\beta) = {\rm Per}_{\mathcal{A}}(\beta)$, where ${\rm Per}_{\mathcal{A}}(\beta)$ is the…

Number Theory · Mathematics 2021-09-30 Denys Dutykh , Jean-Louis Verger-Gaugry

For a finite abelian group $G$, let $\beta_{\mathrm{sep}}(G)$ denote its separating Noether number. We determine $\beta_{\mathrm{sep}}(G)$ exactly for every finite abelian group $ G \cong C_{n_1}\oplus \cdots \oplus C_{n_r}$ with $ 1<n_1…

Commutative Algebra · Mathematics 2026-03-25 Jing Huang

Let us say that a graph $G$ is Ramsey for a tuple $(H_1,\dots,H_r)$ of graphs if every $r$-coloring of the edges of $G$ contains a monochromatic copy of $H_i$ in color $i$, for some $i \in [r]$. A famous conjecture of Kohayakawa and…

Combinatorics · Mathematics 2023-08-01 Eden Kuperwasser , Wojciech Samotij , Yuval Wigderson

Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…

Number Theory · Mathematics 2018-03-13 Dragos Ghioca , Junyi Xie , with an appendix written by Michael Wibmer