Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Chang, Mun See"'
Factorio is a 2D construction and management simulation video game about building automated factories to produce items of increasing complexity. A core feature of the game is its blueprint system, which allows players to easily save and replicate par
Externí odkaz:
http://arxiv.org/abs/2310.01505
The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for restricted
Externí odkaz:
http://arxiv.org/abs/2112.00388
Autor:
Chang, Mun See, Roney-Dougal, Colva M.
Publikováno v:
Archiv der Mathematik (2021)
The normaliser problem has as input two subgroups $H$ and $K$ of the symmetric group $S_n$, and asks for a generating set for $N_K(H)$: it is not known to have a subexponential time solution. It is proved in [Roney-Dougal & Siccha, 2020] that if $H$
Externí odkaz:
http://arxiv.org/abs/2106.01886
Autor:
Chang, Mun See, Jefferson, Christopher
Publikováno v:
Journal of Symbolic Computation 108 (2022) 1-16
Let $H \leq S_n$ be an intransitive group with orbits $\Omega_1, \Omega_2, \ldots ,\Omega_k$. Then certainly $H$ is a subdirect product of the direct product of its projections on each orbit, $H|_{\Omega_1} \times H|_{\Omega_2} \times \ldots \times H
Externí odkaz:
http://arxiv.org/abs/2004.11618
Publikováno v:
In Journal of Algebra 1 September 2022 605:429-458
Autor:
Chang, Mun See, Jefferson, Christopher
Publikováno v:
In Journal of Symbolic Computation January-February 2022 108:1-16
Autor:
Chang, Mun See
We investigate the normaliser problem, that is, given 𝐺, 𝐻 ≤ 𝑆ₙ, compute 𝑁[sub]𝐺(𝐻). The fastest known theoretical algorithm for this problem is simply exponential, but more efficient algorithms are known for some restriction of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b58888d24d56a9676b805cb258ee9a5d
https://hdl.handle.net/10023/23416
https://hdl.handle.net/10023/23416
Autor:
Chang, Mun See, Roney-Dougal, Colva M.
Publikováno v:
Archiv der Mathematik; Jan2022, Vol. 118 Issue 1, p19-25, 7p