Related papers: Transition mean values of real characters

Words can be represented by composing the representations of subword units such as word segments, characters, and/or character n-grams. While such representations are effective and may capture the morphological regularities of words, they…

We investigate the variance of the length of the longest common subsequences of two independent random words of size $n$, where the letters of one word are i.i.d. uniformly drawn from $\{\alpha_1, \alpha_2, \cdots, \alpha_m\}$, while the…

In this paper, we analyze the set of all possible aggregate distributions of the sum of standard uniform random variables, a simply stated yet challenging problem in the literature of distributions with given margins. Our main results are…

We establish new bounds on character values and character ratios for finite groups $G$ of Lie type, which are considerably stronger than previously known bounds, and which are best possible in many cases. These bounds have the form…

In this paper, we consider the sums of non-negative integer valued $m$-dependent random variables, and its approximation to the power series distribution. We first discuss some relevant results for power series distribution such as Stein…

Given a string $P$ of length $m$ over an alphabet $\Sigma$ of size $\sigma$, a swapped version of $P$ is a string derived from $P$ by a series of local swaps, i.e., swaps of adjacent symbols, such that each symbol can participate in at most…

We examine the complexity of basic regular operations on languages represented by Boolean and alternating finite automata. We get tight upper bounds m+n and m+n+1 for union, intersection, and difference, 2^m+n and 2^m+n+1 for concatenation,…

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

In this paper, we use a modular form approach to evaluate the convolution sums $\sum_{l+42m=n}\sigma (l)\sigma (m)$, $\sum_{2l+21m=n}\sigma (l)\sigma (m),$ $\sum_{3l+14m=n}\sigma (l)\sigma (m)$ and $\sum_{6l+7m=n}\sigma (l)\sigma (m) $ for…

For all natural numbers $n$, we discuss the evaluation of the convolution sum, $\underset{\substack{{(l,m) \in \mathbb{N}_0^2} \\ {\alpha\,l+\beta\,m=n} } }{\sum}\sigma(l)\sigma(m)$, where $\alpha\beta=14,22,26$. We generalize the…

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

We investigate various mean value problems involving order three primitive Dirichlet characters. In particular, we obtain an asymptotic formula for the first moment of central values of the Dirichlet L-functions associated to this family,…

In this paper, we discuss some well-known results and some open problems of the theory of $\sigma$-properties of a group related to the study of generalized $T$-groups.

Let $p$ be a prime. We prove bounds on short Dirichlet character sums evaluated at a class of homogeneous polynomials in arbitrary dimensions. In every dimension, this bound is nontrivial for sums over boxes with side lengths as short as…

The length of the longest common subsequences (LCSs) is often used as a similarity measurement to compare two (or more) random words. Below we study its statistical behavior in mean and variance using a Monte-Carlo approach from which we…

The paper is concerned with approximating the distribution of a sum W of n integer valued random variables Y_i, whose distributions depend on the state of an underlying Markov chain X. The approximation is in terms of a translated Poisson…

Let $\beta >1$ be an integer or generally a Pisot number. Put $T(x) = \{ \beta x \}$ on $[0,1]$ and let $S: [0,1]\to [0,1]$ be a piecewise linear transformation whose slopes have the form $\pm \beta^m$ with positive integers $m$. We give…

We study the ability of transformer-based language models (LMs) to understand social media language. Social media (SM) language is distinct from standard written language, yet existing benchmarks fall short of capturing LM performance in…

We study additive double character sums over two subsets of a finite field. We show that if there is a suitable rational self-map of small degree of a set $D$, then this set contains a large subset $U$ for which the standard bound on the…

We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…