Related papers: Computing minimal Gorenstein covers

We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank $f$. This problem is equivalent to the Minimum Weight Set Cover problem in which the frequency of every…

We classify simple flops on smooth threefolds, or equivalently, Gorenstein threefold singularities with irreducible small resolution. There are only six families of such singularities, distinguished by Koll{\'a}r's {\em length} invariant.…

We provide an algebraic framework to compute smallest enclosing and smallest circumscribing cylinders of simplices in Euclidean space $\E^n$. Explicitly, the computation of a smallest enclosing cylinder in $\mathbb{E}^3$ is reduced to the…

In Commutative Algebra structure results on minimal free resolutions of Gorenstein modules are of classical interest. We define Gorenstein modules of finite length over the weighted polynomial ring via symmetric matrices in divided powers.…

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

Finite-sheeted covering mappings onto compact connected groups are studied. It is shown that a finite-sheeted covering mapping from a connected Hausdorff topological space onto a compact connected abelian group G must be a homeomorphism…

In any attempt at designing an efficient algorithm for the minimum vertex cover problem, obtaining good upper and lower bounds for the vertex cover number could be crucial. In this article we present a modified greedy algorithm of…

We consider the minimum vertex cover problem in hypergraphs in which every hyperedge has size k (also known as minimum hitting set problem, or minimum set cover with element frequency k). Simple algorithms exist that provide…

The main achievement of this paper is to provide a structure theorem for Artinian, Gorenstein local rings with the property that the square of the maximal ideal is generated by two elements. The moduli problem for this class of local…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

We present a packing-based approximation algorithm for the $k$-Set Cover problem. We introduce a new local search-based $k$-set packing heuristic, and call it Restricted $k$-Set Packing. We analyze its tight approximation ratio via a…

All graphs considered are simple and undirected. The Inverse Eigenvalue Problem of a Graph $G$ (IEP-G) aims to find all possible spectra for matrices whose $(i,j)-$entry, for $i\neq j$, is nonzero precisely when $i$ is adjacent to $j$. A…

Let $(R,\mathfrak{m},\Bbbk)$ be a regular local ring of dimension 3. Let $I$ be a Gorenstein ideal of $R$ of grade 3. Buchsbaum and Eisenbud proved that there is a skew-symmetric matrix of odd size such that $I$ is generated by the…

Let $A$ be a finite dimensional algebra over a field $K$ with enveloping algebra $A^e=A^{op} \otimes_K A$. We call algebras $A$ that have the property that the subcategory of Gorenstein projective modules in $mod-A$ coincide with the…

Let ${\mathbb M}$ be an arbitrary o-minimal structure. Let $G$ be a definably compact definably connected abelian definable group of dimension $n$. Here we compute the new the intrinsic o-minimal fundamental group of $G;$ for each $k>0$,…

The Hausmann-Weinberger invariant of a group G is the minimal Euler characteristic of a closed orientable 4-manifold M with fundamental group G. We compute this invariant for finitely generated free abelian groups and estimate the invariant…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Using techniques coming from the theory of marked bases, we develop new computational methods for detection and construction of Cohen-Macaulay, Gorenstein and complete intersection homogeneous polynomial ideals. Thanks to the functorial…

We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results. Our main hardness result shows that an…

In this paper, we provide sufficient conditions for a space $X$ to satisfy the Ganea conjecture for topological complexity. To achieve this, we employ two auxiliary invariants: weak topological complexity in the sense of Berstein-Hilton,…