Related papers: Sagbi combinatorics of maximal minors and a Sagbi …
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
A trivially zero minor of a matrix is a minor having all its terms in the Leibniz formula equal to zero. A matrix is superregular if all of its minors that are not trivially zero are nonzero. In the area of Coding Theory, superregular…
We define Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay $H$-bases to suitably graded modules over a commutative graded $\mathbf{k}$-algebra, where the index sets of the two gradings may differ.…
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…
We provide explicit formulas for key invariants of special fiber rings of ladder determinantal modules, that is, modules that are direct sums of ideals of maximal minors of a ladder matrix. Our results are given in terms of the…
In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…
Submodular optimization generalizes many classic problems in combinatorial optimization and has recently found a wide range of applications in machine learning (e.g., feature engineering and active learning). For many large-scale…
We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a…
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC's)), and various ensembles of random codes, are studied by combining the competitive minimax approach,…
In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…
We discuss arrangements of equal minors of totally positive matrices. More precisely, we investigate the structure of equalities and inequalities between the minors. We show that arrangements of equal minors of largest value are in…
We present a simple proof of the continuity, in the sense distributions, of the minors of the differential matrices of mappings belonging to grand Sobolev spaces. Such function spaces were introduced in connection with a problem on minimal…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
We formulate the issue of minimality of self-adjoint operators on a Hilbert space as a semi-definite problem, linking the work by Overton in [1] to the characterization of minimal hermitian matrices. This motivates us to investigate the…
Submodular functions and their optimization have found applications in diverse settings ranging from machine learning and data mining to game theory and economics. In this work, we consider the constrained maximization of a submodular…
Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
In linear combinatorial optimization, we aim to find $S^* = \arg\min_{S \in \mathcal{F}} \langle w,\mathbf{1}_S \rangle$ for a family $\mathcal{F} \subseteq 2^U$ over a ground set $U$ of $n$ elements. Traditionally, $w$ is known or…