Related papers: Algebraic power series and their automatic complex…

In the present work, we lay out a new theory showing that all automata can always be co-lexicographically partially ordered, and an intrinsic measure of their complexity can be defined and effectively determined, namely, the minimum width…

We show that a sequence over a finite field $\mathbb F_q$ of characteristic $p$ is $p$-automatic if and only if it occurs as a column of the spacetime diagram, with eventually periodic initial conditions, of a linear cellular automaton with…

Automata provide a decision procedure for Presburger arithmetic. However, until now only crude lower and upper bounds were known on the sizes of the automata produced by this approach. In this paper, we prove an upper bound on the the…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

Let $p$ be a prime. We say that a pro-$p$ group is self-similar of index $p^k$ if it admits a faithful self-similar action on a $p^k$-ary regular rooted tree such that the action is transitive on the first level. The self-similarity index…

A semialgebraic bijection from the field of p-adic numbers to itself minus one point is constructed. Semialgebraic p-adic sets are classified up to semialgebraic bijection. A cell decomposition theorem for restricted analytic p-adic maps is…

We provide a new proof of the multivariate version of Christol's theorem about algebraic power series with coefficients in finite fields, as well as of its extension to perfect ground fields of positive characteristic obtained independently…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

This is a review of several results related to distribution of powers and combination of powers modulo 1. We include a proof that given a sequence of real numbers $\theta_n$, it is possible to get an $\alpha$ (given $\lambda \ne 0$), or a…

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

Continued fraction expansions and Hankel determinants of automatic sequences are extensively studied during the last two decades. These studies found applications in number theory in evaluating irrationality exponents. The present paper is…

This work is devoted to study of algebraicty modulo p of Siegel's G-functions. Our goal is to emphasize the relevance of the notion of strong Frobenius structure, clasically studied in the theory of the p-adic diffenrential equations, for…

In this paper we obtain complexity bounds for computational problems on algebraic power series over several commuting variables. The power series are specified by systems of polynomial equations: a formalism closely related to weighted…

In an earlier work, the first author and Petsche solved an energy minimization problem for local fields and used the result to obtain lower bounds on the height of algebraic numbers all whose conjugates lie in various local fields, such as…

The algebra ${\mathsf A}_q$ of Steenrod $q$th powers, where $q = p^e$ is a power of a prime $p$, is isomorphic to a subalgebra ${\mathsf A}'_q$ of the algebra of Steenrod $p$th powers ${\mathsf A}_p$. The filtration of ${\mathsf A}_p$ by…

Let $p(x) \in C(x)$ be a rational function satisfying the condition $p(0)=1$ and $q$ an integer larger than $1$, in this article we will consider the power expansion of the infinite product…

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

Let $q=p^\alpha$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof…

Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…