Related papers: RepLAB: a computational/numerical approach to repr…
A well-known result on Lie Theory states that every finite-dimensional complex solvable Lie algebra can be represented as a matrix Lie algebra, with upper-triangular square matrices as elements. However, this result does not specify which…
This document describes our freely distributed Maple library {\sc spectra}, for Semidefinite Programming solved Exactly with Computational Tools of Real Algebra. It solves linear matrix inequalities with symbolic computation in exact…
Given a subgroup H of a finite group G, we begin a systematic study of the partial representations of G that restrict to global representations of H. After adapting several results from [DEP00] (which correspond to the case where H is…
We discuss a numerical package, named ORTHOCUB, for the computation of linear functionals of both integral and differential type on multivariate polynomial spaces. The weighted sums corresponding to such integral and differential cubatures…
We give an exposition of Natural Topology (NToP), which highlights its advantages for exact computation. The NToP-definition of the real numbers (and continuous real functions) matches recent expert recommendations for exact real…
In this paper we study some algebraic properties of the rack structure as well as the representation theory of it, following the ideas given by M. Elhamdadi and E. M. Moutuou in \cite{Elhamdadi}. We establish a correspondence between the…
In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…
We study finite dimensional representations of the projective modular group. Various explicit dimension formulas are given.
The residual finite-dimensionality of a $\mathrm{C}^*$-algebra is known to be encoded in a topological property of its space of representations, stating that finite-dimensional representations should be dense therein. We extend this…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
We develop an abstract framework for the investigation of quantization and dequantization procedures based on orthogonality relations that do not necessarily involve group representations. To illustrate the usefulness of our abstract method…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
This paper presents a new Matlab toolbox, aimed at facilitating the use of polynomial optimization for stability analysis of nonlinear systems. In the past decade several decisive contributions made it possible to recast this type of…
We introduce a relational approach to program synthesis. The key idea is to decompose synthesis tasks into simpler relational synthesis subtasks. Specifically, our representation decomposes a training input-output example into sets of input…
This paper is a sequel to arXiv:1401.6321. We define and study representation categories based on Deligne categories Rep(GL_t), Rep(O_t), Rep(Sp_2t), where t is any (non-integer) complex number. Namely, we define complex rank analogs of the…
En esta serie de tres articulos, damos una exposicion de varios resultados y problemas abiertos en tres areas de la combinatoria algebraica y geometrica: las matrices totalmente no negativas, las representaciones del grupo simetrico, y los…
Symmetries and equivariance are fundamental to the generalization of neural networks on domains such as images, graphs, and point clouds. Existing work has primarily focused on a small number of groups, such as the translation, rotation,…
We characterize dual spaces and compute hyperdimensions of irreducible representations for two classes of compact hypergroups namely conjugacy classes of compact groups and compact hypergroups constructed by joining compact and finite…