相关论文: Reduction numbers and initial ideals

Let $K$ be an infinite field and let $I = (f_1,\cdots,f_r)$ be an ideal in the polynomial ring $R = K[x_1,\cdots,x_n]$ generated by generic forms of degrees $d_1,\cdots,d_r$. A longstanding conjecture by Fr\"{o}berg predicts the shape of…

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…

Let S=K[x_1,...,x_n] be a polynomial ring and R=S/I be a graded K-algebra where I is a graded ideal in S. Herzog, Huneke and Srinivasan have conjectured that the multiplicity of R is bounded above by a function of the maximal shifts in the…

Let $k$ be an infinite field and $I\subset k [x_1, \ldots ,x_n]$ be an ideal such that dim $V(I)=q$. Denote by $(f_1, \ldots, f_s)$ a set of generators of $I$. One can see that in the set $I\cap k [x_{1},...,x_{q+1}]$ there exist non-zero…

We study minimal reductions of edge ideals of graphs and determine restrictions on the coefficients of the generators of these minimal reductions. We prove that when $I$ is not basic, then $\core{I}\subset \m I$, where $I$ is an edge ideal…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. Akbari, Cameron, and Khosrovshahi conjectured that the…

In this paper, we analyze the convergence behavior of the randomized extended Kaczmarz (REK) method for all types of linear systems (consistent or inconsistent, overdetermined or underdetermined, full-rank or rank-deficient). The analysis…

Let $X$ be a set of positive integers, and let $\mathbb Z_K$ be the ring of integers of a number field $K$ of degree $n$. Denote by $N(I)$ the absolute norm of an ideal $I$ of $\mathbb Z_K$, and by $\mathcal A$ the set of principal ideals…

We propose a method for reduction of quantum systems with arbitrary first class constraints. An appropriate mathematical setting for the problem is homology of associative algebras. For every such an algebra $A$ and its subalgebra B with an…

The main results of this paper are the construction, both rigourous and intuitive, of "the" intrinsic extension of the set of non negative integers N and the smallest over-field of R set which is continue (according to R.Dedekind). The aim…

Let $R$ be a commutative Noetherian $\mathbb{N}$-graded ring. Let $N\subseteq M$ be finitely generated $\mathbb{Z}$-graded $R$-modules. Let $I_1,\ldots,I_r$ be non-zero proper homogeneous ideals of $R$. Denote ${\bf…

Assume that $K$ is a field and $I_{1}\subsetneq ...\subsetneq I_{t}$ is an ascending chain (of length $t$) of ideals in the polynomial ring $K[x_{1},,...,x_{m}]$, for some $m\geq 1$. Suppose that $I_{j}$ is generated by polynomials of…

We show that high Veronese subrings of any commutative graded ring have a Grobner basis with all relations of degree 2. (The d-th Veronese subring of a ring A_0 + A_1 + A_2 + ... is the ring A_0 + A_d + A_{2d} + ...; ``high'' means we take…

We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…

We extend two well-known results on primitive ideals in enveloping algebras of semisimple Lie algebras, the `Irreducibility theorem' and `Duflo theorem', to much wider classes of algebras. Our general version of Irreducibility theorem says…

Let K be a finite field and let X be a subset of a projective space, over the field K, which is parameterized by monomials arising from the edges of a clutter. We show some estimates for the degree-complexity, with respect to the revlex…

For positive integers $a_1,a_2,...,a_m$, we determine the least positive integer $R(a_1,...,a_m)$ such that for every 2-coloring of the set $[1,n]={1,...,n}$ with $n\ge R(a_1,...,a_m)$ there exists a monochromatic solution to the equation…

The Carmichael lambda function $\lambda(n)$ is defined to be the smallest positive integer $m$ such that $a^m \equiv 1 \pmod{n}$ for all $(a,n)=1.$ $\lambda_k(n)$ is defined to be the $k$th iterate of $\lambda(n).$ Let L(n) be the smallest…

If $\alpha_1,\ldots,\alpha_r$ are algebraic numbers such that $$N=\sum_{i=1}^r\alpha_i \ne \sum_{i=1}^r\alpha_i^{-1}$$ for some integer $N$, then a theorem of Beukers and Zagier gives the best possible lower bound on $$\sum_{i=1}^r\log…