Related papers: Algebraic combinatorial optimization on the degree…
In this paper, we consider the problem of computing the entire sequence of the maximum degree of minors of a block-structured symbolic matrix (a generic partitioned polynomial matrix) $A = (A_{\alpha\beta} x_{\alpha \beta} t^{d_{\alpha…
In this paper, we address computation of the degree $\mathop{\rm deg Det} A$ of Dieudonn\'e determinant $\mathop{\rm Det} A$ of \[ A = \sum_{k=1}^m A_k x_k t^{c_k}, \] where $A_k$ are $n \times n$ matrices over a field $\mathbb{K}$, $x_k$…
In this paper, we address the noncommutative rank (nc-rank) computation of a linear symbolic matrix \[ A = A_1 x_1 + A_2 x_2 + \cdots + A_m x_m, \] where each $A_i$ is an $n \times n$ matrix over a field $\mathbb{K}$, and $x_i$…
In this paper, we consider the computation of the degree of the Dieudonn\'e determinant of a linear symbolic matrix $A = A_0 + A_1 x_1 + \cdots + A_m x_m$, where each $A_i$ is an $n \times n$ polynomial matrix over $\mathbb{K}[t]$ and…
Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…
Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…
In this paper, we address the weighted linear matroid intersection problem from the computation of the degree of the determinants of a symbolic matrix. We show that a generic algorithm computing the degree of noncommutative determinants,…
In this paper, we consider the problem of computing the rank of a block-structured symbolic matrix (a generic partitioned matrix) $A = (A_{\alpha \beta} x_{\alpha \beta})$, where $A_{\alpha \beta}$ is a $2 \times 2$ matrix over a field…
The principal minors of a tridiagonal matrix satisfy two-term and three-term recurrences [1, 2]. Based on these facts, the current article presents a new efficient and reliable hybrid numerical algorithm for evaluating general n-th order…
In this PhD thesis we will discuss some aspects in Commutative Algebra which have interactions with Algebraic Geometry, Representation Theory and Combinatorics. In particular, in the first chapter we will focus on understanding when certain…
For a linear equality constrained convex optimization problem involving two objective functions with a ``nonsmooth" + ``nonsmooth" composite structure, we study two algorithms derived from a mixed-order dynamical system which incorporates…
Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study the following type of problems: given an integer $k$, the…
Efficient matrix determinant calculations have been studied since the 19th century. Computers expand the range of determinants that are practically calculable to include matrices with symbolic entries. However, the fastest determinant…
An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…
In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literature, our work focuses on leveraging properties of partition…
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-criteria optimization. We provide a combinatorial polynomial time…
We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
The alternating direction method of multipliers (ADMM) were extensively investigated in the past decades for solving separable convex optimization problems. Fewer researchers focused on exploring its convergence properties for the nonconvex…