Zobrazeno 1 - 10
of 224
pro vyhledávání: '"Grabowski, Łukasz"'
Autor:
Claramunt, Joan, Grabowski, Lukasz
Let $\Gamma$ be a finitely generated torsion-free group. We show that the statement of $\Gamma$ being virtually abelian is equivalent to the statement that the $*$-regular closure of the group ring $\mathbb{C}[\Gamma]$ in the algebra of (unbounded) o
Externí odkaz:
http://arxiv.org/abs/2303.02823
We study a variant of the parallel Moser-Tardos Algorithm. We prove that if we restrict attention to a class of problems whose dependency graphs have subexponential growth, then the expected total number of random bits used by the algorithm is consta
Externí odkaz:
http://arxiv.org/abs/2203.05888
Autor:
Gęca, Michal Jan, Grabowski, Łukasz, Pietrykowski, Konrad, Litak, Grzegorz, Kasianantham, Nanthagopal
Publikováno v:
In Case Studies in Thermal Engineering September 2024 61
Autor:
Grabowski, Łukasz, Trklja, Aleksandar
Publikováno v:
In Journal of Pragmatics June 2024 226:89-102
Autor:
Cieśla, Tomasz, Grabowski, Łukasz
We study random compact subsets of R^3 which can be described as "random Menger sponges". We use those random sets to construct a pair of compact sets A and B in R^3 which are of the same positive measure, such that A can be covered by finitely many
Externí odkaz:
http://arxiv.org/abs/2104.01244
Autor:
Trklja, Aleksandar, Grabowski, Łukasz
The notion of formulaicity has received increasing attention in disciplines and areas as diverse as linguistics, literary studies, art theory and art history. In recent years, linguistic studies of formulaicity have been flourishing and the very noti
Autor:
Grabowski, Łukasz1 lukasz.grabowski6@pw.edu.pl, Mitew-Czajewska, Monika2 mm@il.pw.edu.pl
Publikováno v:
Archives of Civil Engineering (Polish Academy of Sciences). 2024, Vol. 70 Issue 2, p661-675. 15p.
Autor:
Csóka, Endre, Grabowski, Łukasz
Publikováno v:
Combinator. Probab. Comp. 31 (2022) 184-197
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences, respectively. Our main result is a probabilistic construction of non-
Externí odkaz:
http://arxiv.org/abs/2008.08680
Autor:
Kosznik-Kwaśnicka, Katarzyna, Stasiłojć, Małgorzata, Grabowski, Łukasz, Zdrojewska, Karolina, Węgrzyn, Grzegorz, Węgrzyn, Alicja
Publikováno v:
In Microbiological Research August 2022 261
Autor:
Dayter, Daria, Grabowski, Łukasz
Publikováno v:
Przegląd Rusycystyczny / Russian Studies Review. (177):76-97
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=1027553