Related papers: Gr\"obner Bases for Increasing Sequences

Given polynomials $g$ and $f_1,\dots,f_p$, all in $\Bbbk[x_1,\dots,x_n]$ for some field $\Bbbk$, we consider the problem of computing the critical points of the restriction of $g$ to the variety defined by $f_1=\cdots=f_p=0$. These are…

In [4] Sturmfels linked the Hilbert Nullstellensatz to Gr\"obner bases through final polynomials. In (loc. cit.) it was claimed that final polynomials always appear in a lexicographic Gr\"obner basis of a certain ideal. In this paper, we…

Let $\{q_n^{(\alpha,\beta,m)}(x)\}_{n\ge 0}$ be the orthonormal polynomials respect to the Sobolev-type inner product \begin{equation*} \langle f,g\rangle_{\alpha,\beta,m}=\sum_{k=0}^m \int_{-1}^{1}f^{(k)}(x)g^{(k)}(x)\,…

Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q^*$ such that $F(a_1, a_2, \ldots, a_k)$ is a…

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

In this paper, we compute the size of the exceptional set in a generalized Goldbach problem and show that for a given polynomial $f(x) \in \mathbb{Z}[x]$ with a positive leading coefficient, positive integers $A$, $B$, $g$ and $0 \leq i, j…

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

We study a random polynomial of degree $n$ over the finite field $\mathbb{F}_q$, where the coefficients are independent and identically distributed and uniformly chosen from the squares in $\mathbb{F}_q$. Our main result demonstrates that…

By splitting the real line into intervals of unit length a doubly infinite integral of the form $\Int F(q^x)\,dx,\; 0<q<1$, can clearly be expressed as $\Integ \Sum F(q^{x+n})\,dx$, provided $F$ satisfies the appropriate conditions. This…

Let $T_n(q)$ be the ring of lower triangular matrices of order $n \geq 2$ with entries from the finite field $F(q)$ of order $q \geq 2$ and let ${^2T_n(q)}$ denote its free left module. For $n=2,3$ it is shown that the projective line over…

We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…

Let $\Lambda$ be a commutative Noetherian ring, and let $I$ be a proper ideal of $\Lambda$, $R=\Lambda /I$. Consider the polynomial rings $T=\Lambda [x_1,...x_n]$ and $A=R[x_1,...,x_n]$. Suppose that linear equations are solvable in…

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

Let $q$ be a Pisot or Salem number. Let $f_j(x)$ $(j=1,2,\dots)$ be integer-valued polynomials of degree $\ge2$ with positive leading coefficients, and let $\{a_j (n)\}_{n\ge1}$ $(j=1,2,\dots)$ be sequences of algebraic integers in the…

We investigate the conditions on an integer sequence f(n), n 2 N, with f(1) = 0, such that the sequence q(n), computed recursively via q(n) = q(n - q(n - 1)) + f(n), with q(1) = 1, exists. We prove that f(n + 1) - f(n) in {0,1}, n > 0, is a…

For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$, the polynomial interpolation problem (PIP) is to determine a unisolvent node set $P_{m,n} \subseteq \mathbb{R}^m$ of…

In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…

We consider the problem of computing a grevlex Gr\"obner basis for the set $F_r(M)$ of minors of size $r$ of an $n\times n$ matrix $M$ of generic linear forms over a field of characteristic zero or large enough. Such sets are not regular…