#### Filter Results:

#### Publication Year

2000

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this paper, based on ideas from lossy data coding and compression, we present a simple but effective technique for segmenting multivariate mixed data that are drawn from a mixture of Gaussian distributions, which are allowed to be almost degenerate. The goal is to find the optimal segmentation that minimizes the overall coding length of the segmented… (More)

Recently many scientific and engineering applications have involved the challenging task of analyzing large amounts of unsorted high-dimensional data that have very complicated structures. From both geometric and statistical points of view, such unsorted data are considered mixed as different parts of the data have significantly different structures which… (More)

We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest: we give an algorithm which, given a finite number of invertible matrices, computes the Zariski closure of the group generated by these matrices.

Finding the rank of a tensor is a problem that has many applications. Unfortunately it is often very difficult to determine the rank of a given tensor. Inspired by the heuristics of convex relaxation, we consider the nuclear norm instead of the rank of a tensor. We determine the nuclear norm of various tensors of interest. Along the way, we also do a… (More)

We study the left-right action of SL n × SL n on m-tuples of n × n matrices with entries in an infinite field K. We show that invariants of degree n 2 − n define the null cone. Consequently, invariants of degree ≤ n 6 generate the ring of invariants if char(K) = 0. We also prove that for m ≫ 0, invariants of degree at least n⌊ √ n + 1⌋ are required to… (More)

In this paper we give the first method for constructing n-multimagic squares (and hypercubes) for any n. We give an explicit formula in the case of squares and an effective existence proof in the higher dimensional case. Finally we prove that n-multimagic squares do not exist for certain orders.

It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many pairs of graphs, but the pairs of non-isomorphic graphs constructed by Cai, Fürer and Immerman it cannot distinguish. If… (More)

- Chelsea M. Walton, Hendrikus G. Derksen, Leopoldo A. Pando Zayas, Chelsea Walton, Loren Walton, Donald Walton +29 others
- 2015

To a directed graph without loops and 2-cycles, we can associate a skew-symmetric matrix with integer entries. Mutations of such skew-symmetric matrices, and more generally skew-symmetrizable matrices, have been defined in the context of cluster algebras by Fomin and Zelevinsky. The mutation class of a graph Γ is the set of all isomorphism classes of graphs… (More)