From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces

Recommendations

From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces.
Connections between graphs and matrix spaces
Maximal rank in matrix spaces via graph matchings
Isotropic systems
Colouring without colours: graphs and matroids

Cites work

A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
A fast isomorphism test for groups whose Lie algebra has genus 2
A New Algorithm for Generating All the Maximal Independent Sets
A note on spaces of symmetric matrices
A note on the complexity of the chromatic number problem
A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
Alternating forms and self-adjoint operators
An Analysis of Some Graph Theoretical Cluster Techniques
Bipartite perfect matching is in quasi-NC
Classical complexity and quantum entanglement
Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
Computing isometry groups of Hermitian maps
COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
Computing the structure of finite algebras
Constructing a perfect matching is in random NC
Constructive non-commutative rank computation is in deterministic polynomial time
Decomposing \(p\)-groups via Jordan algebras.
Decomposition of quantum Markov chains and its applications
Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\)
Decompositions of Hilbert spaces, stability analysis and convergence probabilities for discrete-time quantum dynamical semigroups
Derandomizing polynomial identity tests means proving circuit lower bounds
Deterministic equation solving over finite fields
Enumerating maximal independent sets with applications to graph colouring.
Exact algorithms for exact satisfiability and number of perfect matchings
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Fast Zeta Transforms for Lattices with Few Irreducibles
Finding central decompositions of p-groups.
Finite groups with modular lattice of centralizers
Generalized Wong sequences and their applications to Edmonds' problems
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
Geometric complexity theory. V: Efficient algorithms for Noether normalization
Graph isomorphism in quasipolynomial time (extended abstract)
Groups with Abelian Central Quotient Group
Hilbert's Nullstellensatz is in the polynomial hierarchy
scientific article; zbMATH DE number 1579275 (Why is no real title available?)
scientific article; zbMATH DE number 1703931 (Why is no real title available?)
scientific article; zbMATH DE number 3949600 (Why is no real title available?)
scientific article; zbMATH DE number 3980484 (Why is no real title available?)
scientific article; zbMATH DE number 3651744 (Why is no real title available?)
scientific article; zbMATH DE number 3698383 (Why is no real title available?)
scientific article; zbMATH DE number 1276816 (Why is no real title available?)
scientific article; zbMATH DE number 1004928 (Why is no real title available?)
scientific article; zbMATH DE number 821271 (Why is no real title available?)
scientific article; zbMATH DE number 826242 (Why is no real title available?)
scientific article; zbMATH DE number 6313127 (Why is no real title available?)
scientific article; zbMATH DE number 3037565 (Why is no real title available?)
scientific article; zbMATH DE number 3041944 (Why is no real title available?)
Irreducible and periodic positive maps
Isomorphism in expanding families of indistinguishable groups.
Isotropic subspaces for skewforms and maximal abelian subgroups of \(p\)-groups
Isotropy index for the connected sum and the direct product of manifolds
Large Abelian Subgroups of p-Groups
Large affine spaces of non-singular matrices
Linear spaces of matrices of constant rank and instanton bundles
Linear spaces of real matrices of constant rank
Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
Matching is as easy as matrix inversion
Maximal Abelian Subgroups of the Symmetric Groups
Maximal independent sets and separating covers
Moduli and classification of irregular Kaehler manifolds (and algebraic varieties) with Albanese general type fibrations. Appendix by Arnaud Beauville
Non-commutative arithmetic circuits with division
Non-commutative Edmonds' problem and matrix semi-invariants
On cliques in graphs
On computing the determinant in small parallel time using a small number of processors
On generating all maximal independent sets
On Matrices Whose Real Linear Combinations are Nonsingular
On symmetric degeneracy loci, spaces of symmetric matrices of constant rank and dual varieties
On the \(n\log{n}\) isomorphism technique (preliminary report)
On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
ON THE CONSTRUCTION OF THE FREE FIELD
On the dimension of spaces of linear transformations satisfying rank conditions
On the isotropic subspace theorems
On the number of maximal independent sets in a graph
Onk-spaces of real matrices
Optimal algorithms of Gram-Schmidt type
Paare alternierender Formen
Pairs of alternating forms and products of two skew-symmetric matrices
Polynomial bounds for rings of invariants
Polynomial degree bounds for matrix semi-invariants
Polynomial-time theory of matrix groups
Primitivity testing of finite nilpotent linear groups.
Quantum Markovian Subsystems: Invariance, Attractivity, and Control
Quantum stochastic processes. II
Random graphs.
Rank properties of subspaces of symmetric and Hermitian matrices over finite fields
Set partitioning via inclusion-exclusion
Singular spaces of matrices and their application in combinatorics
Small Maximal Independent Sets and Faster Exact Graph Coloring
Spaces of matrices of fixed rank
Spinor groups and algebraic coding theory
The computational complexity of some problems of linear algebra
The Factorization of Linear Graphs
The number of generators and orders of Abelian subgroups of finite p-groups
The number of subgroups with trivial unipotent radicals in finite groups of Lie type
The word problem for free fields: a correction and an addendum
Tighter connections between derandomization and circuit lower bounds
Vector fields on spheres

Cited in

(9)

On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions
Enumerating alternating matrix spaces over finite fields with explicit coordinates
Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective
Group-theoretic generalisations of vertex and edge connectivities
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces.
Connections between graphs and matrix spaces
Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions
Bollobás set pair inequalities for compositions

This page was built for publication: From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994986)