activity
20152020
most citedNetworked Fairness in Cake Cutting

6 citations · 14 across the 8 of their papers we have counts for

collaborators

13 papers

math.CO20201 cited

Enumerating alternating matrix spaces over finite fields with explicit coordinates

Youming Qiao

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 a…

math.CO2020

On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions

Xiaoyu He, Youming Qiao

Let be an odd prime. From a simple undirected graph , through the classical procedures of Baer (Trans. Am. Math. Soc., 1938), Tutte (J. Lond. Math. Soc., 1947) and Lovász (B…

math.CO20194 cited

Group-theoretic generalisations of vertex and edge connectivities

Yinan Li, Youming Qiao

Let be an odd prime. Let be a finite -group of class and exponent , whose commutator quotient is of order . We define two parameters for relate…

cs.CR2019

General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography

Zhengfeng Ji, Youming Qiao, Fang Song +1

Starting from the one-way group action framework of Brassard and Yung (Crypto '90), we revisit building cryptography based on group actions. Several previous candidates for one-way…

cs.CC2019

Incorporating Weisfeiler-Leman into algorithms for group isomorphism

Peter A. Brooksbank, Joshua A. Grochow, Yinan Li +2

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically…

cs.DS2019

From independent sets and vertex colorings to isotropic spaces and isotropic decompositions

Xiaohui Bei, Shiteng Chen, Ji Guan +2

In the 1970's, Lovász built a bridge between graphs and alternating matrix spaces, in the context of perfect matchings (FCT 1979). A similar connection between bipartite graphs and…