Related papers: A bias parity question for Sturmian words
An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…
We generalize a positivity constraint derived initially for parity-conserving processes to the parity-violating ones, and use it to derive non-trivial bounds on several Sivers functions, entering in the theoretical description of single…
We study supervised learning problems that have significant effects on individuals from two demographic groups, and we seek predictors that are fair with respect to a group fairness criterion such as statistical parity (SP). A predictor is…
A binary word is a map W : N --> {0,1}, and the set of factors of W with length n is F_n(W):={(W(i),W(i+1),...,W(i+n-1)) : i >= 0}. A word is Sturmian if |F_n(W)|=n+1 for every n>0. We show that the sum of the heights (also known as hamming…
We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture…
The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other. Our main result is decidability, and PSpace-completeness, of the regular separability…
In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…
We exactly solve a Fokker-Planck equation by determining its eigenvalues and eigenfunctions: we construct nonlinear second-order differential operators which act as raising and lowering operators, generating ladder spectra for the odd and…
We prove an inequality for the number of periods in a word x in terms of the length of x and its initial critical exponent. Next, we characterize all periods of the length-n prefix of a characteristic Sturmian word in terms of the lazy…
The purpose of this paper is to investigate the connection between context-free grammars and normal ordering problem, and then to explore various extensions of the Stirling grammar. We present grammatical characterizations of several well…
We give asymptotics for shifted convolutions of the form $$\sum_{n < X} \frac{\sigma_{2u}(n,\chi)\sigma_{2v}(n+k,\psi)}{n^{u+v}}$$ for nonzero complex numbers $u,v$ and nontrivial Dirichlet characters $\chi,\psi$. We use the technique of…
We reduce the problem of the projective normality of polarized abelian varieties to check the rank of very explicit matrices. This allow us to prove some results on normal generation of primitive line bundles on abelian threefolds and…
We extend the sum-of-divisors function to the complex plane via the Gaussian integers. Then we prove a modified form of Euler's classification of odd perfect numbers.
The equivalence problem for unambiguous grammars is an important, but very difficult open question in formal language theory. Consider the \emph{limited} equivalence problem for unambiguous grammars -- for two unambiguous grammars $G_1$ and…
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words with an infinity of pseudopalindromic prefixes, called…
Vector space models of words have long been claimed to capture linguistic regularities as simple vector translations, but problems have been raised with this claim. We decompose and empirically analyze the classic arithmetic word analogy…
Given a regular language $L$, we study the language of words $\mathsf{D}(L)$, that distinguish between pairs of different left-quotients of $L$. We characterize this distinguishability operation, show that its iteration has always a fixed…
There have been several efforts to extend distributional semantics beyond individual words, to measure the similarity of word pairs, phrases, and sentences (briefly, tuples; ordered sets of words, contiguous or noncontiguous). One way to…
Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…
In many applications, SMT solvers are utilized to solve similar or identical tasks over time. Significant variations in performance due to small changes in the input are not uncommon and lead to frustration for users. This sort of stability…