Results 41 to 50 of about 25,379 (179)
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
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
On the Stanley depth of powers of some classes of monomial ideals
Given arbitrary monomial ideals $I$ and $J$ in polynomial rings $A$ and $B$ over a field $K$, we investigate the Stanley depth of powers of the sum $I+J$, and their quotient rings, in $A\otimes_K B$ in terms of those of $I$ and $J$.
Cimpoeas, Mircea
core +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
WHEN ARE SYMMETRIC IDEALS MONOMIAL?
The notation has been updated and the main result extended; 9 ...
openaire +2 more sources
Monomial Ideals with Primary Components given by Powers of Monomial Prime Ideals [PDF]
We characterize monomial ideals which are intersections of powers of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
Herzog, Jürgen, Vladoiu, Marius
openaire +4 more sources
ASYMPTOTIC DEGREE OF RANDOM MONOMIAL IDEALS
16 pages, 2 ...
Silverstein, Lily +2 more
openaire +3 more sources
Controlling Dynamical Systems Into Unseen Target States Using Machine Learning
Parameter‐aware next‐generation reservoir computing enables efficient, data‐driven control of dynamical systems across unseen target states and nonstationary transitions. The approach suppresses transient behavior while navigating system collapse scenarios with minimal training data—over an order of magnitude less than traditional methods.
Daniel Köglmayr +2 more
wiley +1 more source
The Monomial Conjecture and order ideals II
Let $I$ be an ideal of height $d$ in a regular local ring $(R,m,k=R/m)$ of dimension $n$ and let $\Omega$ denote the canonical module of $R/I$. In this paper we first prove the equivalence of the following: the non-vanishing of the edge homomorphism ...
Dutta, S. P.
core +1 more source
Self‐Similar Blowup for the Cubic Schrödinger Equation
ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source

