Related papers: $SL_4$-Kloosterman sum via the Bruhat decompositio…
In this paper, we obtain a new class of $p$-ary binomial bent functions which are determined by Kloosterman sums. The bentness of another three classes of functions is characterized by some exponential sums and some results in…
The lambda-dilate of a set A is lambda*A={lambda a : a \in A}. We give an asymptotically sharp lower bound on the size of sumsets of the form lambda_1*A+...+lambda_k*A for arbitrary integers lambda_1,...,lambda_k and integer sets A. We also…
The Compositional Integral is defined, formally constructed, and discussed. A direct generalization of Riemann's construction of the integral; it is intended as an alternative way of looking at First Order Differential Equations. This brief…
Clustering a lexicon of words is a well-studied problem in natural language processing (NLP). Word clusters are used to deal with sparse data in statistical language processing, as well as features for solving various NLP tasks (text…
We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disambiguation. We view this problem as that of estimating a…
Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…
A four-term recurrence relation for squared spherical Bessel functions is shown to yield closed-form expressions for several types of finite weighted sums of these functions. The resulting sum rules, which may contain an arbitrarily large…
We develop a reciprocity formula for a spectral sum over central values of L-functions on GL(4)xGL(2). As an application we show that for any self-dual cusp form Pi for SL(4,Z), there exists a Maass form pi for SL(2,Z) such that L(1/2, Pi x…
We use tilting modules to study the structure of the tensor product of two simple modules for the algebraic group $\SL_2$, in positive characteristic, obtaining a twisted tensor product theorem for its indecomposable direct summands.…
We obtain new results on additive properties of the set $$ I^{-1}= \{x^{-1}: \quad x\in I\} $$ where $I$ is an arbitrary interval in the field of residue classes modulo a large prime $p$. We combine our results with multilinear exponential…
We construct global-in-time singular dynamics for the (renormalized) cubic fourth order nonlinear Schr\"odinger equation on the circle, having the white noise measure as an invariant measure. For this purpose, we introduce the…
We study a saturated fusion system F on a finite 2-group S having a Baumann component based on a dihedral 2-group. Assuming F is 2-perfect with no nontrivial normal 2-subgroups, and the centralizer of the component is a cyclic 2-group, it…
We develop an explicit algebriac de Rham theory for relative completion of $\mathrm{SL}_2(\mathbb{Z})$. This allows the construction of iterated integrals involving modular forms of the second kind, generalizing iterated integrals of…
Let us consider an infinite word and $k\geq 1$ an integer. By steps of $k$, we substitute a letter ofthis infinite word by the power of an external letter. The new word obtaining by this process is called $k$ to $k$ substitution of a power…
We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…
We develop a static complexity analysis for a higher-order functional language with structural list recursion. The complexity of an expression is a pair consisting of a cost and a potential. The former is defined to be the size of the…
We develop a new method leading the structure of finite subsets S and T of an abelian group with $|S+T|\le |S|+|T|$. We show also how to recover the known results in this area in a relatively short space.
Bell and Shallit recently introduced the Lie complexity of an infinite word $s$ as the function counting for each length the number of conjugacy classes of words whose elements are all factors of $s$. They proved, using algebraic…
We take two approaches to classifying the complexity of Presburger models: Scott analysis and degree spectra. In particular, we investigate the possible Scott sentence complexities and possible degree spectra of models of Presburger…
Ulam words are binary words defined recursively as follows: the length-$1$ Ulam words are $0$ and $1$, and a binary word of length $n$ is Ulam if and only if it is expressible uniquely as a concatenation of two shorter, distinct Ulam words.…