Related papers: On the field intersection problem of generic polyn…
In this work we deal with a symbolic approach to the general quadratic polynomial decomposition. By means of a symbolic implementation, we investigate some properties of the components sequences like orthogonality and symmetry. We present…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
We present a generalization of multiple orthogonal polynomials of type I and type II, which we call multiple orthogonal polynomials of mixed type. Some basic properties are formulated, and a Riemann-Hilbert problem for the multiple…
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
We find general solutions of some field equations (systems of equations) in pseudo-Euclidian spaces (so-called primitive field equations). These equations are used in the study of the Dirac equation and Yang-Mills equations. These equations…
In this paper we study relations between intersection numbers on moduli spaces of curves and Hurwitz numbers. First, we prove two formulas expressing Hurwitz numbers of (generalized) polynomials via intersections on moduli spaces of curves.…
Let f and g be nonconstant polynomials over an arbitrary field K. In this paper we study the intersection of the polynomial rings K[f] and K[g], and in particular we ask whether this intersection is larger than K. We completely resolve this…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
We prove a formula which compares intersection numbers of conormal varieties of two projective varieties and their dual varieties. When one of them is linear, we can recover the usual Plucker formula for the degree of the dual variety. The…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
In this review article, we report on some recent advances on the computational aspects of cohomology intersection numbers of GKZ systems developed in \cite{GM}, \cite{MH}, \cite{MT} and \cite{MT2}. We also discuss the relation between…
Let $g_1, ..., g_k$ be tropical polynomials in $n$ variables with Newton polytopes $P_1, ..., P_k$. We study combinatorial questions on the intersection of the tropical hypersurfaces defined by $g_1, ..., g_k$, such as the $f$-vector, the…
We revisit the fundamental problem of assigning intersection multiplicities to subsets of solutions of (square) systems of polynomials. Severi [Ann. Mat. Pura Appl. 26 (4), 1947] suggested an intuitive dynamic solution to this problem which…
Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…
In this work, we describe our experience in learning the use of a computer proof assistant - specifically, Lean - from scratch, through proving formulae for the solutions of polynomial equations. Specifically, in this work we characterize…
A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…
In this paper we develop a new method which is a generalization of the Obreshkoff -Ehrlich method for the cases of algebraic, trigonometric and exponential polynomials. This method has a cubic rate of convergence. It is efficient from the…
We generalize two classical formulas for complete intersection curves by introducing the the complete intersection discrepancy of a curve as a correction term. The first is a well-known multiplicity formula in singularity theory, due to…
We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…
There are 3 examples in these notes. The first one is the standard example of the cubic resolvent of a quartic. The second example is exactly from Adelmann \cite{Adelmann} and gives a defining polynomial corresponding to the unique…