On the Identity and Group Problems for Complex Heisenberg Matrices
Fuente:
arXiv
Saved in:
| Main Authors: | Bell, Paul C., Niskanen, Reino, Potapov, Igor, Semukhin, Pavel |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On Word Representations and Embeddings in Complex Matrices
by: Bell, Paul C., et al.
Published: (2026)
by: Bell, Paul C., et al.
Published: (2026)
Capturing an Invisible Robber using Separators
by: Potapov, Igor, et al.
Published: (2025)
by: Potapov, Igor, et al.
Published: (2025)
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity
by: Dong, Sally, et al.
Published: (2023)
by: Dong, Sally, et al.
Published: (2023)
Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)
by: Spirkl, Sophie, et al.
Published: (2026)
Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
by: Palagiri, V. S. R., et al.
Published: (2024)
by: Palagiri, V. S. R., et al.
Published: (2024)
The Spectrum of the Singular Values of Z-Shaped Graph Matrices
by: Cai, Wenjun, et al.
Published: (2020)
by: Cai, Wenjun, et al.
Published: (2020)
A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices
by: Pettie, Seth, et al.
Published: (2024)
by: Pettie, Seth, et al.
Published: (2024)
Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)
by: Paul, Kaustav, et al.
Published: (2024)
Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)
by: Goetze, Miriam, et al.
Published: (2024)
Two Proofs of the Hamiltonian Cycle Identity
by: Sawczuk, Hamilton, et al.
Published: (2025)
by: Sawczuk, Hamilton, et al.
Published: (2025)
Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)
by: Bastide, Paul, et al.
Published: (2025)
An upper bound on the number of frequency hypercubes
by: Krotov, Denis S., et al.
Published: (2022)
by: Krotov, Denis S., et al.
Published: (2022)
Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
by: Dadush, Daniel, et al.
Published: (2025)
by: Dadush, Daniel, et al.
Published: (2025)
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
by: Botler, F., et al.
Published: (2024)
by: Botler, F., et al.
Published: (2024)
Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
by: Dvořák, Pavel, et al.
Published: (2023)
by: Dvořák, Pavel, et al.
Published: (2023)
The Bottleneck Birthday Problem
by: Tripathy, Chijul B.
Published: (2025)
by: Tripathy, Chijul B.
Published: (2025)
Bears with Hats and Independence Polynomials
by: Blažej, Václav, et al.
Published: (2021)
by: Blažej, Václav, et al.
Published: (2021)
On a Problem of Ramsey Theory
by: Frasser, Carlos E.
Published: (2024)
by: Frasser, Carlos E.
Published: (2024)
The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
On the Structure of Bad Science Matrices
by: Albors, Alex, et al.
Published: (2024)
by: Albors, Alex, et al.
Published: (2024)
Christoffel Matrices and Sturmian Determinants
by: Reutenauer, Christophe, et al.
Published: (2024)
by: Reutenauer, Christophe, et al.
Published: (2024)
Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)
by: Adak, Rajat, et al.
Published: (2025)
Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2021)
by: Dubinsky, Manuel, et al.
Published: (2021)
A Note on the Complexity of Graph Recoloring
by: Bousquet, Nicolas
Published: (2024)
by: Bousquet, Nicolas
Published: (2024)
Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)
by: Klimm, Max, et al.
Published: (2026)
Improving SAT Solvers on Orthogonal Latin Square Problems
by: Barnoff, Aaron, et al.
Published: (2026)
by: Barnoff, Aaron, et al.
Published: (2026)
Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)
by: Adak, Rajat, et al.
Published: (2025)
Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
by: Auger, David, et al.
Published: (2024)
by: Auger, David, et al.
Published: (2024)
The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs
by: Brinkmann, Julian
Published: (2025)
by: Brinkmann, Julian
Published: (2025)
On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
by: Das, Sandip, et al.
Published: (2026)
by: Das, Sandip, et al.
Published: (2026)
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
by: Burke, Kyle, et al.
Published: (2024)
by: Burke, Kyle, et al.
Published: (2024)
$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
by: Bonamy, Marthe, et al.
Published: (2025)
by: Bonamy, Marthe, et al.
Published: (2025)
Problems on Group-labeled Matroid Bases
by: Hörsch, Florian, et al.
Published: (2024)
by: Hörsch, Florian, et al.
Published: (2024)
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)
by: Lozin, Vadim, et al.
Published: (2022)
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
Strong modules and asynchronous attractors of Boolean networks
by: Ruet, Paul
Published: (2026)
by: Ruet, Paul
Published: (2026)
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020)
by: Bok, Jan, et al.
Published: (2020)
Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces
by: Brucker, Francois, et al.
Published: (2024)
by: Brucker, Francois, et al.
Published: (2024)
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024)
by: Hörsch, Florian, et al.
Published: (2024)
The treewidth and pathwidth of graph unions
by: Alecu, Bogdan, et al.
Published: (2022)
by: Alecu, Bogdan, et al.
Published: (2022)
Similar Items
-
On Word Representations and Embeddings in Complex Matrices
by: Bell, Paul C., et al.
Published: (2026) -
Capturing an Invisible Robber using Separators
by: Potapov, Igor, et al.
Published: (2025) -
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity
by: Dong, Sally, et al.
Published: (2023) -
Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026) -
Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
by: Palagiri, V. S. R., et al.
Published: (2024)