Related papers: Asymptotic behavior of growth functions of D0L-sys…

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

For every smooth proper scheme over a finite field $\mathbb{F}_q$, Bilu, Ho, Srinivasan, Vogt, and Wickelgren introduced the dlog zeta function with coefficients in the Grothendieck-Witt ring $\mathrm{GW}(\mathbb{F}_q)$, enriching the dlog…

Given an orientation-preserving diffeomorphism of the interval [0;1], consider the uniform norm of the differential of its n-th iteration. We get a function of n called the growth sequence. Its asymptotic behaviour is an interesting…

We have made a systematic numerical study of the 16 Wilf classes of length-5 classical pattern-avoiding permutations from their generating function coefficients. We have extended the number of known coefficients in fourteen of the sixteen…

Let $S=\langle a_1,\ldots,a_p\rangle$ be a numerical semigroup, $s\in S$ and ${\sf z}(s)$ its set of factorizations. The set of length is denoted by ${\mathcal L}(s)=\{{\tt L}(x_1,\dots,x_p)\mid (x_1,\dots,x_p)\in{\sf Z}(s)\}$ where ${\tt…

Let $A$ be an abelian variety over a global field $K$ of characteristic $p \ge 0$. If $A$ has nontrivial (resp. full) $K$-rational $l$-torsion for a prime $l \neq p$, we exploit the fppf cohomological interpretation of the $l$-Selmer group…

In combinatorics on words, a word w over an alphabet Sigma is said to avoid a pattern p over an alphabet Delta if there is no factor x of w and no non-erasing morphism h from Delta^* to Sigma^* such that h(p) = x. Bell and Goh have recently…

In this paper, we study a series of algorithmic problems related to the subsequences occurring in the strings of a given language, under the assumption that this language is succinctly represented by a grammar generating it, or an automaton…

This paper explores the expressive power of deep neural networks through the framework of function compositions. We demonstrate that the repeated compositions of a single fixed-size ReLU network exhibit surprising expressive power, despite…

Let $\sum a_nx^n\in\bar{\mathbb{Q}}[[x]]$ be the power series representation of a rational function and let $f:\ \{0,1,\ldots\}\rightarrow \bar{\mathbb{Q}}$ be a so-called almost quasi-polynomial. Under a necessary stability condition, we…

We conjecture that the p-adic L-function of a non-trivial irreducible even Artin character over a totally real field is non-zero at all non-zero integers. This implies that a conjecture formulated by Coates and Lichtenbaum at negative…

We demonstrate how negative powers of screenings arise as a nonperturbative effect within the operator approach to Liouville theory. This explains the origin of the corresponding poles in the exact Liouville three point function proposed by…

Dynamic Topological Logic (DTL) is a multimodal system for reasoning about dynamical systems. It is defined semantically and, as such, most of the work done in the field has been model-theoretic. In particular, the problem of finding a…

For a family $\mathcal{F}$ of graphs, $sat(n,\mathcal{F})$ is the minimum number of edges in a graph $G$ on $n$ vertices which does not contain any of the graphs in $\mathcal{F}$ but such that adding any new edge to $G$ creates a graph in…

A group presentation is said to have rational growth if the generating series associated to its growth function represents a rational function. A long-standing open question asks whether the Heisenberg group has rational growth for all…

Let $p$ be an odd prime, $F$ be a number field and consider a uniform infinite pro-$p$ extension $F_\infty$ of $F$ with Galois group $G=Gal(F_\infty/F)$. Let \[G=G_0\supset G_1\supset\dots \supset G_n\supset G_{n+1}\supset \dots\] be the…

The rational base number system, introduced by Akiyama, Frougny, and Sakarovitch in 2008, is a generalization of the classical integer base number system. Within this framework two interesting families of infinite words emerge, called…

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of the rationals from a dynamical systems point of view, somehow continuing along the path started in [BI]. We obtain in…

This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…