English
Related papers

Related papers: Automatic Abelian Complexities of Parikh-Collinear…

200 papers

In this paper we investigate fixed-point numbers and entropies of endomorphisms on abelian varieties. It was shown quite recently that the number of fixed-points of an iterated endomorphism on a simple complex torus is either periodic or…

Algebraic Geometry · Mathematics 2017-06-20 Thorsten Herrig

We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of…

Algebraic Geometry · Mathematics 2007-05-23 Jean-Philippe Monnier

We give a way to construct group of pseudo-automorphisms of rational varieties of any dimension that fix pointwise the image of a cubic hypersurface of $P^n. These group are free products of involutions, and most of their elements have…

Dynamical Systems · Mathematics 2014-05-14 Jérémy Blanc

The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regarding the deterministic advice complexity of the P-selective sets--i.e., the amount of Karp--Lipton advice needed for polynomial-time machines…

Computational Complexity · Computer Science 2007-05-23 Lane A. Hemaspaandra , Harald Hempel , Arfst Nickelsen

We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.

Logic · Mathematics 2026-05-21 James Schmerl

We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…

Logic · Mathematics 2012-01-24 Raf Cluckers , Immanuel Halupczok

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…

Formal Languages and Automata Theory · Computer Science 2014-04-28 Fabian Reiter

Quasi-interpretations are a technique to guarantee complexity bounds on first-order functional programs: with termination orderings they give in particular a sufficient condition for a program to be executable in polynomial time, called…

Programming Languages · Computer Science 2007-05-23 Patrick Baillot , Ugo Dal Lago , Jean-Yves Moyen

Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the…

Logic in Computer Science · Computer Science 2023-02-14 Pascal Bergsträßer , Moses Ganardi , Anthony W. Lin , Georg Zetzsche

The Resolution Theorem for Compact Abelian Groups is applied to show that the profinite subgroups of a finite-dimensional compact connected abelian group (protorus) which induce tori quotients comprise a lattice under intersection (meet)…

Group Theory · Mathematics 2025-03-28 Wayne Lewis

We associate a combinatorial object to sequences of point blow-ups over perfect fields, the weighted directed graph, and another one to the composition of all blow-ups, which we call associated sequential morphisms, the $d-$ary intersection…

Algebraic Geometry · Mathematics 2025-09-30 Daniel Camazón , Santiago Encinas

In a \emph{separability problem}, we are given two sets $K$ and $L$ from a class $\mathcal{C}$, and we want to decide whether there exists a set $S$ from a class $\mathcal{S}$ such that $K\subseteq S$ and $S\cap L=\emptyset$. In this case,…

Formal Languages and Automata Theory · Computer Science 2025-07-02 Elias Rojas Collins , Chris Köcher , Georg Zetzsche

We extend the fixed point result for Path-Averaged Contractions (PA-contractions) from complete metric spaces to complete b-metric spaces. We prove that every PA-contraction on a complete b-metric space has a unique fixed point, provided…

Functional Analysis · Mathematics 2025-12-25 Nicola Fabiano

We compare pushdown automata (PDAs for short) against other representations. First, we show that there is a family of PDAs over a unary alphabet with $n$ states and $p \geq 2n + 4$ stack symbols that accepts one single long word for which…

Formal Languages and Automata Theory · Computer Science 2017-06-27 Pierre Ganty , Elena Gutiérrez

Macbeath gave a formula for the number of fixed points for each non-identity element of a cyclic group of automorphisms of a compact Riemann surface in terms of the universal covering transformation group of the cyclic group. We observe…

Geometric Topology · Mathematics 2016-09-07 M. Izquierdo , D. Singerman

We describe an automated method for identifying classes of morphologically related words in an on-line dictionary, and for linking individual senses in the derived form to one or more senses in the base form by means of morphological…

cmp-lg · Computer Science 2008-02-03 Joseph Pentheroudakis , Lucy Vanderwende , Microsoft Corporation

We consider an Abel polynomial differential equation. For two given points a and b, the "Poincare mapping" of the equation transforms the values of its solution at a into their values at b. In this article, we study global analytic…

Classical Analysis and ODEs · Mathematics 2007-05-23 J. -P. Francoise , N. Roytvarf , Y. Yomdin

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…

Number Theory · Mathematics 2017-06-19 Patrick Ingram

This work presents the conjugacy classes of finite abelian subgroups of the Cremona group of the plane. Using a well-known theory, this problem amounts to the study of automorphism groups of some Del Pezzo surfaces and conic bundles. We…

Algebraic Geometry · Mathematics 2007-05-23 Jérémy Blanc

We show that the epimorphism problem is solvable for targets that are virtually cyclic or a product of an Abelian group and a finite group.

Group Theory · Mathematics 2021-03-24 Stefan Friedl , Clara Loeh
‹ Prev 1 4 5 6 7 8 10 Next ›