Cover Image

Graph-theoretical estimates of the diameters of the Rubik's Cube groups

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Hirata, So
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics Group Theory Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Probabilistic estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)

A Demigod's Number for the Rubik's Cube
by: Merino, Arturo, et al.
Published: (2024)

Ergodic properties of concurrent systems
by: Abbes, Samy, et al.
Published: (2025)

An Eventown Result for Permutations
by: Lindzey, Nathan
Published: (2026)

Hamilton decompositions of the directed 3-torus: a return-map and odometer view
by: Park, SangHyun
Published: (2026)

Transitive Sets of Mutually Orthogonal Latin Squares
by: Keita, Amadou, et al.
Published: (2026)

Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs
by: Kurapov, Sergey, et al.
Published: (2024)

Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
by: Bangachev, Kiril, et al.
Published: (2024)

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

A group-theoretic approach to Shannon capacity of graphs and a limit theorem from lattice packings
by: Buys, Pjotr, et al.
Published: (2025)

Algebraic characterization of dendricity
by: Gheeraert, France, et al.
Published: (2024)

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
by: Esperet, Louis, et al.
Published: (2023)

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)

On the clique number of random Cayley graphs and related topics
by: Conlon, David, et al.
Published: (2024)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphs
by: Chervov, A., et al.
Published: (2025)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Record-biased permutations and their permuton limit
by: Bouvel, Mathilde, et al.
Published: (2024)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
by: Pham, Huy Tuan
Published: (2024)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
by: Kunisky, Dmitriy, et al.
Published: (2024)

Sunflowers in set systems with small VC-dimension
by: Balogh, József, et al.
Published: (2024)

Spread blow-up lemma with an application to perturbed random graphs
by: Nenadov, Rajko, et al.
Published: (2024)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

A threshold for online balancing of sparse i.i.d. vectors
by: Altschuler, Dylan J., et al.
Published: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
by: Gurvits, Leonid, et al.
Published: (2023)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

Zero-One Laws for Random Feasibility Problems
by: Altschuler, Dylan J.
Published: (2023)

Shotgun assembly of random graphs
by: Johnston, Tom, et al.
Published: (2022)

Infinite Schnyder Woods
by: Addario-Berry, Louigi, et al.
Published: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
by: Li, Ray, et al.
Published: (2025)

Approximate polymorphisms of predicates
by: Alekseev, Yaroslav, et al.
Published: (2025)

A Proof of Talagrand's Creating Large Sets Conjecture
by: Fang, Xuan, et al.
Published: (2025)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
by: Gamarnik, David, et al.
Published: (2023)

Minimum stationary values of sparse random directed graphs
by: Cai, Xing Shi, et al.
Published: (2020)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
by: Gajjala, Rishikesh
Published: (2026)

A binomial random multigraph
by: Pelekis, Christos
Published: (2023)