Tableau cycling and Catalan numbers.
We consider the multiple ellipses detection problem on the basis of a data points set coming from a number of ellipses in the plane not known in advance, whereby an ellipse is viewed as a Mahalanobis circle with center , radius , and some positive definite matrix . A very efficient method for solving this problem is proposed. The method uses a modification of the -means algorithm for Mahalanobis-circle centers. The initial approximation consists of the set of circles whose centers are determined...
Let be a pure simplicial complex on the vertex set and its Stanley-Reisner ideal in the polynomial ring . We show that is a matroid (complete intersection) if and only if () is clean for all and this is equivalent to saying that (, respectively) is Cohen-Macaulay for all . By this result, we show that there exists a monomial ideal with (pretty) cleanness property while or is not (pretty) clean for all integer . If , we also prove that () is clean if and only if (,...
We give a description of faces, of all codimensions, for the cones spanned by the set of weights associated to the rings of semi-invariants of quivers. For a triple flag quiver and its faces of codimension 1 this description reduces to the result of Knutson-Tao-Woodward on the facets of the Klyachko cone. We give new applications to Littlewood-Richardson coefficients, including a product formula for LR-coefficients corresponding to triples of partitions lying on a wall of the Klyachko cone. We systematically...
Sharma-Kaushik partitions have been used to define distances between vectors with -coordinates. In this paper, “difference matrices” for the partitioning classes have been introduced and investigated. It has been shown that the difference matrices are circulant and that the entries of a product of matrices is an extended intersection number of a distance scheme. The sum of the entries of each row or columns of the product matrix has been obtained. The algebra of matrices generated by the difference...
The end compactification |Γ| of a locally finite graph Γis the union of the graph and its ends, endowed with a suitable topology. We show that π₁(|Γ|) embeds into a nonstandard free group with hyperfinitely many generators, i.e. an ultraproduct of finitely generated free groups, and that the embedding we construct factors through an embedding into an inverse limit of free groups. We also show how to recover the standard description of π₁(|Γ|) given by Diestel and Sprüssel (2011). Finally, we give...