Related papers: Binomial fibers and indispensable binomials

We present a study on the Yoneda-Dress construction of biset functors of linear representations over a field of characteristic zero. We give a characterization of their lattices of ideals and we provide a criterion of vanishing for their…

For which monomial supports do most polynomials generate a prime ideal? We give necessary and sufficient conditions for the radical of the ideal to be prime over an algebraically closed field. In characteristic zero, the same conditions…

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 enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

Let $\mathbb{F}[X]$ be the polynomial ring over the variables $X=\{x_1,x_2, \ldots, x_n\}$. An ideal $I=\langle p_1(x_1), \ldots, p_n(x_n)\rangle$ generated by univariate polynomials $\{p_i(x_i)\}_{i=1}^n$ is a \emph{univariate ideal}. We…

Let $k$ be a field. We determine the ideals $I$ in a finitely generated graded $k$-algebra $A$, whose associated graded rings are isomorphic to $A$. Also we compute the graded local cohomologies of the Rees rings $A[I t]$ and give the…

We construct a fundamental theory of the derived category of non-finite bi-filtered complexes.

We design, implement and test a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length. The algorithm uses a weighted average of the Shannon Entropies of the string and all but the last binary…

For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m^4 |L|^2) to generate the set L of all minimal edge dominating sets of G. For bipartite graphs we obtain a better result; we show that their…

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…

We describe how to compute topological objects associated to a polynomial map of several complex variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the…

We show that under some conditions, if the initial ideal in$_<(I)$ of an ideal $I$ in a polynomial ring has the property that its symbolic and ordinary powers coincide, then the ideal $I$ shares the same property. We apply this result to…

Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…

Vanishing polynomials are polynomials over a ring which output $0$ for all elements in the ring. In this paper, we study the ideal of vanishing polynomials over specific types of rings, along with the closely related ring of polynomial…

We study powers of binomial edge ideals associated with closed and block graphs.

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

We consider the vanishing ideal of an arrangement of linear subspaces in a vector space and investigate when this ideal can be generated by products of linear forms. We introduce a combinatorial construction (blocker duality) which yields…

The paper describes a new algorithm of construction of the nonlinear arithmetic triangle on the basis of numerical simulation and the binary system. It demonstrates that the numbers that fill the nonlinear arithmetic triangle may be…

Let $R$ be a polynomial ring over a field and $I \subset R$ be a Gorenstein ideal of height three that is minimally generated by homogeneous polynomials of the same degree. We compute the multiplicity of the saturated special fiber ring of…

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…