Related papers: Computing strong regular characteristic pairs with…

In a graph, a Clique-Stable Set separator (CS-separator) is a family $\mathcal{C}$ of cuts (bipartitions of the vertex set) such that for every clique $K$ and every stable set $S$ with $K \cap S = \emptyset$, there exists a cut $( W,W')$ in…

A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…

Let $G$ be an exponential solvable Lie group. By definition $G$ is $\ast$-regular if $ker_{L^1(G)}\pi$ is dense in $ker_{C^\ast(G)}\pi$ for all unitary representations $\pi$ of $G$. Boidol characterized the $\ast$-regular exponential Lie…

Let g = Lie(G) be the Lie algebra of a simple algebraic group G over an algebraically closed field of characteristic 0. Let e be a nilpotent element of g and let g_e = Lie(G_e) where G_e stands for the stabiliser of e in G. For g classical,…

In this paper, we discuss the normality of the toric rings of stable set polytopes, and the set of generators and Gr\"obner bases of toric ideals of stable set polytopes by using the results on that of edge polytopes of finite nonsimple…

Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…

Let R be a standard graded polynomial ring in f variables over a field and Psi be an f by g matrix of linear forms from R, where g is positive and less than f. Assume that the row vector of variables annihilates Psi and that the ideal I…

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…

This paper gives an explicit formula for the multiplier ideals, and consequently for the log canonical thresholds, of any GL(V)xGL(W)-invariant ideal in the symmetric algebra S of the tensor product of V with the dual of W, where V and W…

We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation…

Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…

We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this…

Nagel and R\"omer introduced the class of weakly vertex decomposable simplicial complexes, which include matroid, shifted, and Gorenstein complexes as well as vertex decomposable complexes. They proved that the Stanley-Reisner ideal of…

Let $G$ be a graph with $n$ vertices, and let $A(G)$ and $D(G)$ denote respectively the adjacency matrix and the degree matrix of $G$. Define $$ A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G) $$ for any real $\alpha\in [0,1]$. The…

Let $R$ be a local Gorenstein ring with infinite residue field of arbitrary characteristic. Let $I$ be an $R$--ideal with $g=\height I >0$, analytic spread $\ell$, and let $J$ be a minimal reduction of $I$. We further assume that $I$…

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…

The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the combinatorial structure of neural codes. Every neural ideal…

Given a polynomial ring $C$ over a field and proper ideals $I$ and $J$ whose generating sets involve disjoint variables, we determine how to embed the associated primes of each power of $I+J$ into a collection of primes described in terms…

There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…

A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…