Related papers: A note on some special exponential sums
We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…
In this paper we investigate some strong convergence theorems for partial sums with respect to Vilenkin system.
A survey paper on some recent results on additive problems with prime powers.
We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.
Given a polynomial f and a finite field F one can construct a directed graph where the vertices are the values in the finite field, and emanating from each vertex is an edge joining the vertex to its image under f. When f is a Chebyshev…
After sketching recent advances and subtleties in classical relativistically covariant field theories, we give in this short Note some indications as to how the deformation quantization approach can be used to solve or at least give a…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
In this paper, we propose a new method for calculating integrals for a special class of integrands. As an application, we show how this method can be used to derive optimal pointwise temporal estimates for a class of nonlocal evolution…
It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.
We obtain lower bounds for the cardinality of $k$-fold sum-sets of reciprocals of elements of suitable defined short intervals in high degree extensions of finite fields. Combining our results with bounds for multilinear character sums we…
Interpolation methods for nonlinear finite element discretizations are commonly used to eliminate the computational costs associated with the repeated assembly of the nonlinear systems. While the group finite element formulation…
Let $\mathbb{F}_q$ be a finite field of odd characteristic containing $q$ elements and integer $n\ge 1$. In this paper, the explicit factorization of $x^{2^nd}-1$ over $\mathbb{F}_q$ is obtained when $d$ is an odd divisor of $q+1$.
Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…
In this paper we provide a complete approach to the real numbers via decimal representations. Construction of the real numbers by Dedekind cuts, Cauchy sequences of rational numbers, and the algebraic characterization of the real number…
We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…
This paper gives new explicit formulas for sums of powers of integers and their reciprocals.
In this paper, we consider sums of values of degenerate falling factorials and give a probabilistic proof of a recurrence relation for them. This may be viewed as a degenerate version of the recent probabilistic proofs on sums of powers of…
This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…
In this paper we investigate congruence relationships of particular finite generalized harmonic numbers sums. We suggest more transparent and simpler method to analyse these sums and present several additional results for certain special…
In this paper, we recursively construct explicit elements of provably high order in finite fields. We do this using the recursive formulas developed by Elkies to describe explicit modular towers. In particular, we give two explicit…