Zobrazeno 1 - 10
of 162
pro vyhledávání: '"QIAO, YOUMING"'
Autor:
Grochow, Joshua A., Qiao, Youming
Many isomorphism problems for tensors, groups, algebras, and polynomials were recently shown to be equivalent to one another under polynomial-time reductions, prompting the introduction of the complexity class TI (Grochow & Qiao, ITCS '21; SIAM J. Co
Externí odkaz:
http://arxiv.org/abs/2306.16317
We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and quantum informa
Externí odkaz:
http://arxiv.org/abs/2306.03135
A fundamental fact about bounded-degree graph expanders is that three notions of expansion -- vertex expansion, edge expansion, and spectral expansion -- are all equivalent. In this paper, we study to what extent such a statement is true for linear-a
Externí odkaz:
http://arxiv.org/abs/2212.13154
Given a bipartite graph $G$, the graphical matrix space $\mathcal{S}_G$ consists of matrices whose non-zero entries can only be at those positions corresponding to edges in $G$. Tutte (J. London Math. Soc., 1947), Edmonds (J. Res. Nat. Bur. Standards
Externí odkaz:
http://arxiv.org/abs/2206.04815
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is decidable
Externí odkaz:
http://arxiv.org/abs/2110.00900
One approach to make progress on the symbolic determinant identity testing (SDIT) problem is to study the structure of singular matrix spaces. After settling the non-commutative rank problem (Garg-Gurvits-Oliveira-Wigderson, Found. Comput. Math. 2020
Externí odkaz:
http://arxiv.org/abs/2109.06403
Publikováno v:
journal of Groups, complexity, cryptology, Volume 14, Issue 1 (August 11, 2022) gcc:9431
We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in \mathbb{F}_q
Externí odkaz:
http://arxiv.org/abs/2012.01085
Autor:
Qiao, Youming
Guided by the connections between hypergraphs and exterior algebras, we study Tur\'an and Ramsey type problems for alternating multilinear maps. This study lies at the intersection of combinatorics, group theory, and algebraic geometry, and has origi
Externí odkaz:
http://arxiv.org/abs/2007.12820
Autor:
Qiao, Youming
We initiate the study of enumerating linear subspaces of alternating matrices over finite fields with explicit coordinates. We postulate that this study can be viewed as a linear algebraic analogue of the classical topic of enumerating labelled graph
Externí odkaz:
http://arxiv.org/abs/2007.05108
Autor:
He, Xiaoyu, Qiao, Youming
Let $p$ be an odd prime. From a simple undirected graph $G$, through the classical procedures of Baer (Trans. Am. Math. Soc., 1938), Tutte (J. Lond. Math. Soc., 1947) and Lov\'asz (B. Braz. Math. Soc., 1989), there is a $p$-group $P_G$ of class $2$ a
Externí odkaz:
http://arxiv.org/abs/2003.07200