Results 51 to 60 of about 887,096 (204)
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
The core of zero-dimensional monomial ideals [PDF]
The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I.
Polini, Claudia +2 more
core +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
A Scalable and Resource‐Efficient Pipelined p‐Computer for Probabilistic Ising Machines
(a) Block diagram of the portfolio optimization problem: given M assets, the goal is to determine the optimal weights w that maximize the expected return (based on the mean historical assets return u), while minimizing the risk, quantified by the assets covariance matrix S.
Deborah Volpe +9 more
wiley +1 more source
Elevating PGBMain algorithm performance through strategic minimal Dickson basis selection [PDF]
In this paper, we enhance the PGBMain algorithm, an efficient method for computing Gröbner bases of parametric polynomial ideals, or Gröbner systems. A key step in the PGBMain algorithm involves computing a minimal Dickson basis in each iteration, which ...
Mahdi Dehghani Darmian
doaj +1 more source
Lasso for hierarchical polynomial models
Abstract The divisibility conditions implicit in a polynomial hierarchy suggest parameter constraints in regression. With this idea, we establish strong and weak hierarchies for both the lasso and relaxed lasso. Our proposal extends prior work on hierarchical lasso, which was mainly concerned with models of degree 2.
H. Maruri‐Aguilar, S. Lunagómez
wiley +1 more source
Good Real Perturbations of Simple Corank One Map Germs From R3$\mathbb {R}^3$ to R3$\mathbb {R}^3$
ABSTRACT The existence of good real perturbations of map germs is one of the most interesting open questions in singularity theory. In this paper, we investigate this question for all simple corank one map germs from R3$\mathbb {R}^3$ to R3$\mathbb {R}^3$, we give a complete description of those that admit a good real perturbation.
A. J. Miranda, M. J. Saia, T. O. Souza
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
We developed core‐shell iron oxide@ZIF‐8 magnetic‐MOF nanohybrids via a seeded growth method for magnetic hyperthermia‐triggered drug delivery. Cubic cores and thinner shells maximized heating. In‐situ doxorubicin encapsulation achieved 98% loading, better than surface encapsulation. Polymer coating improved stability.
Ana Maria Panaite +11 more
wiley +1 more source
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a linear resolution or being Cohen--Macaulay may be derived from the combinatorial structure of the graph.
openaire +2 more sources

