Results 21 to 30 of about 524,682 (315)
Computing the Binomial Part of a Polynomial Ideal
Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This is achieved step-by-step.
Martin Kreuzer, Florian Walsh
openalex +3 more sources
A Class of Binomial Permutation Polynomials [PDF]
In this note, a criterion for a class of binomials to be permutation polynomials is proposed. As a consequence, many classes of binomial permutation polynomials and monomial complete permutation polynomials are obtained. The exponents in these monomials are of Niho type.
Ziran Tu +3 more
openalex +3 more sources
Monogenic Polynomials of Four Variables with Binomial Expansion [PDF]
In the recent past one of the main concern of research in the field of Hypercomplex Function Theory in Clifford Algebras was the development of a variety of new tools for a deeper understanding about its true elementary roots in the Function Theory of one Complex Variable.
Carla Cruz +2 more
openalex +5 more sources
Integer-valued polynomials and binomially Noetherian rings
for each and i ≥ 0. The polynomial ring of integer-valued in rational polynomial is defined by Int ( an important example for binomial ring and is non-Noetherian ring. In this paper the algebraic structure of binomial rings has been studied by their
Shadman Kareem
doaj +1 more source
Noetherian properties of skew polynomial rings with binomial relations [PDF]
T. Gateva-Ivanova
semanticscholar +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abel, Ulrich +2 more
openaire +2 more sources
Binomial Edge Ideals of Weakly Closed Graphs [PDF]
Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gröbner basis with respect to a diagonal term order.
Lisa Seccia
semanticscholar +1 more source
Arithmetical Rank and Cohomological Dimension of Generalized Binomial Edge Ideals [PDF]
Let $G$ be a connected and simple graph on the vertex set $[n]$. To the graph $G$ one can associate the generalized binomial edge ideal $J_{m}(G)$ in the polynomial ring $R=K[x_{ij}: i \in [m], j \in [n]]$.
A. Katsabekis
semanticscholar +1 more source
Regularity and h-polynomials of Binomial Edge Ideals [PDF]
6 pages. Conjecture 0.1 has been deleted.
Hibi, Takayuki, Matsuda, Kazunori
openaire +3 more sources
The purpose of this paper is to construct generating functions in terms of hypergeometric function and logarithm function for finite and infinite sums involving higher powers of inverse binomial coefficients.
Y. Simsek
semanticscholar +1 more source

