English
Related papers

Related papers: Periodicity of complementing multisets

200 papers

A finite set S of words over the alphabet A is called non-complete if Fact(S*) is different from A*. A word w in A* - Fact(S*) is said to be uncompletable. We present a series of non-complete sets S_k whose minimal uncompletable words have…

Formal Languages and Automata Theory · Computer Science 2011-04-05 Vladimir V. Gusev , Elena V. Pribavkina

A subset P of N x N is called Schur bounded if every infinite matrix with bounded entries which is zero off of P yields a bounded Schur multiplier on B(H). Such sets are characterized as being the union of a subset with at most k entries in…

Operator Algebras · Mathematics 2007-05-23 Kenneth R. Davidson , Allan P. Donsig

Periodic and semi periodic patterns are very common in nature. In this paper we introduce a topological toolbox aiming in detecting and quantifying periodicity. The presented technique is of a general nature and may be employed wherever…

Algebraic Topology · Mathematics 2019-05-30 Paweł Dłotko , Wanling Qiu , Simon Rudkin

In this article, we study the set of parameters $c \in \mathbb{C}$ for which two given complex numbers $a$ and $b$ are simultaneously preperiodic for the quadratic polynomial $f_{c}(z) = z^{2} +c$. Combining complex-analytic and arithmetic…

Dynamical Systems · Mathematics 2019-06-12 Valentin Huguin

The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word bordered, if it has a proper prefix which is also a suffix of…

Discrete Mathematics · Computer Science 2007-05-23 Tero Harju , Dirk Nowotka

We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…

Cellular Automata and Lattice Gases · Physics 2010-12-07 Alexis Ballier , Emmanuel Jeandel

Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…

Number Theory · Mathematics 2023-06-06 Jacob Hartzer , Christopher O'Neill

We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for $\lambda\in\{\frac{\pm1\pm\sqrt5}2,\pm\sqrt2,\pm\sqrt3\}$ that all integer sequences $(a_k)_{k\in\mathbb Z}$…

Dynamical Systems · Mathematics 2008-09-16 Shigeki Akiyama , Horst Brunotte , Attila Petho , Wolfgang Steiner

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

Combinatorics · Mathematics 2024-03-26 Rajat Gupta , Noah Lebowitz-Lockard

For positive integers $n\geq k\geq t$, a collection $ \mathcal{B} $ of $k$-subsets of an $n$-set $ X $ is called a $t$-packing if every $t$-subset of $ X $ appears in at most one set in $\mathcal{B}$. In this paper, we give some upper and…

Combinatorics · Mathematics 2019-05-28 Ramin Javadi , Ehsan Poorhadi , Farshad Fallah

In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved

Number Theory · Mathematics 2018-05-01 Milan Pasteka

We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is…

Discrete Mathematics · Computer Science 2023-09-04 E. Charlier , A. Massuir , M. Rigo , E. Rowland

We consider cubic polynomials f(z)=z^3+az+b defined over the function field C(L), with a marked point of period N and multiplier L. In the case N=1, there are infinitely many such objects, and in the case N>2, only finitely many. The case…

Dynamical Systems · Mathematics 2019-08-15 Patrick Ingram

We investigate the behavior of the periods and border lengths of random words over a fixed alphabet. We show that the asymptotic probability that a random word has a given maximal border length $k$ is a constant, depending only on $k$ and…

Formal Languages and Automata Theory · Computer Science 2019-12-18 Štěpán Holub , Jeffrey Shallit

This work describes the number of restricted finite words in the alphabet A={a,b} required to identify an infinite word with some period n in the set of all infinite words in this alphabet given up to a shift. Also reviewed the case of…

Rings and Algebras · Mathematics 2013-01-15 Petr Lavrov

A collection of complex sequences of length v is complementary if the sum of their periodic autocorrelation function values at all non-zero shifts is constant. For a complex sequence A=[a_0,a_1,...,a_{v-1}] of length v=dm we define the…

Combinatorics · Mathematics 2015-08-05 Dragomir Z. Djokovic , Ilias S. Kotsireas

The examples of rhythmical signals with variable period are considered. The definition of periodic function with the variable period is given as a model of such signals. The examples of such functions are given and their variable periods…

General Mathematics · Mathematics 2010-06-15 M. V Pryjmak

A theorem of A. and C. R\'enyi on periodic entire functions states that an entire function $f(z) $ must be periodic if $ P(f(z)) $ is periodic, where $ P(z) $ is a non-constant polynomial. By extending this theorem, we can answer some open…

Complex Variables · Mathematics 2022-07-20 Zinelaabidine Latreuch , Amine Zemirni

Given a finite set of quasi-periodic cocycles the random product of them is defined as the random composition according to some probability measure. We prove that the set of $C^r$, $0\leq r \leq \infty$ (or analytic) $k+1$-tuples of quasi…

Dynamical Systems · Mathematics 2019-07-02 Jamerson Bezerra , Mauricio Poletti

Consider a graph $G$ with chromatic number $k$ and a collection of complete bipartite graphs, or bicliques, that cover the edges of $G$. We prove the following two results: \medskip \noindent $\bullet$ If the bicliques partition the edges…

Combinatorics · Mathematics 2009-03-19 Dhruv Mubayi , Sundar Vishwanathan