Related papers: F-purity versus log canonicity for polynomials

We call a polynomial monogenic if a root $\theta$ has the property that $\mathbb{Z}[\theta]$ is the full ring of integers in $\mathbb{Q}(\theta)$. Consider the two families of trinomials $x^n + ax + b$ and $x^n + cx^{n-1} + d$. For any…

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

We show that each direct summand of the associated graded module of the test module filtration $\tau(M, f^\lambda)_{\lambda \geq 0}$ admits a natural Cartier structure. If $\lambda$ is an $F$-jumping number, then this Cartier structure is…

We provide an explicit infinite family of integers $m$ such that all the polynomials of ${\mathbb F}_{2^n}[x]$ of degree $m$ have maximal differential uniformity for $n$ large enough. We also prove a conjecture of the third author in these…

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

The $F$-thresholds are important numerical invariants in prime characteristic, whose existence had been established only under certain assumptions. We show the existence of $F$-thresholds in full generality. We study properties of standard…

In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal…

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

We present a procedure for computing the log-canonical threshold of an arbitrary ideal generated by binomials and monomials. The computation of the log canonical threshold is reduced to the problem of computing the minimum of a function,…

Let $F=(F_1, F_2, ..., F_m): \mathbb{C}^n \to \mathbb{C}^m$ be a polynomial dominant mapping with $n>m$. In this paper we give the relations between the bifurcation set of $F$ and the set of values where $F$ is not M-tame as well as the set…

The ratio monotonicity of a polynomial is a stronger property than log-concavity. Let P(x) be a polynomial with nonnegative and nondecreasing coefficients. We prove the ratio monotone property of P(x+1), which leads to the log-concavity of…

In the classical linear degeneracy testing problem, we are given $n$ real numbers and a $k$-variate linear polynomial $F$, for some constant $k$, and have to determine whether there exist $k$ numbers $a_1,\ldots,a_k$ from the set such that…

We prove that hypersurfaces defined by irreducible square-free polynomials have rational singularities. As an easy consequence, we deduce that certain (possibly non-square-free) polynomials associated to pairs of square-free polynomials…

In their "Cluster Algebras IV" paper, Fomin and Zelevinsky defined F-polynomials and g-vectors, and they showed that the cluster variables in any cluster algebra can be expressed in a formula involving the appropriate F-polynomial and…

A plurisubharmonic weight is log canonical if it is at the critical point of turning non-integrable. Given a log canonical plurisubharmonic weight, we show that locally there always exists a log canonical `holomorphic' weight having the…

In the present paper, we prove the existence of universal polynomials which express multi-singularity loci classes of prescribed types for proper morphisms between smooth schemes over an algebraically closed field of characteristic zero --…

The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…

We prove that if $f$ is a polynomial over a number field $K$ with a finite superattracting periodic point and a non-archimedean place of bad reduction, then there is an $\epsilon>0$ such that only finitely many $P\in K^{\text{ab}}$ have…

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…