Currently displaying 1 – 5 of 5

Showing per page

Order by Relevance | Title | Year of publication

Constructive invariant theory for tori

David Wehlau — 1993

Annales de l'institut Fourier

Consider a rational representation of an algebraic torus T on a vector space V . Suppose that { f 1 , , f p } is a homogeneous minimal generating set for the ring of invariants, k [ V ] T . New upper bounds are derived for the number N V , T : = max { deg f i } . These bounds are expressed in terms of the volume of the convex hull of the weights of V and other geometric data. Also an algorithm is described for constructing an (essentially unique) partial set of generators { f 1 , , f s } consisting of monomials and such that k [ V ] T is integral over k [ f 1 , , f s ] .

Invariants for the modular cyclic group of prime order via classical invariant theory

David L. Wehlau — 2013

Journal of the European Mathematical Society

Let 𝔽 be any field of characteristic p . It is well-known that there are exactly p inequivalent indecomposable representations V 1 , V 2 , ... , V p of C p defined over 𝔽 . Thus if V is any finite dimensional C p -representation there are non-negative integers 0 n 1 , n 2 , ... , n k p - 1 such that V i = 1 k V n i + 1 . It is also well-known there is a unique (up to equivalence) d + 1 dimensional irreducible complex representation of S L 2 ( ) given by its action on the space R d of d forms. Here we prove a conjecture, made by R. J. Shank, which reduces the computation of the ring...

Iterated arc graphs

Danny RorabaughClaude TardifDavid WehlauImed Zaguia — 2018

Commentationes Mathematicae Universitatis Carolinae

The arc graph δ ( G ) of a digraph G is the digraph with the set of arcs of G as vertex-set, where the arcs of δ ( G ) join consecutive arcs of G . In 1981, S. Poljak and V. Rödl characterized the chromatic number of δ ( G ) in terms of the chromatic number of G when G is symmetric (i.e., undirected). In contrast, directed graphs with equal chromatic numbers can have arc graphs with distinct chromatic numbers. Even though the arc graph of a symmetric graph is not symmetric, we show that the chromatic number of the...

Invariants of four subspaces

Gerry W. SchwarzDavid L. Wehlau — 1998

Annales de l'institut Fourier

We consider problems in invariant theory related to the classification of four vector subspaces of an n -dimensional complex vector space. We use castling techniques to quickly recover results of Howe and Huang on invariants. We further obtain information about principal isotropy groups, equidimensionality and the modules of covariants.

Page 1

Download Results (CSV)