Related papers: Exponential sum estimate for systems including lin…
In this paper we compute the exact divisibility of exponential sums associated to binomials $F(X)=aX^{d_1} +b X^{d_2}$. In particular, for the case where $\max\{d_1,d_2\}\leq\sqrt{p-1}$, the exact divisibility is computed. As a byproduct of…
In this paper, we study the alternating Euler $T$-sums and related sums by using the method of contour integration. We establish the explicit formulas for all linear and quadratic Euler $T$-sums and related sums. Some interesting new…
We consider the sensitivity of real roots of polynomial systems with respect to perturbations of the coefficients. In particular - for a version of the condition number defined by Cucker, Krick, Malajovich, and Wschebor - we establish new…
Let $f$ be a polynomial of degree $d>1$ in $n$ variables over $\mathbb{Z}$. Let $f_d$ be the homogeneous part of degree $d$ of $f$ and $s$ be the dimension of the critical locus of $f_d$. In this paper, we prove Igusa's conjecture for…
We prove some general estimates for exponential sums over subsets of finite fields which are definable in the language of rings. This generalizes both the classical exponential sum estimates over varieties over finite fields due to Weil,…
The subject of Polynomiography deals with algorithmic visualization of polynomial equations, having many applications in STEM and art, see [Kal04]. Here we consider the polynomiography of the partial sums of the exponential series. While…
Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…
When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is…
In 1991, Baker and Harman proved, under the assumption of the generalized Riemann hypothesis, that $\max_{ \theta \in [0,1) }\left|\sum_{ n \leq x } \mu(n) e(n \theta) \right| \ll_\epsilon x^{3/4 + \epsilon}$. The purpose of this note is to…
The aim of this paper is twofold. The first is to give a quantitative version of Schmidt's subspace theorem for arbitrary families of higher degree polynomials. The second is to give a generalization of the subspace theorem for arbitrary…
We prove an exponential estimate for the asymptotics of Bergman kernels of a positive line bundle under hypotheses of bounded geometry. We give further Bergman kernel proofs of complex geometry results, such as separation of points,…
In this paper we consider some concepts of exponential splitting for nonautonomous linear discrete-time systems. These concepts are generalizations of some well-known concepts of (uniform and nonuniform) exponential dichotomies. Connections…
The existing methods to obtain an exact-fit polynomial does not give the resulting polynomial in its standard form, and further manipulations are needed to obtain that. The new method presented here gives the coefficients of the polynomial…
In this paper we derive a new recovery procedure for the reconstruction of extended exponential sums of the form $y(t) = \sum_{j=1}^{M} \left( \sum_{m=0}^{n_j} \, \gamma_{j,m} \, t^{m} \right) {\mathrm e}^{2\pi \lambda_j t}$, where the…
Energy functions offer natural extensions of controllability and observability Gramians to nonlinear systems, enabling various applications such as computing reachable sets, optimizing actuator and sensor placement, performing balanced…
An exponential polynomial is a finite linear sum of terms $P(z)e^{Q(z)}$, where $P(z)$ and $Q(z)$ are polynomials. The early results on the value distribution of exponential polynomials can be traced back to Georg P\'olya's paper published…
Generalized polynomial chaos expansions are a powerful tool to study differential equations with random coefficients, allowing in particular to efficiently approximate random invariant sets associated to such equations. In this work, we use…
We combine two of Igusa's conjectures with recent semi-continuity results by Musta\c{t}\u{a} and Popa to form a new, natural conjecture about bounds for exponential sums. These bounds have a deceivingly simple and general formulation in…
We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…
Dickson conjectured that a set of polynomials will take on infinitely many simultaneous prime values. Later others, such as Hardy and Littlewood, gave estimates for the number of these primes. In this article we look at this conjecture,…