相关论文: Distinct monomial orders with same induced orderin…

Even if binary relations and orders are a common formalization topic, we need to formalize specific orders (namely monomial and graded) in the process of formalizing in Rocq the finite element method. This article is therefore definitions,…

Let $I$ be a monomial ideal in a polynomial ring $S=K[x_1,\ldots,x_n]$ over a field $K$ with $n=2$ or $3$, and let $\overline{I}$ be its integral closure. We will show that $\text{reg} (\overline{I}) \le \text{reg} (I)$. Furthermore, if $I$…

New criteria are shown that certain combinations of finite unimodal polynomials are unimodal. %Given unimodal polynomials with explicit expressions and dependent recursion relations, we propose an approach to determine their modes. As…

In this article, we investigate the cardinality of Groebner bases under various monomial orderings. We identify a family of polynomials F and a criterion such that the reduced Groebner basis of F is double exponential in cardinality with…

Let $\{p_1,\dots,p_n\}$ and $\{q_1,\dots,q_n\}$ be two sets of $n$ labeled points in general position in the plane. We say that these two point sets have the same order type if for every triple of indices $(i,j,k)$, $p_k$ is above the…

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

We prove that the Stanley's conjecture holds for monomial ideals $I\subset K[x_1,...,x_n]$ generated by at most $2n-1$ monomials, i.e. $sdepth(I)\geq depth(I)$.

In this paper we consider the Waring rank of monomials over the real and the rational numbers. We give a new upper bound for it by establishing a way in which one can take a structured apolar set for any given monomial…

A family of partial orders in the free monoid of words, induced from a partial order in alphabet, is presented. The induced orders generalize the chronological posets that have been defined for the two-letter alphabet only, and the…

In the first chapter we present new results related on monomial ideals of Borel type. Also, we introduce a new class of monomial ideals, called $\de$-fixed ideals, which generalize the class of $p$-Borel ideals and we extend several results…

Cremona maps defined by monomials of degree 2 are thoroughly analyzed and classified via integer arithmetic and graph combinatorics. In particular, the structure of the inverse map to such a monomial Cremona map is made very explicit as is…

Let $R$ be a ring and $B = R[X_1, \dots, X_n]$ the polynomial ring in $n$ variables over $R$. In this article, we consider retractions $\varphi : B \longrightarrow B$ such that $\varphi(X_i)$ is either a monic monomial or $0$. We prove that…

We give a bound for the order of the local monodromy of a compatible system of l-adic representations, which is independent of l. For the etale cohomology of a variety, the bound depends only on some numerical invariants of varieties.

Experiment shows that the reverse length-lexicographical word ordering consistently yields far smaller Gr\"obner bases for modular p-group algebras than the length-lexicographical ordering. For the so-called Jennings word ordering, based on…

We provide $\mathbb{N}$-filtrations on the negative part $U_q(\mathfrak{n}^-)$ of the quantum group associated to a finite-dimensional simple Lie algebra $\mathfrak{g}$, such that the associated graded algebra is a skew-polynomial algebra…

In this article we first compare the set of elements in the socle of an ideal of a polynomial algebra $K[x_1,\ldots,x_d]$ over a field $K$ that are not in the ideal itself and Macaulay's inverse systems of such polynomial algebras in a…

We introduce a majorization order on monomials. With the help of this order, we derive a necessary condition on the positive termination of a general successive difference substitution algorithm (KSDS) for an input form $f$.

Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…

In this paper a new classification of monomial curves in $\mathbb{A}^4(\mathbbmss{k})$ is given. Our classification relies on the detection of those binomials and monomials that have to appear in every system of binomial generators of the…