Related papers: Perturbing Eisenstein polynomials over local field…

Let $T$ be an ergodic measure-preserving transformation on a non-atomic probability space $(X,\Sigma,\mu)$. We prove uniform extensions of the Wiener-Wintner theorem in two settings: For averages involving weights coming from Hardy field…

Let F be a number field, and let F\subset K be a field extension of degree n. Suppose that we are given 2r sufficiently general linear polynomials in r variables over F. Let X be the variety over F such that the F-points of X bijectively…

We study two notions of concentration for homogeneous polynomials of degree $N$ in $d+1$ complex variables on the unit sphere: a local notion measuring the fraction of the $L^2$-norm supported on a measurable subset; and a global notion…

Let $f(X)$ be a nonconstant polynomial over $\mathbb{F}_{q}$, with a nonzero constant term. The order of $f(X)$ is a classical notion in the theory of polynomials over finite fields, and recently the definition of freeness of binomials of…

Let $X$ be an algebraic variety over a field $K \subset \overline{{\mathbb{Q}}_p}$ and $f$ be a self map. When $K$ is a local field, the boundedness of $f$-periods in $X(K)$ is a well studied question. We will study the same question for…

In an earlier paper of Cadek, Vokrinek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all possible homotopy classes of maps between two topological…

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Let $G$ be a compact group, let $X$ be a Banach space, and let $P\colon L^1(G)\to X$ be an orthogonally additive, continuous $n$-homogeneous polynomial. Then we show that there exists a unique continuous linear map $\Phi\colon L^1(G)\to X$…

Inspired by the recent work of Glasner, Huang, Shao, Weiss and Ye, we prove that the maximal $\infty$-step pro-nilfactor $X_\infty$ of a minimal system $(X,T)$ is the topological characteristic factor along polynomials in a certain sense.…

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

Given Banach spaces E and F, we denote by ${\mathcal P}(^k!E,F)$ the space of all k-homogeneous (continuous) polynomials from E into F, and by ${\mathcal P}_{wb}(^k!E,F)$ the subspace of polynomials which are weak-to-norm continuous on…

We obtain the asymptotic equalities for the least upper bounds of approximations by interpolation trigonometric polynomials with the equidistant nodes $x_k^{(n-1)}=\frac{2k\pi}{2n-1},\ k\in\mathbb{Z},$ in metrics of the spaces $L_p$ on…

We prove that the minimizer in the N\'ed\'elec polynomial space of some degree p > 0 of a discrete minimization problem performs as well as the continuous minimizer in H(curl), up to a constant that is independent of the polynomial degree…

We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

We prove that every place $P$ of an algebraic function field $F|K$ of arbitrary characteristic admits local uniformization, provided that the sum of the rational rank of its value group and the transcendence degree of its residue field $FP$…

Let $X$ be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal $I(X)$ independent of the data uncertainty. We present a method to compute a polynomial basis $B$ of…

An example of trigonometric polynomials with extremely small uniform norm is given. This example demonstrates the potential limits for extension of Sidon's inequality for lacunary polynomials in a certain direction.

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

We show that the minimal polynomial of a polynomial exponential automorphism F of C^n (i.e. F=exp(D), where D is a locally nilpotent derivation) is of the form \mu_F(T)=(T-1)^d, d=min{m \in N: D^m(X_i)=0 for i=1,...,n}.