English
Related papers

Related papers: Multidimensional extension of the Morse--Hedlund t…

200 papers

Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…

Combinatorics · Mathematics 2022-12-09 Hakan Guler , Bill Jackson

This paper is intended as a sequel to a paper arXiv:0803.2636 written by four of the coauthors here. In the paper, they proved a stronger form of the Erd\H{o}s-Mirksy conjecture which states that there are infinitely many positive integers…

An atomic monoid $M$ is called length-factorial if for every non-invertible element $x \in M$, no two distinct factorizations of $x$ into irreducibles have the same length (i.e., number of irreducible factors, counting repetitions). The…

Commutative Algebra · Mathematics 2024-03-21 Alan Bu , Joseph Vulakh , Alex Zhao

In this article, first we generalize the Thue-Morse sequence $(a(n))_{n=0}^\infty$ (the generalized Thue-Morse sequences) by a cyclic permutation and $k$ -adic expansion of natural numbers, and consider the necessary-sufficient condition…

Number Theory · Mathematics 2014-05-08 Eiji Miyanohara

For a monic polynomial $D(X)$ of even degree, express $\sqrt D$ as a Laurent series in $X^{-1}$; this yields a continued fraction expansion (similar to continued fractions of real numbers): \[\sqrt…

Number Theory · Mathematics 2017-06-16 Olaf Merkert

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

Combinatorics · Mathematics 2011-04-15 Jarosław Grytczuk , Jakub Kozik , Marcin Witkowski

We extend monotone quasiconformal mappings from dimension n to n+1 while preserving both monotonicity and quasiconformality. The extension is given explicitly by an integral operator. In the case n=1 it yields a refinement of the…

Complex Variables · Mathematics 2011-02-08 Leonid V. Kovalev , Jani Onninen

In this article, we show that the Kamae-Xue complexity function for an infinite sequence classifies eventual periodicity completely. We prove that an infinite binary word $x_1x_2 \cdots $ is eventually periodic if and only if…

Computational Complexity · Computer Science 2014-04-18 Teturo Kamae , Dong Han Kim

We consider $d$-dimensional configurations, that is, colorings of the $d$-dimensional integer grid $\mathbb{Z}^d$ with finitely many colors. Moreover, we interpret the colors as integers so that configurations are functions $\mathbb{Z}^d…

Discrete Mathematics · Computer Science 2026-05-28 Pyry Herva , Jarkko Kari

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

General Mathematics · Mathematics 2025-02-14 J. Stöckl

An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of…

Commutative Algebra · Mathematics 2024-09-12 Henry Jiang , Shihan Kanungo , Harry Kim

A well known theorem of Lagrange states that the simple continued fraction of a real number $\alpha$ is periodic if and only if $\alpha$ is a quadratic irrational. We examine non-periodic and non-simple continued fractions formed by two…

Number Theory · Mathematics 2018-12-03 Michael Obiero Oyengo

The Bethe-Sommerfeld conjecture states that the spectrum of the stationary Schrodinger operator with a periodic potential in dimensions higher than 1 has only finitely many gaps. After work done by many authors, it has been proven by now in…

Spectral Theory · Mathematics 2010-08-06 Mariya Vorobets

In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…

Representation Theory · Mathematics 2020-06-26 Andrés Franco , Hernán Giraldo , Pedro Rizzo

A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of…

Formal Languages and Automata Theory · Computer Science 2014-12-02 Golnaz Badkobeh , Gabriele Fici , Zsuzsanna Lipták

First we generalize the Thue-Morse sequence (the generalized Thue-Morse sequences) by a cyclic permutations and p-adic system, and consider the necessary-sufficient condition that it is non-periodic. Moreover if the generalized Thue-Morse…

Number Theory · Mathematics 2015-02-26 Eiji Miyanohara

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

Logic in Computer Science · Computer Science 2024-04-05 Michael Benedikt , Egor V. Kostylev , Tony Tan

The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…

Information Theory · Computer Science 2023-09-25 Zhiru Chen , Zhixiong Chen , Jakob Obrovsky , Arne Winterhof

We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…

Dynamical Systems · Mathematics 2012-02-23 Nikos Frantzikinakis

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

Logic in Computer Science · Computer Science 2025-09-11 Alessandro Artale , Christopher Hampson , Roman Kontchakov , Andrea Mazzullo , Frank Wolter