中文
相关论文

相关论文: Latin Square Thue-Morse Sequences are Overlap-Free

200 篇论文

An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…

组合数学 · 数学 2017-01-18 Matthew Kwan , Benny Sudakov

In this work we consider morphisms that preserve well-known non-repeating properties: squarefreeness, cubefreeness, overlap-freeness and weak squarefreeness. Up to the present moment only the morphisms preserving three out of four…

组合数学 · 数学 2015-05-04 Boris Zolotov

We develop a limit theory of Latin squares, paralleling the recent limit theories of dense graphs and permutations. We introduce a notion of density, an appropriate version of the cut distance, and a space of limit objects - so-called…

组合数学 · 数学 2024-11-15 Frederik Garbe , Robert Hancock , Jan Hladký , Maryam Sharifzadeh

In this paper we study pattern avoidance in Latin Squares, which gives us a two dimensional analogue of the well studied notion of pattern avoidance in permutations. Our main results include enumerating and characterizing the Latin Squares…

组合数学 · 数学 2014-03-11 Michael J. Earnest , Samuel C. Gutekunst

We consider in general two-block substitutions and their fixed points. We prove that some of them have a simple structure: their fixed points are morphic sequences. Others are intrinsically more complex, such as the Kolakoski sequence. We…

组合数学 · 数学 2023-02-21 Michel Dekking , Mike Keane

Let $S$ be one of $\{aba,bcb\}$ and $\{aba, aca\}$, and let $w$ be an infinite square-free word over $\Sigma=\{a,b,c\}$ with no factor in $S$. Suppose that $f:\Sigma\rightarrow T^*$ is a non-erasing morphism. Word $f(w)$ is square-free if…

形式语言与自动机理论 · 计算机科学 2019-02-18 James D. Currie

We recall the Alon-Tarsi conjecture on the number of even latin squares. We introduce a map which switches the parity of a latin square under certain requirements. An example is included.

组合数学 · 数学 2025-03-05 Carolin Hannusch

We show that the set of binary words containing overlaps is not unambiguously context-free and that the set of ternary words containing overlaps is not context-free. We also show that the set of binary words that are not subwords of the…

组合数学 · 数学 2009-03-29 Narad Rampersad

Good words are binary words avoiding factors 11 and 1001, and patterns 0000 and 00010100. We show that good words bear the same relationship to the period-doubling sequence that overlap-free words bear to the Thue-Morse sequence. We prove…

组合数学 · 数学 2023-03-28 James D. Currie

Given an integer $q\ge2$ and $\theta_1,\cdots,\theta_{q-1}\in\{0,1\}$, let $(\theta_n)_{n\ge0}$ be the generalized Thue-Morse sequence, defined to be the unique fixed point of the morphism $$0\mapsto0\theta_1\cdots\theta_{q-1}$$…

数论 · 数学 2020-06-09 Yao-Qiang Li

We revisit the topic of power-free morphisms, focusing on the properties of the class of complementary morphisms. Such morphisms are defined over a $2$-letter alphabet, and map the letters 0 and 1 to complementary words. We prove that every…

组合数学 · 数学 2023-12-11 Jeffrey Shallit , Arseny M. Shur , Stefan Zorcic

Following ideas of Lurie, we give in this article a general construction of equivariant elliptic cohomology without restriction to characteristic zero. Specializing to the universal elliptic curve we obtain in particular equivariant spectra…

代数拓扑 · 数学 2023-07-21 David Gepner , Lennart Meier

Each acyclic graph, and more generally, each acyclic orientation of the graph associated to a Cartan matrix, allows to define a so-called frise; this is a collection of sequences over the positive natural numbers, one for each vertex of the…

环与代数 · 数学 2009-06-12 Ibrahim Assem , Christophe Reutenauer , David Smith

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…

数论 · 数学 2014-05-08 Eiji Miyanohara

A word is square-free if it does not contain nonempty factors of the form $XX$. In 1906 Thue proved that there exist arbitrarily long square-free words over a $3$-letter alphabet. It was proved recently [7] that among these words there are…

组合数学 · 数学 2021-05-04 Jarosław Grytczuk , Hubert Kordulewski , Bartłomiej Pawlik

Let $D$ be a square-free integer. Under certain conditions on $D$, we characterize non-constant arithmetic progressions of squares over quadratic extensions of $\mathbb{Q}(\sqrt{D})$.

数论 · 数学 2026-02-03 Enrique González-Jiménez , Nguyen Xuan Tho

We introduce a notion of parity for transversals, and use it to show that in Latin squares of order $2 \bmod 4$, the number of transversals is a multiple of 4. We also demonstrate a number of relationships (mostly congruences modulo 4)…

组合数学 · 数学 2020-04-30 Darcy Best , Ian M. Wanless

In a latin square of order $n$, a near transversal is a collection of $n-1$ cells which intersects each row, column, and symbol class at most once. A longstanding conjecture of Brualdi, Ryser, and Stein asserts that every latin square…

组合数学 · 数学 2019-08-13 Luis Goddyn , Kevin Halasz

A word is square-free if it does not contain a nonempty word of the form $XX$ as a factor. A famous 1906 result of Thue asserts that there exist arbitrarily long square-free words over a $3$-letter alphabet. We study square-free words with…

组合数学 · 数学 2022-09-20 Michał Dębski , Jarosław Grytczuk , Bartłomiej Pawlik

We introduce a graph attached to mutually orthogonal Sudoku Latin squares. The spectra of the graphs obtained from finite fields are explicitly determined. As a corollary, we then use the eigenvalues to distinguish non-isomorphic Sudoku…

组合数学 · 数学 2021-11-10 Sho Kubota , Sho Suda , Akane Urano