English
Related papers

Related papers: Computing minimal Gorenstein covers

200 papers

This paper proposes and analyzes a new weak Galerkin method for the eigenvalue problem by using the shifted-inverse power technique. A high order lower bound can be obtained at a relatively low cost via the proposed method. The error…

Numerical Analysis · Mathematics 2018-03-28 Qilong Zhai , Xiaozhe Hu , Ran Zhang

We study criteria for a ring - or more generally, for a small category - to be Gorenstein and for a module over it to be of finite projective dimension. The goal is to unify the universal coefficient theorems found in the literature and to…

K-Theory and Homology · Mathematics 2020-07-27 Ivo Dell'Ambrogio , Greg Stevenson , Jan Stovicek

All reduced descendent Gromov-Witten invariants of $K3$ and abelian surfaces in primitive curve classes can be calculated by the methods of \cite{BOPY,MPT}. To handle the imprimitive curve classes, a multiple cover formula was conjectured…

Algebraic Geometry · Mathematics 2026-05-29 Georg Oberdieck , Rahul Pandharipande

An integral convex polytope ${\mathcal P}$ is said to be Gorenstein if its toric ring $K[{\mathcal P}]$ is normal and Gorenstein. In this paper, Gorenstein cut polytopes of graphs are characterized explicitly. First, we prove that…

Combinatorics · Mathematics 2019-01-11 Hidefumi Ohsugi

Numerical solution of nonlocal constrained value problems with integrable kernels are considered. These nonlocal problems arise in nonlocal mechanics and nonlocal diffusion. The structure of the true solution to the problem is analyzed…

Numerical Analysis · Mathematics 2019-02-26 Qiang Du , Xiaobo Yin

Alternating minimization heuristics seek to solve a (difficult) global optimization task through iteratively solving a sequence of (much easier) local optimization tasks on different parts (or blocks) of the input parameters. While popular…

Computational Complexity · Computer Science 2020-03-10 Peter Bürgisser , Ankit Garg , Rafael Oliveira , Michael Walter , Avi Wigderson

We focus on the structure of a homogeneous Gorenstein ideal $I$ of codimension three in a standard polynomial ring $R=\kk[x_1,\ldots,x_n]$ over a field $\kk$, assuming that $I$ is generated in a fixed degree $d$. For such an ideal $I$ this…

Commutative Algebra · Mathematics 2021-07-13 Dayane Lira , Zaqueu Ramos , Aron Simis

Let I be an m-primary ideal of a Noetherian local ring (R,m). We consider the Gorenstein and complete intersection properties of the associated graded ring G(I) and the fiber cone F(I) of I as reflected in their defining ideals as…

Commutative Algebra · Mathematics 2007-05-23 William Heinzer , Mee-Kyoung Kim , Bernd Ulrich

In this work, we propose and analyse a weak Galerkin method for the electrical impedance tomography based on a bounded variation regularization. We use the complete electrode model as the forward system that is approximated by a weak…

Numerical Analysis · Mathematics 2023-10-03 Ying Liang , Jun Zou

The Jordan type of an Artinian algebra is the Jordan block partition associated to multiplication by a generic element of the maximal ideal. We study the Jordan type for Artinian Gorenstein (AG) local algebras A, and the interaction of…

Commutative Algebra · Mathematics 2021-12-30 Anthony Iarrobino , Pedro Macias Marques

We introduce a $2$-approximation algorithm for the minimum total covering number problem.

Data Structures and Algorithms · Computer Science 2010-08-20 Pooya Hatami

We describe an algorithm that allows to compute a minimal resolution of the Steenrod algebra. The algorithm has built-in knowledge about vanishing lines for the cohomology of sub Hopf algebras of the Steenrod algebra which makes it both…

Algebraic Topology · Mathematics 2019-10-10 Christian Nassau

Let $K$ be an algebraically closed field of characteristic $0$, and let $A$ be an Artinian Gorenstein local commutative and Noetherian $K$--algebra, with maximal ideal $M$. In the present paper we prove a structure theorem describing such…

Commutative Algebra · Mathematics 2010-05-12 Gianfranco Casnati , Juan Elias , Roberto Notari , Maria Evelina Rossi

We present an algorithmic framework for computing generators for the ring of invariants of an Artin-Schreier curve. We give explicit invariants for almost all Artin-Schreier curves of genus up to~8 in standard form, and for a handful of…

Number Theory · Mathematics 2026-02-27 Juanita Duque-Rosero , Elisa Lorenzo García , Beth Malmskog , Renate Scheidler

Given an ordering of the vertices of a graph, the cost of covering an edge is the smaller number of its two ends. The minimum sum vertex cover problem asks for an ordering that minimizes the total cost of covering all edges. We consider…

Data Structures and Algorithms · Computer Science 2024-04-16 Yixin Cao , Ling Gai , Jingyi Liu , Jianxin Wang

We study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data. With the stochastic Galerkin approach, the solutions are represented as…

Numerical Analysis · Mathematics 2018-03-13 Howard C. Elman , Tengfei Su

The development of fast and accurate image reconstruction algorithms is a central aspect of computed tomography. In this paper we address this issue for photoacoustic computed tomography in circular geometry. We investigate the Galerkin…

Numerical Analysis · Mathematics 2017-10-23 Johannes Schwab , Sergiy Pereverzyev , Markus Haltmeier

In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…

Symbolic Computation · Computer Science 2008-05-15 Jaime Gutierrez , David Sevilla

Given a Hilbertian field $k$ and a finite set $\mathcal{S}$ of Krull valuations of $k$, we show that every finite split embedding problem $G \rightarrow {\rm{Gal}}(L/k)$ over $k$ with abelian kernel has a solu\-tion ${\rm{Gal}}(F/k)…

Number Theory · Mathematics 2022-01-10 François Legrand

We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a positive cost function c: V-> Z^{+}, a partition $P_1,..., P_r$ of the edge set $E$, and a parameter $k_i$ for each…

Data Structures and Algorithms · Computer Science 2015-03-19 Suman Kalyan Bera , Shalmoli Gupta , Amit Kumar , Sambuddha Roy
‹ Prev 1 3 4 5 6 7 10 Next ›