English
Related papers

Related papers: Decomposing Linear Representations of Finite Group…

200 papers

We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…

Dynamical Systems · Mathematics 2025-08-06 Marcelo P. Santos , Leon D. da Silva

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

Data Structures and Algorithms · Computer Science 2007-05-23 Kevin K. H. Cheung , Michele Mosca

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…

Symbolic Computation · Computer Science 2010-05-17 Changbo Chen , James H. Davenport , John P. May , Marc Moreno Maza , Bican Xia , Rong Xiao

We study irreducible odd mod $p$ Galois representations $\bar{\rho} \colon \mathrm{Gal}(\overline{F}/F) \to G(\overline{\mathbb{F}}_p)$, for $F$ a totally real number field and $G$ a general reductive group. For $p \gg_{G, F} 0$, we show…

Number Theory · Mathematics 2021-10-18 Najmuddin Fakhruddin , Chandrashekhar Khare , Stefan Patrikis

The theory of nilpotent orbits of simple Lie algebras has seen tremendous developments over the past decades. In this context an important role is played by the component group of the stabilizer of a nilpotent element. In this work, the aim…

Representation Theory · Mathematics 2024-07-17 Emanuele Di Bella , Willem A. De Graaf

We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…

Group Theory · Mathematics 2016-07-18 Bettina Eick , Max Horn

Group sparse representation has shown promising results in image debulrring and image inpainting in GSR [3] , the main reason that lead to the success is by exploiting Sparsity and Nonlocal self-similarity (NSS) between patches on natural…

Computer Vision and Pattern Recognition · Computer Science 2022-12-23 Luoyu Chen , Fei Wu

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

Group Theory · Mathematics 2025-12-23 Zeev Dvir

Let $k/\mathbb F_p$ denote a finite field. For any split connected reductive group $G/W(k)$ and certain CM number fields $F$, we deform certain Galois representations $\overline\rho:Gal(\overline F/F) \to G(k)$ to continuous families…

Number Theory · Mathematics 2020-01-15 Kevin Childers

Let $G$ be a real reductive Lie group, $L$ a compact subgroup, and $\pi$ an irreducible admissible representation of $G$. In this article we prove a necessary and sufficient condition for the finiteness of the multiplicities of $L$-types…

Representation Theory · Mathematics 2023-04-25 Toshiyuki Kobayashi

Let $(\mathbb{T}_f,\mathfrak{m}_f)$ denote the mod $p$ local Hecke algebra attached to a normalised Hecke eigenform $f$, which is a commutative algebra over some finite field $\mathbb{F}_q$ of characteristic $p$ and with residue field…

Number Theory · Mathematics 2020-10-06 Laia Amorós

Let $G$ be a connected semisimple noncompact real Lie group and let $\rho: G \longrightarrow \mathrm{SL}(V)$ be a representation on a finite dimensional vector space $V$ over $\mathbb R$, with $\rho(G)$ closed in $\mathrm{SL}(V)$.…

Representation Theory · Mathematics 2022-06-01 Leonardo Biliotti

Let $F$ be a local non-archimedian field of positive characteristic, $D$ be a skew-field with center $F$ and $ G=D^{\star}$ be the multiplicative group of $D$. The goal of this paper is to provide a canonical decomposition of any complex…

Representation Theory · Mathematics 2019-05-08 David Kazhdan

We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…

Group Theory · Mathematics 2015-08-27 Attila Egri-Nagy , Chrystopher L. Nehaniv

Linear-Optical Passive (LOP) devices and photon counters are sufficient to implement universal quantum computation with single photons, and particular schemes have already been proposed. In this paper we discuss the link between the…

Quantum Physics · Physics 2016-09-08 P. Aniello , R. Coen Cagli

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

Information Theory · Computer Science 2017-04-07 Pierre Comon , Yang Qi , Konstantin Usevich

Let $G$ be a split reductive group with $\dim Z(G) \leq 1$. We show that for any prime $p$ that is large enough relative to $G$, there is a finitely ramified Galois representation $\rho \colon \Gamma_{\mathbb Q} \to G(\mathbb Z_p)$ with…

Number Theory · Mathematics 2022-09-15 Shiang Tang

Phase unwrapping is a key problem in many coherent imaging systems, such as synthetic aperture radar (SAR) interferometry. A general formulation for redundant integration of finite differences for phase unwrapping (Costantini et al., 2010)…

Other Computer Science · Computer Science 2018-05-04 Ravi Lanka

We present an algorithm which computes a cylindrical algebraic decomposition of a semialgebraic set using projection sets computed for each cell separately. Such local projection sets can be significantly smaller than the global projection…

Symbolic Computation · Computer Science 2014-05-21 Adam Strzebonski

Over the past decade, decision diagrams (DDs) have been used to model and solve integer programming and combinatorial optimization problems. Despite successful performance of DDs in solving various discrete optimization problems, their…

Optimization and Control · Mathematics 2024-03-27 Hosseinali Salemi , Danial Davarnia