Related papers: The abelian complexity of the paperfolding word

Using the Polya Enumeration Theorem, we count with particular attention to C^3/Gamma up to C^6/Gamma, abelian orbifolds in various dimensions which are invariant under cycles of the permutation group S_D. This produces a collection of…

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

We investigate Abelian primitive words, which are words that are not Abelian powers. We show that unlike classical primitive words, the set of Abelian primitive words is not context-free. We can determine whether a word is Abelian primitive…

We prove lower bounds on the length of regular expressions for finite languages by methods from arithmetic circuit complexity. First, we show a reduction: the length of a regular expression for a language $L\subseteq \{0,1\}^n$ is bounded…

Let A be a finitely generated associative algebra over an algebraically closed field. We characterize the finite dimensional modules over A whose orbit closures are regular varieties.

We define a subgroup of the universal sofic group, obtained as the normaliser of a separable abelian subalgebra. This subgroup can be obtained as an extension by the group of automorphisms on a standard probability space. We show that each…

We say that a formal power series $\sum a_n z^n$ with rational coefficients is a 2-function if the numerator of the fraction $a_{n/p}-p^2 a_n$ is divisible by $p^2$ for every prime number $p$. One can prove that 2-functions with rational…

Let S be a smooth irreducible curve defined over a number field k and consider an abelian scheme A over S and a curve C inside A, both defined over k. In previous works, we proved that when A is a fibered product of elliptic schemes, if C…

Ackermann's function can be expressed using an iterative algorithm, which essentially takes the form of a term rewriting system. Although the termination of this algorithm is far from obvious, its equivalence to the traditional recursive…

We give a general description of the structure of a discrete double groupoid (with an extra, quite natural, filling condition) in terms of groupoid factorizations and groupoid 2-cocycles with coefficients in abelian group bundles. Our…

It is proved that the number of deformation types of complex structures on a fixed oriented smooth four-manifold can be arbitrarily large. The considered examples are locally simple abelian covers of rational surfaces.

In this paper we consider the simplest class of Appell's functions, and obtain their explicit formulas and modular transformation properties and asymptotic behaviors.

The binary $k$-dimensional simplex code is known to be a $2^{k-1}$-batch code and is conjectured to be a $2^{k-1}$-functional batch code. Here, we offer a simple, constructive proof of a result that is "in between" these two properties. Our…

Using orbifold metrics of the appropriately signed Ricci curvature on orbifolds with negative or numerically trivial canonical bundle and the two-dimensional Log Minimal Model Program, we prove that the fundamental group of special compact…

For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

We provide a lower bound on the complexity function of a typical (in the Lebesgue measure sence) right triangular billiard.

If X is a CW complex, one can assign to each point of X an ordered abelian group of finite rank whose subset of positive elements depends continuously on the points of X. A locally trivial bundle which arises in this way we denote by E(X).…

We investigate the possibility of embedding minimal abelian surfaces in smooth toric 4-folds with Picard number 2. The existence of such an embedding imposes conditions on the 4-fold, which we partly describe. On the other hand, we exhibit…

Prefix normal words are binary words that have no factor with more $1$s than the prefix of the same length. Finite prefix normal words were introduced in [Fici and Lipt\'ak, DLT 2011]. In this paper, we study infinite prefix normal words…