Related papers: On the totally positive grassmannian
We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.
We prove an analogue of the fixed-point theorem for the case of definably amenable groups.
We prove an analog of the disintegration theorem for tracial von Neumann algebras in the setting of elementary equivalence rather than isomorphism, showing that elementary equivalence of two direct integrals implies fiberwise elementary…
This article proves the existence of completely positive quasimultiplicative maps from the group algebra of imprimitive reflection groups to the set of bounded operators, and uses those linear maps to define creation and annihilation…
We define the Mie-Gr\"{u}neisen form in five different ways, then demonstrate their equivalence.
Complete characterization of complete positivity preserving non-Markovian master equations is presented.
We establish the equivalence of Gromov ellipticity and subellipticity in the algebraic category.
It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has an alternating sign pattern. Here, a certain weakening of…
In this paper, we obtain a classification theorem of $2$-dimensional complete Lagrangian self-expanders with constant squared norm of the second fundamental form in $\mathbb C^{2}$.
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
Let G be a simple and simply-connected complex algebraic group, and let X \subset G^\vee be the centralizer subgroup of a principal nilpotent element. Ginzburg and Peterson independently related the ring of functions on X with the homology…
In this paper we establish a complete representation theorem for $G$-martingales. Unlike the existing results in the literature, we provide the existence and uniqueness of the second order term, which corresponds to the second order…
We give a new characterization of the two weight inequality for a vector-valued positive operator. Our characterization has a different flavor than the one of Scurry's and H\"{a}nninen's. The proof can be essentially derived from the…
Quillen proved that, if a Hermitian bihomogeneous polynomial is strictly positive on the unit sphere, then repeated multiplication of the standard sesquilinear form to this polynomial eventually results in a sum of Hermitian squares.…
Working from definitions and an elementarily obtained integral formula for the Euler-Mascheroni constant, we give an alternative proof of the classical Puiseux representation of the exponential integral.
We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.
We introduce "neutrabelian algebras", and prove that finite, hereditarily neutrabelian algebras with a cube term are dualizable.
In 2015, Chen, Liang and Wang provided several sufficient conditions for the total positivity of Riordan arrays and asked for combinatorial proofs of these results. In this paper, we present such proofs by constructing suitable planar…
By defining combinatorial moves, we can define an equivalence relation on Gauss words called homotopy. In this paper we define a homotopy invariant of Gauss words. We use this to show that there exist Gauss words that are not homotopically…
We prove a conjecture that arose in the context of a subspace enumeration problem over finite fields. We prove, more generally, a bibasic, double-sum identity, which extends a $q$-analogue of the (terminating) binomial theorem.