Related papers: Classification of Polynomial Mappings Between Comm…
Spinor polynomials are polynomials with coefficients in the even sub-algebra of conformal geometric algebra whose norm polynomial is real. They describe rational conformal motions. Factorizations of spinor polynomial corresponds to the…
This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…
Let f(x) be a polynomial with integer coefficients, let n be a positive integer, and let p be an odd prime. Then the mapping x-->f(x) sends Z/p^n into Z/p^n. We study the topological structure of this mapping.
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…
We express classical, free, Boolean and monotone cumulants in terms of each other, using combinatorics of heaps, pyramids, Tutte polynomials and permutations. We completely determine the coefficients of these formulas with the exception of…
The Cox ring provides a coordinate system on a toric variety analogous to the homogeneous coordinate ring of projective space. Rational maps between projective spaces are described using polynomials in the coordinate ring, and we generalise…
We classify two-variable polynomials which are rational of simple type. These are precisely the two-variable polynomials with trivial homological monodromy.
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
For a rational map $\phi: X \to G$ from a normal algebraic variety $X$ to a commutative algebraic group $G$, we define the modulus of $\phi$ as an effective divisor on $X$. We study the properties of the modulus. This work generalizes the…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
The article focuses on three different notions of polynomiality for maps of modules. In addition to the polynomial maps studied by Eilenberg and Mac Lane and the strict polynomial maps ("lois polynomes") considered by Roby, we introduce…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant…
Let X and Y be curves over a finite field. In this article we explore methods to determine whether there is a rational map from Y to X by considering L-functions of certain covers of X and Y and propose a specific family of covers to…
A rational map between certain specific threefolds is given in an explicit manner.
The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…
Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a…
We introduce the notion of commuting probability, $p(G)$, for an algebraic group $G$. This notion is inspired by the corresponding notions in finite groups and compact groups. The computation of $p(G)$ for reductive groups is readily done…