Related papers: Computing with matrix invariants

The space of n (ordered) points on the projective line, modulo automorphisms of the line, is one of the most important and classical examples of an invariant theory quotient, and is one of the first examples given in any course. Generators…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K[X]^G in the case where G is reductive. Furthermore, we address the case where G is connected and…

Let $(S,p)$ be a smooth pointed surface. In the first part of this paper we study motivic invariants of punctual nested Hilbert schemes attached to $(S,p)$ using the Hilbert-Samuel stratification. We compute two infinite families of motivic…

In 2005, Shen introduced a new invariant, $\mathcal G(N)$, of a diffuse von Neumann algebra $N$ with a fixed faithful trace, and he used this invariant to give a unified approach to showing that large classes of ${\mathrm{II}}_1$ factors…

This paper studies separating invariants: mappings on $D$ dimensional domains which are invariant to an appropriate group action, and which separate orbits. The motivation for this study comes from the usefulness of separating invariants in…

In the following short paper we list some useful results concerning determinants and inverses of matrices. First we show, how to calculate determinants of $d \times d$ matrices, if their traces are known. As a next step $4 \times 4$…

We adapt the CRT approach for computing Hilbert class polynomials to handle a wide range of class invariants. For suitable discriminants D, this improves its performance by a large constant factor, more than 200 in the most favourable…

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…

The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence…

In this work, we analyze the combinatorial properties of cylinders and subdivisions of augmented semi-simplicial sets. These constructions are obtained as particular cases of a certain action from a co-semi-simplicial set on an augmented…

We provide a unified approach, via deformations of incidence algebras, to several important types of representations with finiteness conditions, as well as the combinatorial algebras which produce them. We show that over finite dimensional…

Let $X$ be a smooth polarized algebraic surface over the compex number field. We discuss the invariants obtained from the moduli stacks of semistable sheaves of arbitrary ranks on $X$. For that purpose, we construct the virtual fundamental…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

Algebraic tools in statistics have recently been receiving special attention and a number of interactions between algebraic geometry and computational statistics have been rapidly developing. This paper presents another such connection,…

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

The probability that a tuple of matrices together with all scalars generates a finite incidence ring is calculated. It is proved that all real and complex finite-dimensional incidence algebras are generated by two randomly chosen matrices.

The algebraic formulation of Large N matrix mechanics recently developed by Halpern and Schwartz leads to a practical method of numerical computation for both action and Hamiltonian problems. The new technique posits a boundary condition on…

The main goal of this paper is to generalize several results concerning cardinal invariants to the statements about the associated families of sets. We also discuss the relationship between the additive properties of sets and their Borel…

A genus one curve of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We describe a general method for investigating the invariant theory of such models. We use it to explain how we found our…