Related papers: On the classification of Stanley sequences
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
We prove a general quantitative theorem on the asymptotic behavior of stochastic quasi-Fej\'er monotone sequences in a broad metric context. Concretely, our result explicitly constructs a rate of convergence for such process, both in mean…
N=1 no-scale models describe at tree level the spontaneous breaking of supersymmetry at an arbitrary scale m_{3/2}, with vanishing vacuum energy. We define N=1 super no-scale models in string theory as being those, which maintain these…
A subset of $[n] = \{1,2,\ldots,n\}$ is called stable if it forms an independent set in the cycle on the vertex set $[n]$. In 1978, Schrijver proved via a topological argument that for all integers $n$ and $k$ with $n \geq 2k$, the family…
Our goal in this article is to review the known properties of the mysterious Kolakoski sequence and at the same time look at generalizations of it over arbitrary two letter alphabets. Our primary focus will here be the case where one of the…
In the asymptotic analysis of regular sequences as defined by Allouche and Shallit, it is usually advisable to study their summatory function because the original sequence has a too fluctuating behaviour. It might be that the process of…
Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…
We consider the problem of sequential prediction and provide tools to study the minimax value of the associated game. Classical statistical learning theory provides several useful complexity measures to study learning with i.i.d. data. Our…
In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…
In this paper we generalize the concept of random networks to describe networks with non trivial features by a statistical mechanics approach. This framework is able to describe ensembles of undirected, directed as well as weighted…
We develop Ladyzhenskaya-Prodi-Serrin type spectral regularity criteria for 3D incompressible Navier-Stokes equations in a torus. Concretely, for any $N>0$, let $w_N$ be the sum of all spectral components of the velocity fields whose all…
A theta is a graph consisting of two non-adjacent vertices and three internally disjoint paths between them, each of length at least two. For a family $\mathcal{H}$ of graphs, we say a graph $G$ is $\mathcal{H}$-free if no induced subgraph…
Inspired by recent results of Ein, Lazarsfeld, Erman and Zhou on the non-vanishing of Betti numbers of high Veronese subrings, we describe the behaviour of the Betti numbers of Stanley-Reisner rings associated with iterated barycentric or…
Using a steady state process of node duplication and deletion we produce networks with 1/k scale-free degree distributions in the limit of vanishing connectance. This occurs even though there is no growth involved and inherent preferential…
The aim of this paper is to show a peculiar behavior of a (hypothetical) Collatz sequence going to infinity. We study the associated Syracusa sequence (the odd elements of the former) and show that the limit set of a conveniently normalized…
We give a motivation and gentle introduction into the regularity structure and model introduced by Otto, Sauer, Smith and Weber, which fall into the framework of Hairer, but have a greedier index set than the one given by trees. We do this…
We consider a class of nonlinear Schroedinger equation in three space dimensions with an attractive potential. The nonlinearity is local but rather general encompassing for the first time both subcritical and supercritical (in $L^2$)…
We study sequential multiple testing with independent data streams, where the goal is to identify an unknown subset of signals while controlling commonly used error metrics, including generalized familywise rates and false discovery and…
We propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called simplex triangulation networks(STNs) as they can be considered as a kind of…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…