Related papers: A constructive method for decomposing real represe…
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in…
We construct a convenient basis for all real semisimple Lie algebras by means of an adapted Chevalley basis of the complexification. It determines rational and in fact half-integer structure constants which we express only in terms of the…
The paper describes two iterative algorithms for solving general systems of M simultaneous linear algebraic equations (SLAE) with real matrices of coefficients. The system can be determined, underdetermined, and overdetermined. Linearly…
We introduce a notion of elliptic differential graded Lie algebra. The class of elliptic algebras contains such examples as the algebra of differential forms with values in endomorphisms of a flat vector bundle over a compact manifold, etc.…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponential complexity, different exploration-guided adaptations…
Computer algebra procedures to manipulate pseudo-differential operators are implemented to perform calculations with integrable models. We use lazy evaluation and streams to represent and operate with pseudo-differential operators. No order…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
In order to understand the structure of the cohomologies involved in the study of projectively equivariant quantizations, we introduce a notion of affine representation of a Lie algebra.We show how it is related to linear representations…
We adopt the $p$-group generation algorithm to classify small-dimensional nilpotent Lie algebras over small fields. Using an implementation of this algorithm, we list the nilpotent Lie algebras of dimension at most~9 over $\F_2$ and those…
Given a compact semialgebraic set S of R^n and a polynomial map f from R^n to R^m, we consider the problem of approximating the image set F = f(S) in R^m. This includes in particular the projection of S on R^m for n greater than m. Assuming…
We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to…
This paper proposes a novel algorithm for the problem of structural image segmentation through an interactive model-based approach. Interaction is expressed in the model creation, which is done according to user traces drawn over a given…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
Slattery (2007) described computational methods to enumerate, construct, and identify finite groups of squarefree order. We generalise Slattery's result to the class of finite groups that have cyclic Sylow subgroups and provide an…
We develop a method to give presentations of quantized function algebras of complex reductive groups. In particular, we give presentations of quantized function algebras of automorphism groups of finite dimensional simple complex Lie…
An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…
In this paper we present algorithms for an efficient implementation of the Localized Orthogonal Decomposition method (LOD). The LOD is a multiscale method for the numerical simulation of partial differential equations with a continuum of…
We give information about finite-dimensional Lie algebras and their representations for model building in 4 and 5 dimensions; e.g., conjugacy classes, types of representations, Weyl dimensional formulas, Dynkin indices, quadratic Casimir…
This thesis was concerned with classifying the real indecomposable solvable Lie algebras with codimension one nilradicals of dimensions two through seven. This thesis was organized into three chapters. In the first, we described the…