Related papers: Two Structural Results for Low Degree Polynomials …

Motivated by a valuation theorem, recently obtained by Rangachev, we study the \'etale extensions $A\subset B$ of polynomial rings over an algebraically closed field of characteristic zero, such that the integral closure $\overline{A}$ is a…

Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…

The intersection distribution of a polynomial $f$ over finite field $\mathbb{F}_q$ was recently proposed in Li and Pott (arXiv:2003.06678v1), which concerns the collective behaviour of a collection of polynomials $\{f(x)+cx \mid c \in…

We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems…

We consider elliptic partial differential equations with diffusion coefficients that depend affinely on countably many parameters. We study the summability properties of polynomial expansions of the function mapping parameter values to…

The theory of affine processes on the space of positive semidefinite d x d matrices has been established in a joint work with Cuchiero, Filipovi\'c and Teichmann (2011). We confirm the conjecture stated therein that in dimension d greater…

We propose a construction of affine space (or "polynomial rings") over a triangulated category, in the context of stable derivators.

A classical result of Rothschild and van Lint asserts that if every non-zero Fourier coefficient of a Boolean function $f$ over $\mathbb{F}_2^{n}$ has the same absolute value, namely $|\hat{f}(\alpha)|=1/2^k$ for every $\alpha$ in the…

In this paper, we study holomorphic foliations of degree four on complex projective space $\mathbb{P}^n$, where $n\geq 3$, with a special focus on obtaining a structural theorem for these foliations. Furthermore, for a foliation…

The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in…

We investigate the structure of polynomials of degree four in many variables over a fixed prime field $\mathbb{F}=\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\mathbb{F}^{n}\rightarrow\mathbb{F}$ is poorly…

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…

Affine normal directions provide intrinsic affine-invariant descent directions derived from the geometry of level sets. Their practical use, however, has long been hindered by the need to evaluate third-order derivatives and invert tangent…

One question that we investigate in this paper is, how can we build log-concave polynomials using sparse polynomials as building blocks? More precisely, let $f = \sum\_{i = 0}^d a\_i X^i \in \mathbb{R}^+[X]$ be a polynomial satisfying the…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

We study the question of local testability of low (constant) degree functions from a product domain $S_1 \times \dots \times {S}_n$ to a field $\mathbb{F}$, where ${S_i} \subseteq \mathbb{F}$ can be arbitrary constant sized sets. We show…

Recent work has shown the surprising power of low-degree sandwiching polynomial approximators in the context of challenging learning settings such as learning with distribution shift, testable learning, and learning with contamination. A…

Extending the classical result that the roots of a polynomial with coefficients in $\mathbf{C}$ are continuous functions of the coefficients of the polynomial, nonstandard analysis is used to prove that if $\mathcal{F} = \{f_{\lambda}…