Related papers: Some facts about discriminants

One can think of power series or polynomials in one variable, such as $P(x)=2x^3+x+5$, as functors from the category $\mathsf{Set}$ of sets to itself; these are known as polynomial functors. Denote by $\mathsf{Poly}_{\mathsf{Set}}$ the…

This article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…

We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…

Polynomials commute under composition are referred to as commuting polynomials. In this paper, we study division properties for commuting polynomials with rational (and integer) coefficients. As a consequence, we show an algebraic…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…

We propose a method for constructing systems of polynomial equations that define submanifolds of degenerate binary forms of an arbitrary degeneracy degree. It is appropriate to call these systems of equations "higher discriminants".

We study a generalization of the discriminant of a polynomial, which we call the tolerant. The tolerant differs by multiplication by a square from the duplicant, which was discovered in recent work on $\mathbb{P}^1$-loop spaces in motivic…

We study one-dimensional algebraic families of pairs given by a polynomial with a marked point. We prove an "unlikely intersection" statement for such pairs thereby exhibiting strong rigidity features for these pairs. We infer from this…

Let $f(X_1,\dots, X_n)$ be a nonzero multilinear noncommutative polynomial. If $A$ is a unital algebra with a surjective inner derivation, then every element in $A$ can be written as $f(a_1,\dots,a_n)$ for some $a_i\in A$.

The polynomials $x^n + (1-x)^n + a^n$ arise naturally from FLT (Fermat's Last Theorem). We formulate a conjecture about them which is a generalization of FLT. We investigate the complex roots of these polynomials, and our main result is…

We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…

Let $P$ be a monic polynomial of degree $n$ with roots $x_1,\ldots,x_n$. We study the discriminants of the derivatives $P^{(k)}$ as symmetric translation-invariant polynomials in the original roots. The general ``square-graph cone''…

We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…

The range of a trigonometric polynomial with complex coefficients can be interpreted as the image of the unit circle under a Laurent polynomial. We show that this range is contained in a real algebraic subset of the complex plane. Although…

A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…

We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…

A classification and a detailed geometric description are given for smooth $n$-dimensional subvarieties $X\subset{\mathbb P}^{2n-1}$ containing a family of effective divisors each of them spanning a linear ${\mathbb P}^n$ of ${\mathbb…

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

Given a family of varieties, the Euler discriminant locus distinguishes points where Euler characteristic differs from its generic value. We introduce a hypergeometric system associated with a flat family of very affine locally complete…

Let \psi(x) be a polynomial with rational coefficients. Suppose that \psi has the positive leading coefficient and zero constant term. Let A be a set of positive integers with the positive upper density. Then there exist x,y\in A and a…