Results 41 to 50 of about 1,404 (215)
In 1974, the author proved that the codimension of the ideal (g1,g2,…,gd) generated in the group algebra K[Zd] over a field K of characteristic 0 by generic Laurent polynomials having the same Newton polytope Γ is equal to d!×Volume(Γ).
Anatoly Kushnirenko
doaj +1 more source
Cohen-Macaulay and (S2) Properties of the Second Power of Squarefree Monomial Ideals
We show that Cohen-Macaulay and (S 2 ) properties are equivalent for the second power of an edge ideal. We give an example of a Gorenstein squarefree monomial ideal I such that S / I 2 satisfies the Serre condition (S 2 ), but is ...
Do Trong Hoang +2 more
doaj +1 more source
Symbolic Powers of Monomial Ideals [PDF]
AbstractWe investigate symbolic and regular powers of monomial ideals. For a square-free monomial ideal I ⊆ 𝕜[x0, … , xn] we show that for all positive integers m, t and r, where e is the big-height of I and . This captures two conjectures (r = 1 and r = e): one of Harbourne and Huneke, and one of Bocci et al. We also introduce the symbolic polyhedron
Cooper, Susan M. +3 more
openaire +2 more sources
New methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$.
Mohammad Farrokhi D. G. +1 more
doaj
Algebraic Algorithms for Even Circuits in Graphs
We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs.
Huy Tài Hà, Susan Morey
doaj +1 more source
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley +1 more source
Parallel Vectors Extraction using Bézier Clipping
Abstract In this paper, we propose a novel local feature extraction algorithm for the parallel vectors (PV) operator. Our method is based on Bézier clipping, which is a bracketing‐based root finding method that is commonly‐used in computer‐aided geometric design.
Nico Daßler, Tobias Günther
wiley +1 more source
Measure‐valued processes for energy markets
Abstract We introduce a framework that allows to employ (non‐negative) measure‐valued processes for energy market modeling, in particular for electricity and gas futures. Interpreting the process' spatial structure as time to maturity, we show how the Heath–Jarrow–Morton approach can be translated to this framework, thus guaranteeing arbitrage free ...
Christa Cuchiero +3 more
wiley +1 more source
Cohen–Macaulayness of Vertex Splittable Monomial Ideals
In this paper, we give a new criterion for the Cohen–Macaulayness of vertex splittable ideals, a family of monomial ideals recently introduced by Moradi and Khosh-Ahang. Our result relies on a Betti splitting of the ideal and provides an inductive way of
Marilena Crupi, Antonino Ficarra
doaj +1 more source

