Related papers: Synchronizing automatic sequences along Piatetski-…
Let $\gamma<1<c$ and $19(c-1)+171(1-\gamma)<9$. In this paper, we establish an asymptotic formula for exponential sums over Piatetski-Shapiro primes $p=[n^{1/\gamma}]$ in arithmetic progressions.
We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…
Let $f$ be a power series with positive radius of convergence. In the present paper, we study the phenomenon of overconvergence of sequences of classical Pade' approximants pi{n,m_n} associated with f, where m(n)<=m(n+1)<=m(n) and m(n) =…
In this paper we prove that a uniformly distributed random circular automaton $\mathcal{A}_n$ of order $n$ synchronizes with high probability (whp). More precisely, we prove that $$ \mathbb{P}\left[\mathcal{A}_n \text{ synchronizes}\right]…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
An extension of the synchronous parallel kinetic Monte Carlo (pkMC) algorithm developed by Martinez {\it et al} [{\it J.\ Comp.\ Phys.} {\bf 227} (2008) 3804] to discrete lattices is presented. The method solves the master equation…
Suppose that $\alpha_1, \alpha_2,\beta_1, \beta_2 \in\mathbb{R}$. Let $\alpha_1, \alpha_2 > 1$ be irrational and of finite type such that $1, \alpha_1^{-1}, \alpha_2^{-1}$ are linearly independent over $\mathbb{Q}$. Let $c$ be a real number…
We represent the number of mxn non-negative integer matrices (contingency tables) with prescribed row sums and column sums as the expected value of the permanent of a non-negative random matrix with exponentially distributed entries. We…
We describe an algorithm for the sequential sampling of entries in multiway contingency tables with given constraints. The algorithm can be used for computations in exact conditional inference. To justify the algorithm, a theory relates…
We investigate the constrained synchronization problem for weakly acyclic, or partially ordered, input automata. We show that, for input automata of this type, the problem is always in NP. Furthermore, we give a full classification of the…
We extend to Segal-Piatetski-Shapiro sequences previous results on the Luca-Schinzel question over integral valued polynomial sequences. Namely, we prove that for any real $c$ larger than $1$ the sequence $(\sum_{m\le n} \varphi(\lfloor m^c…
We shall prove a convergence result relative to sequences of Minkowski symmetrals of general compact sets. In particular, we investigate the case when this process is induced by sequences of subspaces whose elements belong to a finite…
In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algorithms satisfy lattice-linearity, where these algorithms…
We discuss an interesting sequence defined recursively; namely, sequence A105774 from the On-Line Encyclopedia of Integer Sequences, and study some of its properties. Our main tools are Fibonacci representation, finite automata, and the…
We study real numbers defined by multidimensional automatic arrays weighted by multiplicatively independent bases. Let $a_1, \dots, a_r\geq 2$ be integers such that $\log a_1, \dots, \log a_r$ are $\mathbb Q$-linearly independent. Given…
We bound Kloosterman-like sums of the shape \[ \sum_{n=1}^N \exp(2\pi i (x \lfloor f(n)\rfloor+ y \lfloor f(n)\rfloor^{-1})/p), \] with integers parts of a real-valued, twice-differentiable function $f$ is satisfying a certain limit…
An achievement set of a series is a set of all its subsums. We study the properties of achievement sets of conditionally convergent series in finite dimensional spaces. The purpose of the paper is to answer some of the open problems…
Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix…
We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed $k \in \mathbb{N}$ and $\varepsilon > 0$, we show that the non-adaptive query complexity of finding a length-$k$…