Related papers: A bias parity question for Sturmian words
We consider the classical problem of discrete distribution estimation using i.i.d. samples in a novel scenario where additional side information is available on the distribution. In large alphabet datasets such as text corpora, such side…
We give a criterion for a real divisor to be rational and semiample.
Many natural counting problems arise in connection with the normal form of braids--and seem to have never been considered so far. Here we solve some of them by analysing the normality condition in terms of the associated permutations, their…
A divide-and-conquer cryptanalysis can often be mounted against some keystream generators composed of several (nonlinear) independent devices combined by a Boolean function. In particular, any parity-check relation derived from the periods…
We study a novel class of affine invariant and consistent tests for normality in any dimension. The tests are based on a characterization of the standard $d$-variate normal distribution as the unique solution of an initial value problem of…
We introduce a general result relating "short averages" of a multiplicative function to "long averages" which are well understood. This result has several consequences. First, for the M\"obius function we show that there are cancellations…
We improve using elementary means an explicit bound on the divisor function due to Friedlander and Iwaniec. Consequently we modestly improve a result regarding a sieving inequality for Gaussian sequences.
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.
The concentration inequality approach for normal approximation by Stein's method is generalized to the multivariate setting. We use this approach to prove a non-smooth function distance for multivariate normal approximation for standardized…
We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are…
We present an analysis of the performance of machine learning classifiers on discriminating between similar languages and language varieties. We carried out a number of experiments using the results of the two editions of the Discriminating…
We study the implicit bias of AdaGrad on separable linear classification problems. We show that AdaGrad converges to a direction that can be characterized as the solution of a quadratic optimization problem with the same feasible set as the…
Mirror Descent is a popular algorithm, that extends Gradients Descent (GD) beyond the Euclidean geometry. One of its benefits is to enable strong convergence guarantees through smooth-like analyses, even for objectives with exploding or…
We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…
We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to discover morphologically related pairs by looking for pairs…
We introduce the theory of normal ordered grammars, which gives a natural generalization of the normal ordering problem. To illustrate the main idea, we explore normal ordered grammars associated with the Eulerian polynomials and the…
According to a general probabilistic principle, the natural divisors of friable integers (i.e.~free of large prime factors) should normally present a Gaussian distribution. We show that this indeed is the case with conditional density…
Consider the model where we can access a parity function through random uniform labeled examples in the presence of random classification noise. In this paper, we show that approximating the number of relevant variables in the parity…
We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…