Image de couverture de livre

Testability of relations between permutations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Becker, Oren, Lubotzky, Alexander, Mosheiff, Jonathan
Format:	Preprint
Publié:	2020
Sujets:	Data Structures and Algorithms Combinatorics Group Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Testability in group theory
par: Becker, Oren, et autres
Publié: (2022)

Explicit Lossless Vertex Expanders
par: Hsieh, Jun-Ting, et autres
Publié: (2025)

Abelian groups are polynomially stable
par: Becker, Oren, et autres
Publié: (2018)

On the Constant-Depth Circuit Complexity of Generating Quasigroups
par: Collins, Nathaniel A., et autres
Publié: (2024)

A Faster Isomorphism Test for Graphs of Small Degree
par: Grohe, Martin, et autres
Publié: (2018)

Finite matrix multiplication algorithms from infinite groups
par: Blasiak, Jonah, et autres
Publié: (2024)

Showcasing straight-line programs with memory via matrix Bruhat decomposition
par: Niemeyer, Alice C., et autres
Publié: (2013)

The $Z$-Curve as an $n$-Dimensional Hypersphere: Properties and Analysis
par: Gonzalez, Diego Vazquez, et autres
Publié: (2024)

Complexity of Constructing Minimal Faithful Permutation Representations for Fitting-free Groups
par: Levet, Michael, et autres
Publié: (2025)

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
par: Johnson, Dan, et autres
Publié: (2025)

On 2-strong connectivity orientations of mixed graphs and related problems
par: Georgiadis, Loukas, et autres
Publié: (2023)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
par: Ahmadypour, Niloufar, et autres
Publié: (2020)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
par: Li, Xin, et autres
Publié: (2024)

Perturbation-Resilient Trades for Dynamic Service Balancing
par: Sima, Jin, et autres
Publié: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Unbounded Error Correcting Codes
par: Efremenko, Klim, et autres
Publié: (2024)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
par: Con, Roni, et autres
Publié: (2024)

Trellis codes with a good distance profile constructed from expander graphs
par: Zhu, Yubin, et autres
Publié: (2026)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

The Generalized Skew Spectrum of Graphs
par: Bellante, Armando, et autres
Publié: (2025)

Breaking the cubic barrier in the Solovay-Kitaev algorithm
par: Kuperberg, Greg
Publié: (2023)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
par: Aubian, Guillaume, et autres
Publié: (2025)

Short circuit walks in fixed dimension
par: Black, Alexander E., et autres
Publié: (2025)

Conditional Non-Soficity of p-adic Deligne Extensions: on a Theorem of Gohla and Thom
par: Chapman, Michael, et autres
Publié: (2024)

Non-commutative error correcting codes and proper subgroup testing
par: Chapman, Michael, et autres
Publié: (2024)

Streaming algorithms for groups and semigroups
par: Lohrey, Markus, et autres
Publié: (2022)

A Note on Generic Tangle Algorithms
par: Elbracht, Christian, et autres
Publié: (2020)

Engineering Data Reduction for Nested Dissection
par: Ost, Lara, et autres
Publié: (2020)

Representative set statements for delta-matroids and the Mader delta-matroid
par: Wahlström, Magnus
Publié: (2023)

Testing H-freeness on sparse graphs, the case of bounded expansion
par: Humeau, Samuel, et autres
Publié: (2025)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
par: Karamchedu, Mithra, et autres
Publié: (2025)

Liar's vertex-edge domination in unit disk graph
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
par: Jones, Mark, et autres
Publié: (2025)

Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
par: Bell, Tolson, et autres
Publié: (2023)

Algorithmic study on liar's vertex-edge domination problem
par: Bhattacharya, Debojyoti, et autres
Publié: (2023)

Improved Upper Bounds for the Directed Flow-Cut Gap
par: Bodwin, Greg, et autres
Publié: (2026)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
par: Chudnovsky, Maria, et autres
Publié: (2024)

Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
par: Scheinerman, Danny
Publié: (2024)

Counting Permutation Patterns with Multidimensional Trees
par: Beniamini, Gal, et autres
Publié: (2024)

Lightweight Near-Additive Spanners
par: Gitlitz, Yuval, et autres
Publié: (2024)