Related papers: More refined enumerations of alternating sign matr…
We show that there is the same number of (n,l)-alternating sign trapezoids as there is of column strict shifted plane partitions of class l-1 with at most n parts in the top row, thereby proving a result that was conjectured independently…
Alternating sign matrices (ASMs) arise as the Dedekind-MacNeille completion of the Bruhat order on the symmetric group. They enjoy fruitful combinatorial and geometric properties, with a particularly rich history on enumerations and…
Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…
We present several algorithms aimed at constructing sparse and structured sparse (row-sparse) generalized inverses, with application to the efficient computation of least-squares solutions, for inconsistent systems of linear equations, in…
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code $DG(m,r)$. This method of construction results in sensing matrices with low…
In this paper, we propose and analyze iterative method based on projection techniques to solve a non-singular linear system Ax = b. In particular, for a given positive integer m, m-dimensional successive projection method (mD-SPM) for…
There has been significant interest and progress recently in algorithms that solve regression problems involving tall and thin matrices in input sparsity time. These algorithms find shorter equivalent of a n*d matrix where n >> d, which…
Based on a nonabelian generalization of electric-magnetic duality, the Dualized Standard Model (DSM) suggests a natural explanation for exactly 3 generations of fermions as the `dual colour' $\widetilde{SU}(3)$ symmetry broken in a…
We formulate a conjecture which generalizes Darmon's "refined class number formula". We discuss relations between our conjecture and the equivariant leading term conjecture of Burns. As an application, we give another proof of the "except…
The support vector machine (SVM) was originally designed for binary classifications. A lot of effort has been put to generalize the binary SVM to multiclass SVM (MSVM) which are more complex problems. Initially, MSVMs were solved by…
We study the low rank regression problem $\my = M\mx + \epsilon$, where $\mx$ and $\my$ are $d_1$ and $d_2$ dimensional vectors respectively. We consider the extreme high-dimensional setting where the number of observations $n$ is less than…
A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…
In this paper we study the differential equations in $D\subseteq \R^{2N}$ having a complete set of independent first integrals. In particular we study the case when the first integrals are…
The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical…
The alternating direction method of multipliers (ADMM) were extensively investigated in the past decades for solving separable convex optimization problems. Fewer researchers focused on exploring its convergence properties for the nonconvex…
The randomized row method is a popular representative of the iterative algorithm because of its efficiency in solving the overdetermined and consistent systems of linear equations. In this paper, we present an extended randomized multiple…
We explore how the combinatorial arrangement of prescribed zeros in a matrix affects the possible eigenvalues that the matrix can obtain. We demonstrate that there are inertially arbitrary patterns having a digraph with no 2-cycle, unlike…
To investigate hyperbinary expansions of a nonnegative integer~$n$, an edge-labeled directed graph $A(n)$ has recently been introduced. After pointing out some new simple facts about its cyclomatic number, we give a relatively simple…
We obtain using exponential quadratic sums, explicit expressions for the number of triple persymmetric matrices over F_2 of given rank. (A matrix [a(i,j)] is persymmetric if a(i,j) = a(r,s) for i+j = r+s)
Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…