Related papers: Decomposing Linear Representations of Finite Group…
New methods for $D$-decomposition analysis are presented. They are based on topology of real algebraic varieties and computational real algebraic geometry. The estimate of number of root invariant regions for polynomial parametric families…
Given a locally compact quantum group $\mathbb G$, we define and study representations and C$^\ast$-completions of the convolution algebra $L_1(\mathbb G)$ associated with various linear subspaces of the multiplier algebra $C_b(\mathbb G)$.…
Consider the triplet $(E, \mathcal{P}, \pi)$, where $E$ is a finite ground set, $\mathcal{P} \subseteq 2^E$ is a collection of subsets of $E$ and $\pi : \mathcal{P} \rightarrow [0,1]$ is a requirement function. Given a vector of marginals…
Cooperative co-evolution (CC) algorithms, based on the divide-and-conquer strategy, have emerged as the predominant approach to solving large-scale global optimization (LSGO) problems. The efficiency and accuracy of the grouping stage…
Let $\mathscr {C}(G,H,\psi)$ be a finite group scheme-theoretical category over an algebraically closed field of characteristic $p\ge 0$ as introduced by the first author. For any indecomposable exact module category over $\mathscr…
In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…
In the theory of finite groups, the irreducible representations of G over a field F are classified into blocks based on a direct decompositions of the group algebra FG. This gives a natural decomposition of FG-modules into direct summands,…
Decomposing an algebraic variety into irreducible or equidimensional components is a fundamental task in classical algebraic geometry and has various applications in modern geometry engineering. Several researchers studied the problem and…
In this paper, we discuss a method of constructing separable representations of the $C^*$-algebras associated to strongly connected row-finite $k$-graphs $\Lambda$. We begin by giving an alternative characterization of the…
We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…
One aspect of the Langlands program for linear groups is lifting of characters, which relates virtual representations on a group $G$ with those on an endoscopic group for $G$. The goal of this paper is to extend this theory to nonlinear…
A representation $\rho$ of a compact group $\mathbb{G}$ selects eigenvalues if there is a continuous circle-valued map on $\mathbb{G}$ assigning an eigenvalue of $\rho(g)$ to every $g\in \mathbb{G}$. For every compact connected…
We study local generalized additive decompositions (GADs) of homogeneous polynomials and their associated point schemes through their local inverse systems. We prove that their construction and algebraic properties are independent of the…
simpcomp is an extension (a so called package) to GAP, the well known system for computational discrete algebra. The package enables the user to compute numerous properties of (abstract) simplicial complexes, provides functions to construct…
We present an algorithm for computing the $p$-component of the automorphic representation arising from a cuspidal newform $f$ for a prime $p$. This is equivalent to computing the restriction to the decomposition group at $p$ of the…
Patch-based sparse representation modeling has shown great potential in image compressive sensing (CS) reconstruction. However, this model usually suffers from some limits, such as dictionary learning with great computational complexity,…
We give a practical computer algebra implementation of the Covering Lemma for finite transformation semigroups. The lemma states that given a surjective relational morphism $(X,S)\twoheadrightarrow(Y,T)$, we can establish emulation by a…
We study the problem of deciding whether or not the image of an irreducible representation of the braid group $\B_3$ of degree $\leq 5$ has finite image if we are only given the eigenvalues of a generator. We provide a partial algorithm…
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 introduces the Attribute-Decomposed GAN, a novel generative model for controllable person image synthesis, which can produce realistic person images with desired human attributes (e.g., pose, head, upper clothes and pants)…