Related papers: Bounded reduction of orthogonal matrices over poly…

The aim of this paper is to generalize the classical Marsden-Weinstein reduction procedure for symplectic manifolds to polysymplectic manifolds in order to obtain quotient manifolds which in- herit the polysymplectic structure. This…

We prove the (generalized) principal pivot transform is matrix monotone, in the sense of the L\"owner ordering, under minimal hypotheses. This improves on the recent results of J. E. Pascoe and R. Tully-Doyle, Monotonicity of the principal…

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s) \oplus k(-2s+1)$, where $s \geq3$ is some…

We prove that the radial part of the class one Whittaker function on a split semisimple Lie group can be obtained as an appropriate limit of the Heckman-Opdam hypergeometric function.

The differential systems satisfied by orthogonal polynomials with arbitrary semiclassical measures supported on contours in the complex plane are derived, as well as the compatible systems of deformation equations obtained from varying such…

We show that finding lexicographically minimal $n$ bases in a matroid can be done in polynomial time in the oracle model. This follows from a more general result that the shifted problem over a matroid can be solved in polynomial time as…

The paper investigates the stability properties of restrictions of irreducible representations of the symmetric group to the hyperoctahedral subgroup. A stability result is obtained, analogous to the classical Murnaghan theorem on the…

This paper studies the complexity of matrix Putinar's Positivstellens{\"a}tz on the semialgebraic set that is given by the polynomial matrix inequality. \rev{When the quadratic module generated by the constrained polynomial matrix is…

In this work the matrix exponential function is solved analytically for the special orthogonal groups $SO(n)$ up to $n=9$. The number of occurring $k$-th matrix powers gets limited to $0\leq k \leq n-1$ by exploiting the Cayley-Hamilton…

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are…

Integration of polynomials over the classical groups of unitary, orthogonal and symplectic matrices can be reduced to basic building blocks known as Weingarten functions. We present an elementary derivation of these functions.

In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…

In this paper matrix orthogonal polynomials in the real line are described in terms of a Riemann--Hilbert problem. This approach provides an easy derivation of discrete equations for the corresponding matrix recursion coefficients. The…

We provide a polynomial lower bound on the minimum singular value of an $m\times m$ random matrix $M$ with jointly Gaussian entries, under a polynomial bound on the matrix norm and a global small-ball probability bound $$\inf_{x,y\in…

Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…

We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…

Imposing additional constraints on low-rank optimization has garnered growing interest. However, the geometry of coupled constraints hampers the well-developed low-rank structure and makes the problem intricate. To this end, we propose a…

In this work, we present a cogredient standard form of an orthogonal space over a finite local ring of odd characteristic.

Let $K$ be the field of Laurent series with complex coefficients, let $\mathcal{R}$ be the inverse limit of the standard-graded polynomial rings $K[x_1, \ldots, x_n]$, and let $\mathcal{R}^{\flat}$ be the subring of $\mathcal{R}$ consisting…