Related papers: Some facts about discriminants

In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this…

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

Let X be a smooth curve defined over the algebraic numbers, let a,b be algebraic numbers, and let f_l(x) be an algebraic family of rational maps indexed by all l in X. We study whether there exist infinitely many l in X such that both a and…

Let $K$ be a field. In this article, we derive a formula for the discriminant of a sequence $\{r_{A,n}+c r_{A,n-1}\}$ of polynomials. Here, $c \in K$ and $\{r_{A,n} \}$ is a sequence of polynomials satisfying a certain recurrence relation…

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

The relationship between a polynomial's zeros and factors is well known. If a is a zero of f(x) then (x-a) is a factor of f(x). In this paper, we generalize this idea to polynomials of two variables and with real coefficients. We consider…

We examine a parameterized family of functions F_a, all of which are continuous and some of which are nowhere or almost nowhere differentiable, we explore the behavior of F'_a and F"_a almost everywhere for different values of a, focusing…

We find families of prime knot diagrams with arbitrary extreme coefficients in their Jones polynomials. Some graph theory is presented in connection with this problem, generalizing ideas by Yongju Bae and Morton and giving a positive answer…

We will extend the Fourier restriction inequality for quadratic hypersurfaces obtained by Strichartz. We will consider the case where the hypersurface is a graph of a certain real polynomial which is a sum of one-dimensional monomials. It…

We study experimentally systems of orthogonal polynomials with respect to self-similar measures. When the support of the measure is a Cantor set, we observe some interesting properties of the polynomials, both on the Cantor set and in the…

Let $N>1$ and let $\Phi_N(X,Y)\in\mathbb{Z}[X,Y]$ be the modular polynomial which vanishes precisely at pairs of $j$-invariants of elliptic curves linked by a cyclic isogeny of degree $N$. In this note we study the divisibility of the…

The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

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…

This paper reviews a class of univariate piecewise polynomial functions known as discrete splines, which share properties analogous to the better-known class of spline functions, but where continuity in derivatives is replaced by (a…

Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

Let $a(\lambda)$ and $b(\lambda)$ be two polynomials with coefficients in complex numbers and let $f_{\lamb$ be a one-parameter family of polynomials indexed by all complex numbers $\lambda$. We study whether there exist infinitely many…