Related papers: Separating Variables in Bivariate Polynomial Ideal…
Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.
In this article, we define the concept of an $S$-$k$-irreducible ideal and $S$-$k$-maximal ideal in a commutative semiring. We also establish several results concerning $S$-$k$-primary ideals and prove the existence theorem and the…
In this paper, for a field $k$ of characteristic zero and a finitely generated $k$-algebra $R$, we give a set of generators for the image ideals of irreducible nice and quasi-nice $R$-derivations on the polynomial ring $R[X,Y]$, where $R$…
Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
We determine the regular irreducible components of the variety mod(A,d), where A=kQ/I is a string algebra and I is generated by a set of paths of length two. Our case is among the first examples of descriptions of irreducible components,…
Coefficients of super Jacobi polynomials of type $B(1,n)$ are rational functions in three parameters $k,p,q$. At the point $(-1,0,0)$ these coefficient may have poles. Let us set $q=0$ and consider pair $(k,p)$ as a point of $\Bbb A^2$. If…
We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for, parametric optimization. The idea is to first consider the variable x1 as a parameter and solve the…
We introduce polynomial sets of $(p,q)$-Appell type and give some of their characterizations. The algebraic properties of the set of all polynomial sequences of $(p,q)$-Appell type are studied. Next, we give a recurrence relation and a…
Given a non-negative integer k, we construct a lattice 3-simplex P with the following property: The affine semigroup Q_P associated to P is not normal, and every element $q \in \sat{Q}_P \setminus Q_P$ has lattice distance at least k above…
Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…
Let $K = \Q(\theta)$ be an algebraic number field with $\theta$ satisfying an irreducible polynomial $x^{9} - a$ over the field $\Q$ of rationals and $\Z_K$ denote the ring of algebraic integers of $K$. In this article, we provide the exact…
Let $G$ be a semisimple Lie group. We describe the irreducible representations of $G$ by linear isometries on $L_p$-spaces for $p\in (1,+\infty)$ with $p\neq 2.$ More precisely, we show that, for every such representation $\pi,$ there…
Guralnick, Kunyavskii, Plotkin and Shalev have shown that the solvable radical of a finite group $G$ can be characterized as the set of all $x\in G$ such that $<x,y>$ is solvable for all $y\in G$. We prove two generalizations of this…
We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial…
In this paper, we investigate zero-divisor, nilpotent, idempotent, unit, small, and irreducible elements in semiring extensions such as amount, content, and monoid semialgebras. We also introduce new concepts such as the prime avoidance…
L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and…
We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…
This paper deals with a class of nonlocal variable $s(.)$-order fractional $p(.)$-Kirchhoff type equations: \begin{eqnarray*} \left\{ \begin{array}{ll}…