相关论文: Hyperdeterminants on semilattices

We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use…

The characteristic polynomial of an $r$-tuple $(A_1,..., A_r)$ of $n \times n$ matrices is the determinant $\det(x_0 I + x_1 A_1 + ... + x_r A_r)$. We show that if $r$ is at least 3 and $A = (A_1,..., A_r)$ is an $r$-tuple of matrices in…

We establish the decidability of the $\Sigma_2$ theory of $\mathscr{D}_h(\leq_h \mathcal{O})$, the hyperarithmetic degrees below Kleene's $\mathcal{O}$, in the language of uppersemilattices with least and greatest element. This requires a…

We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…

We calculate the exceptional points of the eigenvalues of several parameter-dependent Hamiltonian operators of mathematical and physical interest. We show that the calculation is greatly facilitated by the application of the discriminant to…

In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…

Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…

We establish several asymptotic formulae and upper bounds for the count of multiplicatively dependent integer vectors that lie on a fixed hyperplane and have bounded height. This work constitutes a direct extension of the results obtained…

We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schm\"udgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get…

This paper proposes hybrid high-order eigensolvers for the computation of guaranteed lower eigenvalue bounds. These bounds display higher order convergence rates and are accessible to adaptive mesh-refining algorithms. The involved…

In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…

We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that…

Let $\mathbb{W}$ be an irreducible subvariety a Hilbert scheme $Hilb_{p_W} (t) (\mathbb{P}^n )$. We show that under mild hypothesis there are polynomial formulas for the degrees of the loci of hypersurfaces in $\mathbb{P}^n$ with singular…

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…

Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…

In this note, we give a self-contained and elementary proof of the elementary construction of spectral high-dimensional expanders using elementary matrices due to Kaufman and Oppenheim [Proc. 50th ACM Symp. on Theory of Computing (STOC),…

We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest…