Related papers: Computations over Local Rings in Macaulay2
The Macaulay2 package NumericalSchubertCalculus provides methods for the numerical computation of Schubert problems on Grassmannians. It implements both the Pieri homotopy algorithm and the Littlewood-Richardson homotopy algorithm. Each…
In this paper, we explore a relationship between Hilbert functions and the irreducible decompositions of ideals in local rings. Applications are given to characterize the regularity, Gorensteinness, Cohen-Macaulayness and sequentially…
This is a survey paper on applications of mathematics of semirings to numerical analysis and computing. Concepts of universal algorithm and generic program are discussed. Relations between these concepts and mathematics of semirings are…
We compute the local cohomology modules H_Y^(X,O_X) in the case when X is the complex vector space of n x n symmetric, respectively skew-symmetric matrices, and Y is the closure of the GL-orbit consisting of matrices of any fixed rank, for…
The set of the first Hilbert coefficients of parameter ideals relative to a module--its Chern coefficients--over a local Noetherian ring codes for considerable information about its structure--noteworthy properties such as that of…
Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…
This is an expository version of our paper [arXiv:1902.07384]. Our aim is to present recent Macaulay2 algorithms for computation of mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over…
We study the local face modules of triangulations of simplices, i.e., the modules over face rings whose Hilbert functions are local $h$-vectors. In particular, we give resolutions of these modules by subcomplexes of Koszul complexes as well…
Let R be a Cohen-Macaulay local ring. In this paper we study the structure of Ulrich $R$-modules mainly in the case where R has minimal multiplicity. We explore generation of Ulrich R-modules, and clarify when the Ulrich R-modules are…
Let $\fa$ be an ideal of a Noetherian local ring $R$ and let $C$ be a semidualizing $R$-module. For an $R$-module $X$, we denote any of the quantities $\fd_R X$, $\Gfd_R X$ and $\GCfd_RX$ by $\T(X)$. Let $M$ be an $R$-module such that…
We contribute a new algebraic method for computing the orthogonal projections of a point onto a rational algebraic surface embedded in the three dimensional projective space. This problem is first turned into the computation of the finite…
This paper, broadly speaking, covers the use of randomness in two main areas: low-rank approximation and kernel methods. Low-rank approximation is very important in numerical linear algebra. Many applications depend on matrix decomposition…
In analogy with the classical, affine toric rings, we define a local toric ring as the quotient of a regular local ring modulo an ideal generated by binomials in a regular system of parameters with unit coefficients; if the coefficients are…
Motivated by the notion of geometrically linked ideals, we show that over a Gorenstein local ring $R$, if a Cohen-Macaulay $R$-module $M$ of grade $g$ is linked to an $R$-module $N$ by a Gorenstein ideal $c$, such that $Ass_R(M)\cap…
Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…
Computing high-quality independent sets quickly is an important problem in combinatorial optimization. Several recent algorithms have shown that kernelization techniques can be used to find exact maximum independent sets in medium-sized…
Let $R$ be a local ring of characteristic $p>0$ which is $F$-finite and has perfect residue field. We compute the generalized Hilbert-Kunz invariant for certain modules over several classes of rings: hypersurfaces of finite representation…
Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we have the rank decoding problem, which is used in the construction of public-key cryptography.…
The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…