Miriam Farber
YOU?
Author Swipe
View article: Generating Product Insights from Community Q&A
Generating Product Insights from Community Q&A Open
In e-commerce sites, customer questions on the product details-page express the customers' information needs about the product. The answers to these questions often provide the necessary information. In this work, we present and address th…
View article: Auto-Annotation Quality Prediction for Semi-Supervised Learning with Ensembles
Auto-Annotation Quality Prediction for Semi-Supervised Learning with Ensembles Open
Auto-annotation by ensemble of models is an efficient method of learning on unlabeled data. Wrong or inaccurate annotations generated by the ensemble may lead to performance degradation of the trained model. To deal with this problem we pr…
View article: Noncrossing partitions, toggles, and homomesy
Noncrossing partitions, toggles, and homomesy Open
We introduce n(n − 1)/2 natural involutions (“toggles”) on the set S of noncrossing partitions π of size n, along with certain composite operations obtained by composing these involutions. We show that for many operations T of this kind, a…
View article: Weak Separation, Pure Domains and Cluster Distance
Weak Separation, Pure Domains and Cluster Distance Open
Following the proof of the purity conjecture for weakly separated sets, recent years have revealed a variety of wider classes of pure domains in different settings. In this paper we show the purity for domains consisting of sets that are w…
View article: Noncrossing Partitions, Toggles, and Homomesies
Noncrossing Partitions, Toggles, and Homomesies Open
We introduce $n(n-1)/2$ natural involutions ("toggles") on the set $S$ of noncrossing partitions $\pi$ of size $n$, along with certain composite operations obtained by composing these involutions. We show that for many operations $T$ of th…
View article: The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree
The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree Open
We consider the set of Hermitian matrices corresponding to a given graph, that is, Hermitian matrices whose nonzero entries correspond to the edges of the graph. When a particular vertex is removed from a graph a number of eigenvalues of t…
View article: A contribution to the connections between Fibonacci numbers and matrix theory
A contribution to the connections between Fibonacci numbers and matrix theory Open
We present a lovely connection between the Fibonacci numbers and the sums of inverses of [math] -triangular matrices, namely, a number [math] is the sum of the entries of the inverse of an [math] [math] -triangular matrix (for [math] ) if …
View article: Arrangements of equal minors in the positive Grassmannian
Arrangements of equal minors in the positive Grassmannian Open
We discuss arrangements of equal minors of totally positive matrices. More precisely, we investigate the structure of equalities and inequalities between the minors. We show that arrangements of equal minors of largest value are in bijecti…
View article: Arrangements Of Minors In The Positive Grassmannian And a Triangulation of The Hypersimplex
Arrangements Of Minors In The Positive Grassmannian And a Triangulation of The Hypersimplex Open
The structure of zero and nonzero minors in the Grassmannian leads to rich combinatorics of matroids. In this paper, we investigate an even richer structure of possible equalities and inequalities between the minors in the positive Grassma…