English
Related papers

Related papers: The abelian complexity of the paperfolding word

200 papers

We consider an integrable system in five unknowns having three quartics invariants. We show that the complex affine variety defined by putting these invariants equal to generic constants, completes into an abelian surface; the jacobian of a…

Exactly Solvable and Integrable Systems · Physics 2007-06-25 A. Lesfari

In this paper we investigate local to global phenomena for a new family of complexity functions of infinite words indexed by $k \in \Ni \cup \{+\infty\}$ where $\Ni$ denotes the set of positive integers. Two finite words $u$ and $v$ in…

Combinatorics · Mathematics 2013-02-18 Juhani Karhumäki , Aleksi Saarela , Luca. Q. Zamboni

The theory of asymptotic complexity provides an approach to characterizing the behavior of programs in terms of bounds on the number of computational steps executed or use of computational resources. We describe work using ACL2 to prove…

Computational Complexity · Computer Science 2022-05-25 William D. Young

We give a classification of all principally polarized abelian surfaces that admit an $(l,l)$-isogeny to themselves, and show how to compute all the abelian surfaces that occur. We make the classification explicit in the simplest case $l=2$.…

Algebraic Geometry · Mathematics 2013-02-13 Reinier Broker , Kristin Lauter , Marco Streng

Let G be a finite solvable permutation group. Then modulo a possibly trivial normal elementary abelian 3-subgroup, some set-stabilizer in G is a 2-group.

Group Theory · Mathematics 2025-07-01 David Gluck

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square…

Discrete Mathematics · Computer Science 2015-06-12 Gabriele Fici , Filippo Mignosi

We give some easy necessary and sufficient criteria for twists of abelian varieties by Artin representations to be simple.

Number Theory · Mathematics 2016-07-21 Alex Bartel

We introduce new avoidability problems for words by considering equivalence relations, k-abelian equivalences, which lie properly in between equality and commutative equality, i.e. abelian equality. For two k-abelian equivalent words the…

Combinatorics · Mathematics 2015-03-19 Mari Huova , Juhani Karhumäki

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

Computational Complexity · Computer Science 2010-06-29 Nadia Creignou , Johannes Schmidt , Michael Thomas

We consider degenerations of all simple Lie algebras of exceptional type obtained by embedding into affine Lie algebras. We give a filtration to consider this as an abelianisation of the original Lie algebra. We then show that the…

Representation Theory · Mathematics 2022-11-29 Shreepranav Varma Enugandla

Sturmian sequences are well-known as the ones having minimal complexity over a 2-letter alphabet. They are also the balanced sequences over a 2-letter alphabet and the sequences describing discrete lines. They are famous and have been…

Combinatorics · Mathematics 2009-04-24 Genevieve Paquin

We classify all the surfaces of general type whose canonical map is composed with a pencil if they are the quotient of the diagonal action by an Abelian group acting over the product of two curves. As far as we know all the previous…

Algebraic Geometry · Mathematics 2007-05-23 Francesco Zucconi

We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on words. The extension is based on…

Discrete Mathematics · Computer Science 2023-01-02 Gabriele Fici , Svetlana Puzynina

We use mathematical induction to prove that the horizontal composition in the class of coherently diagonal complexes is indeed a binary operation. That is to say, the embedding of two coherently diagonal complexes in an alternating planar…

Geometric Topology · Mathematics 2013-05-08 Hernando Burgos-Soto

In this paper we get two new classes of regular sequences in the polynomial ring over the field of complex numbers.

Commutative Algebra · Mathematics 2015-03-25 Ri-Xiang Chen

We consider rotations on the torus $\mathbb{T}^2$, and we classify them with respect to the complexity functions. In dimension one, a minimal rotation can be coded by a sturmian word. A sturmian word has complexity $n+1$ by the…

Dynamical Systems · Mathematics 2012-05-24 Nicolas Bédaride

We study some non-semisimple representations of affine Temperley--Lieb algebras and related cellular algebras. In particular, we classify extensions between simple standard modules. Moreover, we construct a completion which is an infinite…

Representation Theory · Mathematics 2007-05-23 K. Erdmann , R. M. Green

We introduce the notion of Mukai regularity (M-regularity) for coherent sheaves on abelian varieties. The definition is based on the Fourier-Mukai transform, and in a special case depending on the choice of a polarization it parallels and…

Algebraic Geometry · Mathematics 2007-05-23 Giuseppe Pareschi , Mihnea Popa

We prove the modularity of a positive proportion of abelian surfaces over $\mathbf{Q}$. More precisely, we prove the modularity of abelian surfaces which are ordinary at $3$ and are $3$-distinguished, subject to some assumptions on the…

Number Theory · Mathematics 2025-03-03 George Boxer , Frank Calegari , Toby Gee , Vincent Pilloni

The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as…

Formal Languages and Automata Theory · Computer Science 2011-11-21 Janusz Brzozowski , Baiyu Li , Yuli Ye
‹ Prev 1 4 5 6 7 8 10 Next ›