#### Filter Results:

- Full text PDF available (38)

#### Publication Year

1998

2017

- This year (3)
- Last 5 years (15)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Yi Ma, Harm Derksen, Wei Hong, John Wright
- IEEE Transactions on Pattern Analysis and Machine…
- 2007

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)

- Yi Ma, Allen Y. Yang, Harm Derksen, Robert M. Fossum
- SIAM Review
- 2008

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)

- Harm Derksen, Jerzy Weyman
- 2000

Σ(Q,α) is defined in the space of all weights by one homogeneous linear equation and by a finite set of homogeneous linear inequalities. In particular the set Σ(Q,α) is saturated, i.e., if nσ ∈ Σ(Q,α), then also σ ∈ Σ(Q,α). These results, when applied to a special quiver Q = Tn,n,n and to a special dimension vector, show that the GLn-module Vλ appears in Vμ… (More)

Invariant theory has been a major subject of research in the 19th century. One of the highlights was Gordan’s famous theorem from 1868 showing that the invariants and covariants of binary forms have a finite basis. His method was constructive and led to explicit degree bounds for a system of generators (Jordan 1876/79). In 1890, Hilbert presented a very… (More)

- Harm Derksen
- 2005

The vanishing ideal I of a subspace arrangement V1 ∪ V2 ∪ · · · ∪ Vm ⊆ V is an intersection I1 ∩ I2 ∩ · · · ∩ Im of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of the product ideal J = I1I2 · · · Im without any assumptions on the subspace arrangement. It… (More)

- Harm Derksen
- 2001

Hilbert proved that invariant rings are finitely generated for linearly reductive groups acting rationally on a finite dimensional vector space. Popov gave an explicit upper bound for the smallest integer d such that the invariants of degree ≤ d generate the invariant ring. This bound has factorial growth. In this paper we will give a bound which depends… (More)

We continue the study of quivers with potentials and their representations initiated in the first paper of the series. Here we develop some applications of this theory to cluster algebras. As shown in the “Cluster algebras IV” paper, the cluster algebra structure is to a large extent controlled by a family of integer vectors called g-vectors, and a family… (More)

- Harm Derksen
- 2002

Suppose that G is a linearly reductive group. Good degree bounds for generators of invariant rings were given in [2]. Here we study the minimal free resolution of the invariant ring. Recently it was shown that if G is a finite linearly reductive group, then the ring of invariants is generated in degree ≤ |G| (see [5, 6, 3]). This extends the classical… (More)

- Harm Derksen
- Foundations of Computational Mathematics
- 2016

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)

- Harm Derksen, Emmanuel Jeandel, Pascal Koiran
- J. Symb. Comput.
- 2005

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.