Related papers: $SL_4$-Kloosterman sum via the Bruhat decompositio…
We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…
We consider the distribution of polygonal paths joining the partial sums of normalized Kloosterman sums modulo an increasingly high power p^n of a fixed odd prime p, a pure depth-aspect analogue of theorems of Kowalski-Sawin and…
These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…
We define a family of natural decompositions of Sturmian words in Christoffel words, called *reversible Christoffel* (RC) factorizations. They arise from the observation that two Sturmian words with the same language have (almost always)…
In a previous work (arXiv:2505.05574), a summation formula for harmonic Maass forms of polynomial growth was established. In this note, we use the theory of $L$-series of harmonic Maass forms to state and prove a summation formula for such…
This is a rework of our old file, which has been left unpublished since September 1994, on an explicit spectral decomposition of the fourth power moment of the Riemann zeta-function against a weight which is the square of a Dirichlet…
We revisit recent work of Heath-Brown on the average order of the quantity r(L_1)r(L_2)r(L_3)r(L_4), for suitable binary linear forms L_1,..., L_4, for integers ranging over quite general regions. In addition to improving the error term in…
We prove a precise formula for the minimal number K(n) such that every binary word of length $n$ can be divided into K(n) palindromes. Also we estimate the average number $\ol K(n)$ of palindromes composing a random binary word of the…
One of the major problems with text simplification is the lack of high-quality data. The sources of simplification datasets are limited to Wikipedia and Newsela, restricting further development of this field. In this paper, we analyzed the…
The height of a piecewise-testable language $L$ is the maximum length of the words needed to define $L$ by excluding and requiring given subwords. The height of $L$ is an important descriptive complexity measure that has not yet been…
We define "splitting functions of level l" for any integer l>0. These functions generalize Dwork's splitting functions : they allow us to represent additive characters of order $p^l$. Then we use these functions to obtain a Stickleberger…
In this paper, we construct the binary linear codes $C(SL(n,q))$ associated with finite special linear groups $SL(n,q)$, with both \emph{n,q} powers of two. Then, via Pless power moment identity and utilizing our previous result on the…
We provide and discuss complex analytic methods for overcoming the formal character of formal deformation quantization. This is a necessity for returning to physically meaningful statements, and accounts for the fact that the formal…
The main purpose of this Note is to provide a non-trivial bound on certain Kloosterman sums as considered in the recent paper of E. Fouvry [F], leading to a small improvement of his result on the Pell equation.
We give an algorithm for working out the indecomposable direct summands in a Krull--Schmidt decomposition of a tensor product of two simple modules for G=SL_3 in characteristics 2 and 3. It is shown that there is a finite family of modules…
We survey current term-wise techniques for quadratizing high-degree pseudo-Boolean functions and introduce a new one, which allows multiple splits of terms. We also introduce the first aggregative approach, which splits a collection of…
We construct a binary linear code $C(O(3,q))$, associated with the orthogonal group $O(3,q)$. Here $q$ is a power of two. Then we obtain a recursive formula for the odd power moments of Kloosterman sums with trace one arguments in terms of…
The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…
In this paper two ways to compute singular values are presented which use Cholesky decomposition as their basic operation.
The problem of writing a totally positive element as a sum of squares has a long history in mathematics, going back to Bachet and Lagrange. While for some specific rings (like integers or polynomials over the rationals), there are known…