Related papers: Closures of quadratic modules
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
We present a general algorithm for constructing a free resolution for unit groups of orders in semisimple rational algebras. The approach is based on computing a contractible $G$-complex employing the theory of minimal classes of quadratic…
We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…
By iterative techniques,we present two fixed point theorems, whose modular formulations are relatively close to the Banach's fixed point theorem in the normed spaces.The first result concerns the fixed point of the strongly contraction…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
Very flat and contradjusted modules naturally arise in algebraic geometry in the study of contraherent cosheaves over schemes. Here, we investigate the structure and approximation properties of these modules over commutative noetherian…
We develop the theory of coregular sequences and codepth for modules that need not be finitely generated or artinian over a Noetherian ring. We use this theory to give a new version of a theorem of Hellus characterizing set-theoretic…
We show that endomorphism rings of cogenerators in the module category of a finite-dimensional algebra A admit a canonical tilting module, whose tilted algebra B is related to A by a recollement. Let M be a gen-finite A-module, meaning…
Let $R$ be a commutative ring. Roughly speaking, we prove that an $R$-module $M$ is flat iff it is a direct limit of $R$-module affine algebraic varieties, and $M$ is a flat Mittag-Leffler module iff it is the union of its $R$-submodule…
Let $(R,\mathfrak{m})$ be a Noetherian local ring and $\widehat{R}$ its $\mathfrak{m}$-adic completion. We study the problem of determining when a finitely generated $\widehat{R}$-module arises from an $R$-module, i.e., when it is…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
We show that the number of parameters for CM-modules of prescribed rank is semi-continuous in families of CM rings of Krull dimension 1. This transfers a result of Knoerrer from the commutative to the not necessarily commutative case. For…
P. M. Cohn showed in 1971 that given a ring $R$, to describe, up to isomorphism, a division ring $D$ generated by a homomorphic image of $R$ is equivalent to specifying the set of square matrices over $R$ which map to singular matrices over…
Let $ R=k[x_1...x_r]$ and $M$ a multigraded $R-$module. In this work we interpret $M$ as a multipersistent homology module and give a multigraded resolution of it. The construction involves cellular resolutions of monomial ideals and…
The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that…
In this paper, we consider the quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces. By using the Legendre property of quadratic forms or the compactness of operators in the presentations of…
We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…
We apply to locally finite partially ordered sets a construction which associates a complete lattice to a given poset; the elements of the lattice are the closed subsets of a closure operator, defined starting from the concurrency relation.…
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…
The p-median problem is a classic discrete location problem with several applications. It aims to open p sites while minimizing the sum of the distances of each client to its nearest open site. We study a Benders decomposition of the most…