Related papers: Multi-graded Macaulay Dual Spaces
We consider classes of codimension two Cohen--Macaulay ideals over a standard graded polynomial ring over a field. We revisit Vasconcelos' problem on $3\times 2$ matrices with homogeneous entries and describe the homological details of…
We introduce the Macaulay2 package GradedLieAlgebras for doing computations in graded Lie algebras presented by generators and relations.
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optimization. We introduce the notion of a Lagrangian dual…
Several questions in CR geometry lead naturally to the study of bihomogeneous polynomials $r(z,\bar{z})$ on $\C^n \times \C^n$ for which $r(z,\bar{z})\norm{z}^{2d}=\norm{h(z)}^2$ for some natural number $d$ and a holomorphic polynomial…
We give a complete characterization of degree two rational maps with potential good reduction over local fields. We show this happens exactly when the map corresponds to an integral point in the moduli space. We detail an algorithm by which…
As machine learning has become more prevalent, researchers have begun to recognize the necessity of ensuring machine learning systems are fair. Recently, there has been an interest in defining a notion of fairness that mitigates…
We consider structured optimisation problems defined in terms of the sum of a smooth and convex function, and a proper, l.s.c., convex (typically non-smooth) one in reflexive variable exponent Lebesgue spaces $L_{p(\cdot)}(\Omega)$. Due to…
We present a novel class of methods to compute functions of matrices or their action on vectors that are suitable for parallel programming. Solving appropriate simple linear systems of equations in parallel (or computing the inverse of…
Learning the graphical structure of Bayesian networks is key to describing data-generating mechanisms in many complex applications but poses considerable computational challenges. Observational data can only identify the equivalence class…
We find formulas for the graded core of certain m-primary ideals in a graded ring. In particular, if S is the section ring of an ample line bundle on a Cohen-Macaulay complex projective variety, we show that under suitable hypothesis, the…
Multilevel optimization has gained renewed interest in machine learning due to its promise in applications such as hyperparameter tuning and continual learning. However, existing methods struggle with the inherent difficulty of efficiently…
Integrable systems have provided various insights into physical phenomena and mathematics. The way of constructing many-body integrable systems is limited to few ansatzes for the Lax pair, except for highly inventive findings of conserved…
We consider families of chain-cochain infinite complexes $\mathcal C$ of spaces with elements depending on a number of parameters, and endowed with a converging associative multiple product. The existence of left/right local/non-local…
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…
In this paper the notion of an M-th order invariant bilinear differential pairing is introduced and a formal definition is given. If the manifold has an AHS structure, then various first order pairings are constructed. This yields a…
In this paper we take some classical ideas from commutative algebra, mostly ideas involving duality, and apply them in algebraic topology. To accomplish this we interpret properties of ordinary commutative rings in such a way that they can…
We introduce the package MacaulayPosets written for the computational algebra system Macaulay2. This package utilized the poset data type introduced in the Posets package and offers functionality for studying the Macaulay property for…
We introduce the concept of multilevel fair allocation of resources with tree-structured hierarchical relations among agents. While at each level it is possible to consider the problem locally as an allocation of an agent to its children,…
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…
We introduce a notion of degenerations of graded modules. In relation to it, we also introduce several partial orders as graded analogies of the hom order, the degeneration order and the extension order. We prove that these orders are…