Related papers: Automatic Bounds on Constant Term Sequences Modulo…

Denote by $K_p(n,k)$ the random subgraph of the usual Kneser graph $K(n,k)$ in which edges appear independently, each with probability $p$. Answering a question of Bollob\'as, Narayanan, and Raigorodskii,we show that there is a fixed $p<1$…

We present in this paper a new method to deal with automatic sequences. This method allows us to prove a M\"obius-randomness-principle for automatic sequences from which we deduce the Sarnak conjecture for this class of sequences.…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

Let $\kappa$ be a regular limit cardinal, $\kappa \subseteq A$. We study a notion of $n$-s-stationarity on $\mathcal{P}_{\kappa}(A)$. We construct a sequence of topologies $\langle \tau_0, \tau_1, \dots \rangle $ on…

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

We give an alternative proof of the mod $p$ vanishing theorem by F.Fang of Seiberg-Witten invariants under a cyclic group action of prime order, and generalize it to the case when $b_1>0$. Although we also use the finite dimensional…

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…

In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…

The classical zero-one law for first-order logic on random graphs says that for any first-order sentence $\phi$ in the theory of graphs, as n approaches infinity, the probability that the random graph G(n, p) satisfies $\phi$ approaches…

The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…

A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…

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…

We consider the operator of taking the $2p$th derivative of a function with zero boundary conditions for the function and its first $p-1$ derivatives at two distinct points. Our main result provides an asymptotic formula for the eigenvalues…

Let $p \in (0,1/2)$ be fixed, and let $B_n(p)$ be an $n\times n$ random matrix with i.i.d. Bernoulli random variables with mean $p$. We show that for all $t \ge 0$, \[\mathbb{P}[s_n(B_n(p)) \le tn^{-1/2}] \le C_p t + 2n(1-p)^{n} + C_p…

A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…

On d\'emontre une conjecture due \`a N. Kuhn concernant la cohomologie singuli\`ere \`a coefficients mod p des espaces, comme module instable sur l'alg\`ebre de Steenrod. Notre d\'emonstration de ce r\'esultat, d\'ej\`a connu en…

Given a density t in (0,1], and a prime p, let S be any subset of F_p having at least tp elements, and having the least number of three-term arithmetic progressions mod p among all subsets of F_p with at least tp elements. Define N(t,p) to…

The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…