Zobrazeno 1 - 10
of 564
pro vyhledávání: '"MELNIKOV, Alexander"'
Autor:
Melnikov, Alexander G., Nies, Andre
Given a computably locally compact Polish space $M$, we show that its 1-point compactification $M^*$ is computably compact. Then, for a computably locally compact group $G$, we show that the Chabauty space $\mathcal S(G)$ of closed subgroups of $G$ h
Externí odkaz:
http://arxiv.org/abs/2407.19440
Autor:
Hovhannisyan, Razmik A., Grebenchuk, Sergey Yu., Shishkin, Andrey G., Grebenko, Artem, Kupchinskaya, Nadezhda E., Dobrovolskaya, Ekaterina S., Skryabina, Olga V., Aladyshkin, Alexey Yu., Golovchanskiy, Igor A., Samokhvalov, Alexey V., Melnikov, Alexander S., Roditchev, Dimitri, Stolyarov, Vasily S.
The presence of quantum vortices determines the electromagnetic response of superconducting materials and devices. Controlling the vortex motion, their pinning on intrinsic and artificial defects is therefore essential for superconducting electronics
Externí odkaz:
http://arxiv.org/abs/2403.20125
Autor:
Burton, Peter, Eagle, Christopher J., Fox, Alec, Goldbring, Isaac, Harrison-Trainor, Matthew, McNicholl, Timothy H., Melnikov, Alexander, Thewmorakot, Teerawat
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.
Externí odkaz:
http://arxiv.org/abs/2402.16672
Photocarriers in semiconductors excited by modulated laser sources give rise to charge diffusion waves that can be used to study and characterize the electronic transport properties of materials and devices. In this talk the concept of carrier diffus
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A38053
https://ul.qucosa.de/api/qucosa%3A38053/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A38053/attachment/ATT-0/
Publikováno v:
Annals of Pure and Applied Logic, vol. 175 (2024), no. 1, article id 103354
We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the fast-developing fi
Externí odkaz:
http://arxiv.org/abs/2210.13080
We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective presentability
Externí odkaz:
http://arxiv.org/abs/2209.04617
Autor:
Bagaviev, Ramil, Batyrshin, Ilnur I., Bazhenov, Nikolay, Bushtets, Dmitry, Dorzhieva, Marina, Koh, Heer Tern, Kornev, Ruslan, Melnikov, Alexander G., Ng, Keng Meng
Publikováno v:
In Annals of Pure and Applied Logic January 2025 176(1)
Autor:
Melnikov, Alexander, Nies, Andre
We study totally disconnected, locally compact (t.d.l.c.) groups from an algorithmic perspective. We give various approaches to defining computable presentations of t.d.l.c.\ groups, and show their equivalence. In the process, we obtain an algorithmi
Externí odkaz:
http://arxiv.org/abs/2204.09878
Publikováno v:
The Bulletin of Symbolic Logic, 2023 Jun 01. 29(2), 170-263.
Externí odkaz:
https://www.jstor.org/stable/27226694