Related papers: Bilinear systems with two supports: Koszul resulta…
We present a unifying framework for the key concepts and results of higher Koszul duality theory for N-homogeneous algebras: the Koszul complex, the candidate for the space of syzygies, and the higher operations on the Yoneda algebra. We…
We consider biorthogonal polynomials that arise in the study of a generalization of two--matrix Hermitian models with two polynomial potentials V_1(x), V_2(y) of any degree, with arbitrary complex coefficients. Finite consecutive…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…
We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…
Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set are available in the…
We present a novel, global algorithm for solving polynomial multiparameter eigenvalue problems (PMEPs) by leveraging a hidden variable tensor Dixon resultant framework. Our method transforms a PMEP into one or more univariate polynomial…
Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gradient methods that are at the core of control, machine…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…
Koszul algebras have arisen in many contexts; algebraic geometry, combinatorics, Lie algebras, non-commutative geometry and topology. The aim of this paper and several sequel papers is to show that for any finite dimensional algebra there…
We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…
We generalize the modular Koszul duality of Achar-Riche to the setting of Soergel bimodules associated to any finite Coxeter system. The key new tools are a functorial monodromy action and wall-crossing functors in the mixed modular derived…
Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…
The notion of prop models the operations with multiple inputs and multiple outpus, acting on some algebraic structures like the bialgebras or the Lie bialgebras. In this paper, we generalize the Koszul duality theory of associative algebras…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
We study the principal components of covariance estimators in multivariate mixed-effects linear models. We show that, in high dimensions, the principal eigenvalues and eigenvectors may exhibit bias and aliasing effects that are not present…