Related papers: A Combinatorial Algorithm to Find the Minimal Free…
We propose a new approach to combine Restricted Boltzmann Machines (RBMs) that can be used to solve combinatorial optimization problems. This allows synthesis of larger models from smaller RBMs that have been pretrained, thus effectively…
We provide a complete description of the ideal that serves as the resultant ideal for n univariate polynomials of degree d. We in particular describe a set of generators of this resultant ideal arising as maximal minors of a set of…
Many lattice-based crypstosystems employ ideal lattices for high efficiency. However, the additional algebraic structure of ideal lattices usually makes us worry about the security, and it is widely believed that the algebraic structure…
Motivated by a rigidity-theoretic perspective on the Localization Problem in 2D, we develop an algorithm for computing circuit polynomials in the algebraic rigidity matroid associated to the Cayley-Menger ideal for $n$ points in 2D. We…
The purpose of this paper is to investigate properties of the minimal free resolution of the modules of multi-logarithmic forms along a reduced equidimensional subspace. We first consider a notion of freeness for reduced complete…
This paper is concerned with the question of whether geometric structures such as cell complexes can be used to simultaneously describe the minimal free resolutions of all powers of a monomial ideal. We provide a full answer in the case of…
Let $k$ be a field of characteristic zero, and $R=k[x_1, \ldots, x_d]$ with $d \geq 3$ be a polynomial ring in $d$ variables. Let $\m=(x_1, \ldots, x_d)$ be the homogeneous maximal ideal of $R$. Let $\mathcal{K}$ be the kernel of the…
In dimension two, we study complete monomial ideals combinatorially, their Rees algebras and develop effective means to find their defining equations.
Given two finite sequences of positive integers $\alpha$ and $\beta$, we associate a square free monomial ideal $I_{\alpha,\beta}$ in a ring of polynomials $S$, and we recursively compute the algebraic invariants of $S/I_{\alpha,\beta}$.…
We introduce the notion of Betti category for graded modules over suitably graded polynomial rings, and more generally for modules over certain small categories. Our categorical approach allows us to treat simultaneously many important…
We introduce a monomial ideal whose standard monomials encode the vertices of all fibers of a lattice. We study the minimal generators, the radical, the associated primes and the primary decomposition of this ideal, as well as its relation…
Let $R:= \Bbbk[x_1,\ldots,x_{n}]$ be a polynomial ring over a field $\Bbbk$, $I \subset R$ be a homogeneous ideal with respect to a weight vector $\omega = (\omega_1,\ldots,\omega_n) \in (\mathbb{Z}^+)^n$, and denote by $d$ the Krull…
An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…
The Boltzmann model for the random generation of "decomposable" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of…
Finding a \emph{single} best solution is the most common objective in combinatorial optimization problems. However, such a single solution may not be applicable to real-world problems as objective functions and constraints are only…
The vanishing ideal I of a subspace arrangement is an intersection of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of a product J of the…
In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…
A typical goal of research in combinatorial optimization is to come up with fast algorithms that find optimal solutions to a computational problem. The process that takes a real-world problem and extracts a clean mathematical abstraction of…
We introduce to the context of multigraded modules the methods of modules over categories from algebraic topology and homotopy theory. We develop the basic theory quite generally, with a view toward future applications to a wide class of…
The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a…