Related papers: Sagbi combinatorics of maximal minors and a Sagbi …
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…
This paper presents a novel Jacobi-style iteration algorithm for solving the problem of distributed submodular maximization, in which each agent determines its own strategy from a finite set so that the global submodular objective function…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
Balkanski and Singer [5] recently initiated the study of adaptivity (or parallelism) for constrained submodular function maximization, and studied the setting of a cardinality constraint. Very recent improvements for this problem by…
The Minor problem, namely the study of the spectrum of a principal submatrix of a Hermitian matrix taken at random on its orbit under conjugation, is revisited, with emphasis on the use of orbital integrals and on the connection with…
We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of \parencite{MiProRa}. We prove that these…
We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…
Incidence-based generalizations of cycle covers, called contributors, extend the Harary-Sachs coefficient theorem for characteristic polynomials of the adjacency matrix of graphs. All minors of the Laplacian resulting from an integer matrix…
With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…
Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…
A random matrix is likely to be well conditioned, and motivated by this well known property we employ random matrix multipliers to advance some fundamental matrix computations. This includes numerical stabilization of Gaussian elimination…
The Jacobi ensemble is one of the classical ensembles of random matrix theory. Prominent in applications are properties of the eigenvalues at the spectrum edge, specifically the distribution of the largest (e.g. Roy's largest root test in…
The higher-order superintegrability of systems separable in polar coordinates is studied using an approch that was previously applied for the study of the superintegrability of a generalized Smorodinsky-Winternitz system. The idea is that…
We uncover connections between maximum likelihood estimation in statistics and norm minimization over a group orbit in invariant theory. We focus on Gaussian transformation families, which include matrix normal models and Gaussian graphical…
We compute conjugacy classes in maximal parabolic subgroups of the general linear group. This computation proceeds by reducing to a ``matrix problem''. Such problems involve finding normal forms for matrices under a specified set of row and…
We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…
In this work, we present a new algorithm for maximizing a non-monotone submodular function subject to a general constraint. Our algorithm finds an approximate fractional solution for maximizing the multilinear extension of the function over…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
We show that the conditions imposed on a second order linear differential equation with rational coefficients on the complex line by requiring it to have regular singularities with fixed exponents at the points of a finite set $P$ and…