Related papers: A bias parity question for Sturmian words

We give a simplified presentation of the obstacle problem approach to stochastic homogenization for elliptic equations in nondivergence form. Our argument also applies to equations which depend on the gradient of the unknown function. In…

We consider the positive divisors of a natural number that do not exceed its square root, to which we refer as the {\it small divisors\/} of the natural number. We determine the asymptotic behavior of the arithmetic function that adds the…

For a random partition, one of the most basic questions is: what can one expect about the parts which arise? For example, what is the distribution of the parts of random partitions modulo $N$? Since most partitions contain a $1$, and indeed…

We obtain several asymptotic formulas for the sum of the divisor function $\tau(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced…

The ever-growing size of the foundation language model has brought significant performance gains in various types of downstream tasks. With the existence of side-effects brought about by the large size of the foundation language model such…

Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…

Recently Tao, Croot and Helfgott invented an algorithm to determine the parity of the number of primes in a given interval in O(x^{1/2-c+\eps}) steps for some absolute constant c. We propose a slightly different approach, which leads to the…

Efforts to apply transformer-based language models (TLMs) to the problem of reasoning in natural language have enjoyed ever-increasing success in recent years. The most fundamental task in this area to which nearly all others can be reduced…

Word embeddings derived from human-generated corpora inherit strong gender bias which can be further amplified by downstream models. Some commonly adopted debiasing approaches, including the seminal Hard Debias algorithm, apply…

An important step in standard renormalisation arguments involve convolution against a standard mollifier. As pointed out in (Punshon-Smith--Smith 2018), this generates second order commutator terms in equations with gradient-type noise.…

We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…

An odd deformation of a super Riemann surface $\mathcal S$ is a deformation of $\mathcal S$ by variables of odd parity. In this article we study the obstruction theory of these odd deformations $\mathcal X$ of $\mathcal S$. We view…

We prove an asymptotic formula for a variant of the binary additive divisor problem with linear factors in the arguments, which has a power saving error term and which is uniform in all involved parameters.

Let m>=1 be an arbitrary fixed integer and let N_m(x) count the number of odd integers u<=x such that the order of 2 modulo u is not divisible by m. In case m is prime estimates for N_m(x) were given by H. Mueller that were subsequently…

We establish a logarithmic stability inequality for the inverse problem of determining the non linear term, appearing in a semilinear BVP, from the corresponding Dirichlet-to-Neumann map (abbreviated to DtN map in the rest of this text).…

Bregman proximal point algorithm (BPPA) has witnessed emerging machine learning applications, yet its theoretical understanding has been largely unexplored. We study the computational properties of BPPA through learning linear classifiers…

The paper focuses on the automatic generating of the witnesses for the word equation satisfiability problem by means of specializing an interpreter which tests whether a composition of variable substitutions of a given word equation system…

Stationary determinantal point processes are proved to be Brillinger mixing. This property is an important step towards asymptotic statistics for these processes. As an important example, a central limit theorem for a wide class of…

In this note, we derive bounds on the median bias of univariate M-estimators under mild regularity conditions. These requirements are not sufficient to imply convergence in distribution of the M-estimators. We also discuss median bias of…

We study the problem of recognizing regular languages in a variant of the streaming model of computation, called the sliding window model. In this model, we are given a size of the sliding window $n$ and a stream of symbols. At each time…