English
Related papers

Related papers: Edmonds' problem and the membership problem for or…

200 papers

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

Computational Complexity · Computer Science 2015-11-17 Anthony Widjaja Lin , Sanming Zhou

We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…

Computational Complexity · Computer Science 2018-04-17 Lukas Fleischer

Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…

Computational Complexity · Computer Science 2025-11-18 Rida Ait El Manssour , George Kenison , Mahsa Shirmohammadi , Anton Varonka , James Worrell

Kostant asked the following question: Let $\mathfrak{g}$ be a simple Lie algebra over the complex numbers. Let $\lambda$ be a dominant integral weight. Then, $V(\lambda)$ is a component of $V(\rho)\otimes V(\rho)$ if and only if $\lambda…

Representation Theory · Mathematics 2023-07-31 Sam Jeralds , Shrawan Kumar

We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…

Discrete Mathematics · Computer Science 2025-09-19 Paul C. Bell , Reino Niskanen , Igor Potapov , Pavel Semukhin

We explicitly calculate the triangle inequalities for the group PSO(8). Therefore we explicitly solve the eigenvalues of sum problem for this group (equivalently describing the side-lengths of geodesic triangles in the corresponding…

Representation Theory · Mathematics 2007-05-23 Michael Kapovich , Shrawan Kumar , John J. Millson

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

Discrete Mathematics · Computer Science 2023-09-12 Ruiwen Dong

Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1,\ldots,a_k$. For bands (idempotent semigroups), we provide a…

Group Theory · Mathematics 2016-04-06 Markus Steindl

A conjecture by Higman asserts that the number of conjugacy classes in the unipotent group of upper triangular matrices over a finite field depends polynomially on the number of elements of the field. We will study several alternative…

Algebraic Geometry · Mathematics 2019-01-29 Sergey Mozgovoy

Consider the action of a connected complex reductive group on a finite-dimensional vector space. A fundamental result in invariant theory states that the orbit closure of a vector v is separated from the origin if and only if some…

Algebraic Geometry · Mathematics 2022-10-26 Cole Franks , Michael Walter

Let V be a standard subspace in the complex Hilbert space H and U : G \to U(H) be a unitary representation of a finite dimensional Lie group. We assume the existence of an element h in the Lie algebra of G such that U(exp th) is the modular…

Functional Analysis · Mathematics 2023-02-22 Karl-Hermann Neeb

A quasi-Toeplitz (QT) matrix is a semi-infinite matrix of the form $A=T(a)+E$ where $T(a)$ is the Toeplitz matrix with entries $(T(a))_{i,j}=a_{j-i}$, for $a_{j-i}\in\mathbb C$, $i,j\ge 1$, while $E$ is a matrix representing a compact…

Numerical Analysis · Mathematics 2022-08-17 D. A. Bini , B. Iannazzo , B. Meini , J. Meng , L. Robol

Let $\mathbb{K}$ be a field of characteristic different from $2$, and let $M_n(\mathbb{K})$ be the algebra of all $n\times n$ matrices over $\mathbb{K}$. We consider the corresponding special Jordan algebra $\mathcal{A}:=M_n(\mathbb{K})^+$…

Rings and Algebras · Mathematics 2026-04-21 Ilja Gogić , Matija Kazalicki , Mateo Tomašević

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

Representation Theory · Mathematics 2025-07-08 Dmitry Fuchs , Alexandre Kirillov

We consider the problem whether for a group G there exists a constant Lambda(G) > 1 such that for any (r,s)-matrix A over the integral group ring ZG the Fuglede-Kadison determinant of the G-equivariant bounded operator from L^2(G)^r to…

Operator Algebras · Mathematics 2020-09-18 Wolfgang Lueck

We show that a finite, connected quiver Q without oriented cycles is a Dynkin or Euclidean quiver if and only if all orbit semigroups of representations of Q are saturated.

Representation Theory · Mathematics 2008-12-20 Calin Chindris

We begin a systematic study of positivity and moment problems in an equivariant setting. Given a reductive group $G$ over $\R$ acting on an affine $\R$-variety $V$, we consider the induced dual action on the coordinate ring $\R[V]$ and on…

Algebraic Geometry · Mathematics 2013-01-07 Jaka Cimpric , Salma Kuhlmann , Claus Scheiderer

An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum eigenvalue function on an affine space of symmetric…

Optimization and Control · Mathematics 2008-04-29 Jiawang Nie , Bernd Sturmfels

The Pauli exclusion principle is fundamental to understanding electronic quantum systems. It namely constrains the expected occupancies $n_i$ of orbitals $\varphi_i$ according to $0 \leq n_i \leq 2$. In this work, we first refine the…

Let $X=X_1\sqcup X_2\sqcup\ldots\sqcup X_k$ be a partitioned set of variables such that the variables in each part $X_i$ are noncommuting but for any $i\neq j$, the variables $x\in X_i$ commute with the variables $x'\in X_j$. Given as input…

Computational Complexity · Computer Science 2024-04-12 V. Arvind , Abhranil Chatterjee , Partha Mukhopadhyay