Related papers: Exponential sum estimate for systems including lin…
We prove the remaining part of the conjecture by Denef and Sperber [Denef, J. and Sperber, S., \textit{Exponential sums mod $p^n$ and {N}ewton polyhedra}, Bull. Belg. Math. Soc., {\bf{suppl.}} (2001) 55-63] on nondegenerate local…
In this paper, we develop a general theory of truncated inverse binomial sampling. In this theory, the fixed-size sampling and inverse binomial sampling are accommodated as special cases. In particular, the classical Chernoff-Hoeffding…
We propose a new analytical method to solve for nonexactly soluble Schrodinger equation via expansions through some existing quantum numbers. Successfully, it is applied to the rational non-polynomial oscillator potential. Moreover, a…
Generalized linear models and the quasi-likelihood method extend the ordinary regression models to accommodate more general conditional distributions of the response. Nonparametric methods need no explicit parametric specification, and the…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
In this paper, we provide an alternative proof of Donaldson's almost-holomorphic section theorem and symplectic Lefschetz pencil theorem, through constructions of certain special kind of Donaldson-type sections of the line bundle based on…
We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…
We describe an effective method for calculating certain infinite sums, generalizations of the classical Bernoulli polynomials. As shown by Edward Witten in his papers on two-dimensional gauge theories, the correlation functions of…
We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…
The best known upper estimates for the constants of the Hardy--Littlewood inequality for $m$-linear forms on $\ell_{p}$ spaces are of the form $\left(\sqrt{2}\right) ^{m-1}.$ We present better estimates which depend on $p$ and $m$. An…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
This paper provides a technique for evaluating some nonlinear Gaussian sums in closed forms. The evaluation is obtained from the known values of simpler exponential sums.
For bounded linear operators $A,B$ on a Hilbert space $\mathcal{H}$ we show the validity of the estimate $$ \sum_{\lambda \in \sigma_d (B)} \dist(\lambda, \overline{\num}(A))^p \leq \| B-A \|_{\mathcal{S}_p}^p$$ and apply it to recover and…
Inequalities for exponential sums are studied. Our results improve an old result of G. Halasz and a recent result of G. Kos. We prove several other essentially sharp related results in this paper.
Asymptotic approximations for the continuous Hahn polynomials and their zeros as the degree grows to infinity are established via their three-term recurrence relation. The methods are based on the uniform asymptotic expansions for…
Gathering different results from singularity theory, geometry and combinatorics, we show that the spectrum at infinity of a tame Laurent polynomial counts lattice points in polytopes and we deduce an effective algorithm in order to compute…
Hartman-Grobman theorem was initially extended to the non-autonomous cases by Palmer. Usually, dichotomy is an essential condition of Palmer's linearization theorem. Is Palmer's linearization theorem valid for the systems with trichotomy?…
Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…
We give more evidence for Patterson's conjecture on sums of exponential sums, by getting an asymptotic for a sum of quartic exponential sums over $\Q[i].$ Previously, the strongest evidence of Patterson's conjecture over a number field is…