English
Related papers

Related papers: A constructive method for decomposing real represe…

200 papers

Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…

Optimization and Control · Mathematics 2013-06-04 Yifan Sun , Martin S. Andersen , Lieven Vandenberghe

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Buse , Marc Chardin

The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem. We observe that the previously known method for showing that…

Logic in Computer Science · Computer Science 2023-10-24 Albert Atserias , Joanna Fijalkow

For any root system corresponding to a semisimple simply-laced Lie algebra a logarithmic CFT is constructed. Characters of irreducible representations were calculated in terms of theta functions.

Quantum Algebra · Mathematics 2010-03-01 B. L. Feigin , I. Yu. Tipunin

For any real diagonalizable matrix with complex eigenvalues we provide a real, coordinate free decomposition with a clear geometric interpretation.

History and Overview · Mathematics 2022-08-29 Cristobal Arratia

In this paper we prove that every irreducible representation of a Leibniz algebra can be obtained from irreducible representations of the semisimple Lie algebra from the Levi decomposition. We also prove that - in general - for (semi)simple…

Representation Theory · Mathematics 2015-02-26 Fialowski Alice , Mihálka Éva Zsuzsanna

This is a survey article on real algebra and geometry, and in particular on its recent applications in optimization and convexity. We first introduce basic notions and results from the classical theory. We then explain how these relate to…

Algebraic Geometry · Mathematics 2016-06-24 Tim Netzer

This paper focuses on the biderivations of 4-dimensional nilpotent complex Leibniz algebras. Using the existing classification of these algebras, we develop algorithms to compute derivations, antiderivations, and biderivations as pairs of…

Rings and Algebras · Mathematics 2025-01-22 Ahmed Zahari Abdou , Bouzid Mosbahi

This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…

Rings and Algebras · Mathematics 2025-01-06 Ahmed Zahari Abdou , Bouzid Mosbahi

We present a symbolic tool that provides robust algebraic methods to handle automatic deduction tasks for a dynamic geometry construction. The main prototype has been developed as two different worksheets for the open source computer…

Mathematical Software · Computer Science 2012-02-23 Francisco Botana , Miguel A. Abánades

This paper proposes SAT-based techniques to calculate a specific normal form of a given finite mathematical structure (model). The normal form is obtained by permuting the domain elements so that the representation of the structure is…

Logic in Computer Science · Computer Science 2025-01-15 Mikoláš Janota , Choiwah Chow , João Araújo , Michael Codish , Petr Vojtěchovský

This is an introduction to the Atlas of Lie Groups and Representations software, for computing representation and structure theory of real reductive groups. The user is led through the basic commands of the software, via numerous examples.…

Representation Theory · Mathematics 2008-07-22 Jeffrey Adams

The main goal of representation learning is to acquire meaningful representations from real-world sensory inputs without supervision. Representation learning explains some aspects of human development. Various neural network (NN) models…

Computer Vision and Pattern Recognition · Computer Science 2025-06-10 Takayuki Komatsu , Yoshiyuki Ohmura , Kayato Nishitsunoi , Yasuo Kuniyoshi

A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…

Symbolic Computation · Computer Science 2007-05-23 Thomas Wolf

We present some recently discovered infinite dimensional Lie algebras that can be understood as extensions of the algebra Map(M,g) of maps from a compact p-dimensional manifold to some finite dimensional Lie algebra g. In the first part of…

High Energy Physics - Theory · Physics 2015-06-26 G. Ferretti

A brief proof of Lie's classification of finite dimensional subalgebras of vector fields on the complex plane that have a proper Levi decomposition is given. The proof uses basic representation theory of sl(2, C). This, combined with…

Representation Theory · Mathematics 2025-07-31 Hassan Azad , Indranil Biswas , Ahsan Fazil , Fazal M. Mahomed

Every finite dimensional real representation of a compact real semisimple Lie algebra determines a metric 2-step nilpotent Lie algebra and a corresponding simply connected metric 2-step nilpotent Lie group N. We study the differential…

Differential Geometry · Mathematics 2008-06-18 Patrick Eberlein

We investigate the notion of real form of complex Lie superalgebras and supergroups, both in the standard and graded version. Our functorial approach allows most naturally to go from the superalgebra to the supergroup and retrieve the real…

Rings and Algebras · Mathematics 2023-03-21 Rita Fioresi , Fabio Gavarini

We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…

Representation Theory · Mathematics 2019-02-20 Gunter Malle , Jean Michel

Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…

Symbolic Computation · Computer Science 2013-07-10 Russell Bradford , James H. Davenport , Matthew England , David Wilson
‹ Prev 1 3 4 5 6 7 10 Next ›