Related papers: Decomposing Linear Representations of Finite Group…
To classify the finite dimensional pointed Hopf algebras with $G= {\rm HS}$ or ${\rm Co3}$ we obtain the representatives of conjugacy classes of $G$ and all character tables of centralizers of these representatives by means of software {\rm…
We introduce a spreading out technique to deduce finiteness results for \'etale fundamental groups of complex varieties by characteristic $p$ methods, and apply this to recover a finiteness result proven recently for local fundamental…
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…
We consider lifting of mod p representations to mod p^2 representations in the setting of representations of (i) finite groups; (ii) absolute Galois groups of abstract fields; and (iii) absolute Galois groups of local and global fields.
The notion of a \emph{$G$-completely reducible} subgroup is important in the study of algebraic groups and their subgroup structure. It generalizes the usual idea of complete reducibility from representation theory: a subgroup $H$ of a…
This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless…
Let $G$ be a simply connected, connected completely solvable Lie group with Lie algebra $\mathfrak{g}=\mathfrak{p}+\mathfrak{m}.$ Next, let $\pi$ be an infinite-dimensional unitary irreducible representation of $G$ obtained by inducing a…
Composition is an important feature of a specification language, as it enables the design of a complex system in terms of a product of its parts. Decomposition is equally important in order to reason about structural properties of a system.…
We continue the study of glider representations of finite groups $G$ with given structure chain of subgroups $e \subset G_1 \subset \ldots \subset G_d = G$. We give a characterization of irreducible gliders of essential length $e \leq d$…
We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…
We investigate the representation theory of domestic group schemes $\mathcal{G}$ over an algebraically closed field of characteristic $p > 2$. We present results about filtrations of induced modules, actions on support varieties, Clifford…
Superpixel decomposition methods are widely used in computer vision and image processing applications. By grouping homogeneous pixels, the accuracy can be increased and the decrease of the number of elements to process can drastically…
The paper introduces a novel representation for Generalized Planning (GP) problems, and their solutions, as C++ programs. Our C++ representation allows to formally proving the termination of generalized plans, and to specifying their…
Let $K$ be an unramified $p$-adic local field and let $W$ be the ring of integers of $K$. Let $(X,S)/W$ be a smooth proper scheme together with a simple normal crossings divisor and fix positive integers $r$ and $f$. We show that the set of…
We study the semisimplification of the full karoubian subcategory generated by the irreducible finite dimensional representations of the algebraic supergroup $GL(m|n)$ over an algebraically closed field of characteristic zero. This…
In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a method for obtaining sparse solutions of underdetermined systems of linear equations, and its applications…
Entanglement transformation of composite quantum systems is investigated in the context of group representation theory. Representation of the direct product group $SL(2,C)\otimes SL(2,C)$, composed of local operators acting on the binary…
Bayesian optimization (BO) is a powerful framework for optimizing expensive black-box objectives, yet extending it to graph-structured domains remains challenging due to the discrete and combinatorial nature of graphs. Existing approaches…
In this paper, we provide an elementary, geometric, and unified framework to analyze conic programs that we call the strict complementarity approach. This framework allows us to establish error bounds and quantify the sensitivity of the…
Let $\ell$ be a prime and let $q$ be a prime power not divisible by $\ell$. Put $G=\mathrm{GL}_n(\mathrm{F}_q)$ and fix an irreducible cuspidal representation, $\bar{\pi}$, of $G$ over a sufficiently large finite field, $k$, of…