Related papers: Hunter's positivity theorem and random vector norm…
The composition operators preserving total non-negativity and total positivity for various classes of kernels are classified, following three themes. Letting a function act by post composition on kernels with arbitrary domains, it is shown…
Given an element in a finite-dimensional real vector space, $V$, that is a nonnegative linear combination of basis vectors for some basis $B$, we compute the probability that it is furthermore a nonnegative linear combination of basis…
We generalize and complete some of Maxim's recent results on Alexander invariants of a polynomial transversal to the hyperplane at infinity. Roughly speaking, and surprisingly, such a polynomial behaves both topologically and algebraically…
The paper develops the general theory for the items in the title, assuming that the matrix is countable and cofinal.
We study inhomogeneous $q$-Whittaker polynomials which extend both $q$-Whittaker and stable Grothendieck polynomials. We prove that inhomogeneous $q$-Whittaker polynomials (in countably many variables) form a basis of certain commutative…
Let $k$ be an uncountable algebraically closed field of positive characteristic and let $S$ be a smooth projective connected surface over $k$. We extend the theorem on the Gysin kernel from [20, Theorem 5.1] to also be true over $k$, where…
The spectral density of random matrices is studied through a quaternionic generalisation of the Green's function, which precisely describes the mean spectral density of a given matrix under a particular type of random perturbation. Exact…
We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…
The main result of the paper is the following generalization of Forelli's theorem: Suppose F is a holomorphic vector field with singular point at p, such that F is linearizable at p and the matrix is diagonalizable with the eigenvalues…
We recall first some basic facts on weighted homogeneous functions and filtrations in the ring $A$ of formal power series. We introduce next their analogues for weighted homogeneous diffeomorphisms and vector fields. We show that the Milnor…
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…
In two recent articles we have examined a generalization of the binomial distribution associated with a sequence of positive numbers, involving asymmetric expressions of probabilities that break the symmetry {\it win-loss}. We present in…
We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular…
This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…
Motivated by symmetric Cauchy matrices, we define symmetric Cauchy tensors and their generating vectors in this paper. Hilbert tensors are symmetric Cauchy tensors. An even order symmetric Cauchy tensor is positive semi-definite if and only…
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…
Identifying the spectrum of the sum of two given Hermitian matrices with fixed eigenvalues is the famous Horn's problem.In this note, we investigate a variant of Horn's problem, i.e., we identify the probability density function (abbr. pdf)…
We discuss a general procedure to generate a class of (everywhere regular) solutions of Einstein equations that can have an (a-priori fixed) arbitrary number of horizons. We then report on work currently in progress i) to find a suitable…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…