English
Related papers

Related papers: Abelian Complexity in Minimal Subshifts

200 papers

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

Dynamical Systems · Mathematics 2015-09-02 Volker Mayer , Mariusz Urbanski

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

Combinatorics · Mathematics 2010-11-04 Balazs Szegedy

Given an infinite word X over an alphabet A a letter b occurring in X, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of X an extremal word of X. In this paper we…

Combinatorics · Mathematics 2013-07-22 James D. Currie , Narad Rampersad , Kalle Saari , Luca Q. Zamboni

Consider the algebraic dynamics on a torus T=G_m^n given by a matrix M in GL_n(Z). Assume that the characteristic polynomial of M is prime to all polynomials X^m-1. We show that any finite equivariant map from another algebraic dynamics…

Logic · Mathematics 2016-02-24 Zoé Chatzidakis , Ehud Hrushovski

Fix a number field $k$ and a rational prime $\ell$. We consider abelian varieties whose $\ell$-power torsion generates a pro-$\ell$ extension of $k(\mu_{\ell^\infty})$ which is unramified away from $\ell$. It is a necessary, but not…

Number Theory · Mathematics 2015-04-14 Christopher Rasmussen , Akio Tamagawa

We present a general method for computing the abelian complexity $\rho^{\rm ab}_{\bf s} (n)$ of an automatic sequence $\bf s$ in the case where (a) $\rho^{\rm ab}_{\bf s} (n)$ is bounded by a constant and (b) the Parikh vectors of the…

Formal Languages and Automata Theory · Computer Science 2020-11-17 Jeffrey Shallit

Let $\mathfrak g$ be a simple Lie algebra with a Borel subalgebra $\mathfrak b$. To any long positive root $\gamma$, one associates two ideals of $\mathfrak b$: the abelian ideal $I(\gamma)_{max}$ and not necessarily abelian ideal…

Representation Theory · Mathematics 2017-11-15 Dmitri I. Panyushev

(1) Every infinite, Abelian compact (Hausdorff) group K admits 2^|K|-many dense, non-Haar-measurable subgroups of cardinality |K|. When K is nonmetrizable, these may be chosen to be pseudocompact. (2) Every infinite Abelian group G admits a…

General Topology · Mathematics 2013-10-09 W. W. Comfort , S. U. Raczkowski , F. J. Trigos-Arrieta

Let $K$ be a number field. We present several new finiteness results for isomorphism classes of abelian varieties over $K$ whose $\ell$-power torsion fields are arithmetically constrained for some rational prime $\ell$. Such arithmetic…

Number Theory · Mathematics 2013-02-07 Christopher Rasmussen , Akio Tamagawa

We show that paper folding words contain arbitrarily large abelian powers.

Formal Languages and Automata Theory · Computer Science 2013-10-04 Štěpán Holub

Given a $p$-group $G$ and a subgroup-closed class $\mathfrak{X}$, we associate with each $\mathfrak{X}$-subgroup $H$ certain quantities which count $\mathfrak{X}$-subgroups containing $H$ subject to further properties. We show in Theorem I…

Group Theory · Mathematics 2023-06-01 Stefanos Aivazidis , Maria Loukaki

An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…

Discrete Mathematics · Computer Science 2011-09-29 Anna Frid , Luca Zamboni

Let (t_n) be the classical Thue-Morse sequence defined by t_n = s_2(n) (mod 2), where s_2 is the sum of the bits in the binary representation of n. It is well known that for any integer k>=1 the frequency of the letter "1" in the…

Number Theory · Mathematics 2010-09-28 Johannes F. Morgenbesser , Jeffrey Shallit , Thomas Stoll

We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the maximal number of occurrences among all possible subwords. We…

Combinatorics · Mathematics 2025-10-06 Wenjie Fang

We generalize the Abel--Hurwitz identities to an almost entirely noncommutative setting. Namely, let $V$ be a finite set of size $n$, and let $\mathbb{L}$ be any noncommutative ring. For each $s\in V$, let $x_{s}\in\mathbb{L}$. Set $x\left(…

Combinatorics · Mathematics 2026-04-15 Darij Grinberg

In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called…

Combinatorics · Mathematics 2013-07-11 Cesar Ceballos , Jean-Philippe Labbé , Christian Stump

Let $w$ be an infinite word on an alphabet $A$. We denote by $(n_i)_{i \geq 1}$ the increasing sequence (assumed to be infinite) of all lengths of palindrome prefixes of $w$. In this text, we give an explicit construction of all words $w$…

Combinatorics · Mathematics 2012-02-13 Stéphane Fischler

To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$…

Formal Languages and Automata Theory · Computer Science 2022-06-15 Jarkko Peltomäki , Ville Salo

We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then…

Discrete Mathematics · Computer Science 2014-07-15 Gabriele Fici , Luca Q. Zamboni

In [Ergodic Theory Dynam. System, 16 (1996) 663--682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is $S$-adic with $\card S \leq 3^{27}$. In this paper, we improve this result by giving an…

Discrete Mathematics · Computer Science 2013-05-03 Julien Leroy
‹ Prev 1 8 9 10 Next ›