:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Becker, Oren, Lubotzky, Alexander, Mosheiff, Jonathan
Format:	Preprint
Published:	2020
Subjects:	Data Structures and Algorithms Combinatorics Group Theory
Online Access:	https://arxiv.org/abs/2011.05234
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Testability in group theory
by: Becker, Oren, et al.
Published: (2022)

Explicit Lossless Vertex Expanders
by: Hsieh, Jun-Ting, et al.
Published: (2025)

Abelian groups are polynomially stable
by: Becker, Oren, et al.
Published: (2018)

On the Constant-Depth Circuit Complexity of Generating Quasigroups
by: Collins, Nathaniel A., et al.
Published: (2024)

A Faster Isomorphism Test for Graphs of Small Degree
by: Grohe, Martin, et al.
Published: (2018)

Finite matrix multiplication algorithms from infinite groups
by: Blasiak, Jonah, et al.
Published: (2024)

Showcasing straight-line programs with memory via matrix Bruhat decomposition
by: Niemeyer, Alice C., et al.
Published: (2013)

The $Z$-Curve as an $n$-Dimensional Hypersphere: Properties and Analysis
by: Gonzalez, Diego Vazquez, et al.
Published: (2024)

Complexity of Constructing Minimal Faithful Permutation Representations for Fitting-free Groups
by: Levet, Michael, et al.
Published: (2025)

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
by: Johnson, Dan, et al.
Published: (2025)

The Generalized Skew Spectrum of Graphs
by: Bellante, Armando, et al.
Published: (2025)

Breaking the cubic barrier in the Solovay-Kitaev algorithm
by: Kuperberg, Greg
Published: (2023)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
by: Ahmadypour, Niloufar, et al.
Published: (2020)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
by: Li, Xin, et al.
Published: (2024)

Perturbation-Resilient Trades for Dynamic Service Balancing
by: Sima, Jin, et al.
Published: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

Unbounded Error Correcting Codes
by: Efremenko, Klim, et al.
Published: (2024)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

Trellis codes with a good distance profile constructed from expander graphs
by: Zhu, Yubin, et al.
Published: (2026)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

On 2-strong connectivity orientations of mixed graphs and related problems
by: Georgiadis, Loukas, et al.
Published: (2023)

Conditional Non-Soficity of p-adic Deligne Extensions: on a Theorem of Gohla and Thom
by: Chapman, Michael, et al.
Published: (2024)

Non-commutative error correcting codes and proper subgroup testing
by: Chapman, Michael, et al.
Published: (2024)

Streaming algorithms for groups and semigroups
by: Lohrey, Markus, et al.
Published: (2022)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
by: Aubian, Guillaume, et al.
Published: (2025)

Short circuit walks in fixed dimension
by: Black, Alexander E., et al.
Published: (2025)

The Simultaneous Triple Product Property and Group-theoretic Results for the Exponent of Matrix Multiplication
by: Murthy, Sandeep
Published: (2007)

Statistical inference of a ranked community in a directed graph
by: Kunisky, Dmitriy, et al.
Published: (2024)

Composition of random functions and word reconstruction
by: Chapuy, Guillaume, et al.
Published: (2026)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
by: Hou, Jiaxin, et al.
Published: (2023)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
by: Goldenberg, Elazar, et al.
Published: (2024)

On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
by: Fujimaru, Hiroto, et al.
Published: (2025)

A new approach to bipartite stable matching optimization
by: Fleiner, Tamás, et al.
Published: (2024)

PackIt! Gamified Rectangle Packing
by: Garrison, Thomas, et al.
Published: (2024)

Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
by: Cheng, Christine T., et al.
Published: (2026)

Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters
by: Harvey, Nicholas, et al.
Published: (2024)

Construction of orientable sequences in $O(1)$-amortized time per bit
by: Gabric, Daniel, et al.
Published: (2024)

Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
by: Dikstein, Yotam, et al.
Published: (2024)

Systematic Approach to Hyperbolic Quantum Error Correction Codes
by: Mahmoud, Ahmed Adel, et al.
Published: (2025)