English
Related papers

Related papers: The abelian complexity of the paperfolding word

200 papers

The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…

Representation Theory · Mathematics 2017-03-21 Houssein El Turkey

It is known that in (regular) unital and in subtractive categories, internal abelian groups are simply behaved; e.g., they are the same as internal algebras $(A,s)$ satisfying $s(x,0)=x$ and $s(x,x)=0$, i.e., \emph{subtraction algebras}.…

Category Theory · Mathematics 2025-03-03 Michael Hoefnagel , Zurab Janelidze

Let $p$ and $q$ be odd prime numbers. In this paper we study non-abelian pq-fold regular covers of the projective line, determine algebraic models for some special cases and provide a general isogeny decomposition of the corresponding…

Algebraic Geometry · Mathematics 2021-05-04 Sebastián Reyes-Carocca

After a review on the development of deformation theory of abelian complex structures from both the classical and generalized sense, we propose the concept of semi-abelian generalized complex structure. We present some observations on such…

Algebraic Geometry · Mathematics 2021-09-09 Yat Sun Poon

In this paper we study n-composition series of affine manifolds. One composition series are classified using gerbe theory. It is natural to think that n-composition series must be classified using n-gerbe theory. In the last section of…

Differential Geometry · Mathematics 2007-05-23 A. Tsemo

If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the periodicity complexity arbitrarily high at…

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

We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra…

Rings and Algebras · Mathematics 2012-10-05 Wolfram Bentz , Brian A. Davey , Jane G. Pitkethly , Ross Willard

In this paper, we consider recurrence sequences $x_n=\xi_1 \alpha_1^n+\xi_2 \alpha_2^n$ ($n=0,1,\ldots$) with companion polynomial $P(X)$. For example, the sequence $x_n=\xi_1(4+\sqrt{2})^n+\xi_2(4-\sqrt{2})^n$ satisfies the recurrence…

Logic · Mathematics 2025-10-28 Hajime Kaneko , Bill Mance

We show that complex multiplication on abelian varieties is equivalent to the existence of a constant rational K\"ahler metric. We give a sufficient condition for a mirror of an abelian variety of CM-type to be of CM-type as well. We also…

Algebraic Geometry · Mathematics 2008-11-26 Meng Chen

Based on the recent development of commutator theory for loops, we provide both syntactic and semantic characterization of abelian normal subloops. We highlight the analogies between well known central extensions and central nilpotence on…

Group Theory · Mathematics 2015-09-21 David Stanovský , Petr Vojtěchovský

In this paper we consider the state complexity of an operation on formal languages, root(L). This naturally entails the discussion of the monoid of transformations of a finite set. We obtain good upper and lower bounds on the state…

Group Theory · Mathematics 2007-05-23 Bryan Krawetz , John Lawrence , Jeffery Shallit

In this paper, we explore the descriptive complexity theory of finite groups by examining the power of the second Ehrenfeucht--Fra\"iss\'e bijective pebble game in Hella's (Ann. Pure Appl. Log., 1989) hierarchy. This is a…

Logic in Computer Science · Computer Science 2025-11-12 Joshua A. Grochow , Michael Levet

We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.

Combinatorics · Mathematics 2023-06-22 Adam Borchert , Narad Rampersad

We determine continuous bijections $f$, acting on a real interval into itself, whose $k$-fold iterate is the quasi-arithmetic mean of all its subsequent iterates from $f^0$ up to $f^n$ (where $0\le k\le n$). Namely, we prove that if at most…

Classical Analysis and ODEs · Mathematics 2018-02-21 Szyman Draga , Janusz Morawiec

The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden's theorem, they proved that if a word avoids Abelian…

Combinatorics · Mathematics 2010-05-17 Julien Cassaigne , Gwénaël Richomme , Kalle Saari , Luca Q. Zamboni

We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must have given properties. Waring's problem over finite fields…

Combinatorics · Mathematics 2017-10-19 Zhicheng Gao , Andrew MacFie , Qiang Wang

We determine normal forms for the Kummer surfaces associated with abelian surfaces of polarization of type $(1,1)$, $(1,2)$, $(2,2)$, $(2,4)$, and $(1,4)$. Explicit formulas for coordinates and moduli parameters in terms of Theta functions…

Algebraic Geometry · Mathematics 2022-05-31 Adrian Clingher , Andreas Malmendier

We show that the spaces of transfinite words, namely ordinal-indexed words, over a Noetherian space, is also Noetherian, under a natural topology which we call the regular subword topology. We characterize its sobrification and its…

General Topology · Mathematics 2023-03-24 Jean Goubault-Larrecq , Simon Halfon , Aliaume Lopez

We classify, up to isomorphism and up to equivalence, division gradings (by abelian groups) on finite-dimensional simple real algebras. Gradings on finite-dimensional simple algebras are determined by division gradings, so our results give…

Rings and Algebras · Mathematics 2015-12-23 Adrián Rodrigo-Escudero

An abelian anti-power of order $k$ (or simply an abelian $k$-anti-power) is a concatenation of $k$ consecutive words of the same length having pairwise distinct Parikh vectors. This definition generalizes to the abelian setting the notion…

Combinatorics · Mathematics 2019-03-26 Gabriele Fici , Mickael Postic , Manuel Silva