Related papers: Stanley's Zrank Problem on Skew Partitions
In this paper, we obtain infinitely many non-trivial identities and inequalities between full rank differences for 2-marked Durfee symbols, a generalization of partitions introduced by Andrews. A certain strict inequality, which almost…
The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem…
We propose a new algorithm to solve optimization problems of the form $\min f(X)$ for a smooth function $f$ under the constraints that $X$ is positive semidefinite and the diagonal blocks of $X$ are small identity matrices. Such problems…
We establish the existence of positive segregated solutions for competitive nonlinear Schr\"odinger systems in the presence of an external trapping potential, which have the property that each component is obtained from the previous one by…
We look for the origins of the single equation, which is a peculiar combination of W-constrains, which provides the non-abelian W-representation for generalized Kontsevich model (GKM), i.e. is enough to fix the partition function…
We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…
A non-classical Weyl theory is developed for skew-self-adjoint Dirac systems with rectangular matrix potentials. The notion of the Weyl function is introduced and direct and inverse problems are solved. A Borg-Marchenko type uniqueness…
We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1.…
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is transferred by the skew Robinson-Schensted correspondence…
This paper deals with the existence and uniqueness of solutions to kinetic equations describing alignment of self-propelled particles. The particularity of these models is that the velocity variable is not on the euclidean space but…
It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…
By using cutting strips and transformations on outside decompositions of a skew diagram, we show that the Giambelli type matrices of a skew Schur function are stably equivalent to each other over symmetric functions. As a consequence, the…
The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…
We prove that the category of left-handed strongly distributive skew lattices with zero and proper homomorphisms is dually equivalent to a category of sheaves over local Priestley spaces. Our result thus provides a non-commutative version…
We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers.…
Given a matrix of distribution functions and a quasi-stochastic matrix, i.e. an irreducible nonnegative matrix with maximal eigenvalue one and associated unique positive left and right eigenvectors, the article studies the properties of an…
Although exchangeable processes from Bayesian nonparametrics have been used as a generating mechanism for random partition models, we deviate from this paradigm to explicitly incorporate clustering information in the formulation of our…
This work studies skew polycyclic codes over finite chain rings defined by central trinomials. For this class of codes, we investigate Hamming equivalence in the non-commutative (skew) setting. We introduce an equivalence relation on the…
We prove that the sign-rank of the $k$-Hamming Distance matrix on $n$ bits is $2^{O(k)}$, independent of the number of bits $n$. This strongly refutes the conjecture of Hatami, Hatami, Pires, Tao, and Zhao (RANDOM 2022), and Hatami,…
We study the closure of the projection of the (nonconvex) cone of rank restricted positive semidefinite matrices onto subsets of the matrix entries. This defines the feasible sets for semidefinite completion problems with restrictions on…