Results 81 to 90 of about 4,148,143 (214)
Segre Class Computation and Practical Applications
Let $X \subset Y$ be closed (possibly singular) subschemes of a smooth projective toric variety $T$. We show how to compute the Segre class $s(X,Y)$ as a class in the Chow group of $T$.
Harris, Corey, Helmer, Martin
core +1 more source
Gadolinium‐based contrast agents (GBCAs) revolutionize magnetic resonance imaging diagnostics but pose challenges due to their environmental impact and potential health risks. This article explores the chemistry, biomedical applications, and ecological concerns of GBCAs, proposing innovative strategies to mitigate these issues, including dose reduction,
Angelo Scarciglia +5 more
wiley +1 more source
Comparing complexities of problems of determining of Grebner’s basis of ideal and solving this ideal
A new method of investigation of ideals in the rings of polynomials was proposed by B. Buchberger in 1965. He proposed to use special basis in such rings named “Gröbner Basis” in the honor of his teacher.
A. V. Shokurov
doaj
On the first fall degree of summation polynomials
We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.
Kousidis Stavros, Wiemers Andreas
doaj +1 more source
A Note on the Local Observability of Uniform Hypergraphs
ABSTRACT Hypergraphs generalize graphs in such a way that edges may connect any number of nodes. If all edges are adjacent to the same number of nodes, the hypergraph is called uniform. Thus, a graph is a 2‐uniform hypergraph. Each uniform hypergraph can be identified with an autonomous dynamical state‐space system, whose vector field is composed of ...
Daniel Gerbet, Klaus Röbenack
wiley +1 more source
Let K be a field equipped with a valuation. Tropical varieties over K can be defined with a theory of Gr{\"o}bner bases taking into account the valuation of K.
Vaccon, Tristan, Yokoyama, Kazuhiro
core +2 more sources
On minimal presentations of numerical monoids
Abstract We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing this problem, we apply tools from Hilbert functions and free resolutions of artinian standard graded ...
Alessio Moscariello, Alessio Sammartano
wiley +1 more source
Algorithms for computing Gröbner bases of ideal interpolation
This paper proposes algorithms for computing the reduced Gröbner basis of the vanishing ideal of a finite set of points in the frame of ideal interpolation. We also consider the case that the points have multiplicity conditions.
Xue Jiang, Yihe Gong
doaj +1 more source
On the natural nullcones of the symplectic and general linear groups
Abstract Consider a group acting on a polynomial ring S$S$ over a field K$\mathbb {K}$ by degree‐preserving K$\mathbb {K}$‐algebra automorphisms. Several key properties of the invariant ring can be deduced by studying the nullcone of the action, that is, the vanishing locus of all nonconstant homogeneous invariant polynomials.
Vaibhav Pandey +2 more
wiley +1 more source
The symbolic problems associated with Runge-Kutta methods and their solving in Sage
Runge-Kutta schemes play a very important role in solving ordinary differential equations numerically. At first we want to present the Sage routine for calculation of Butcher matrix, we call it an rk package.
Yu Ying
doaj +1 more source

