Zobrazeno 1 - 10
of 9 904
pro vyhledávání: '"Lichter A"'
In Couette flow, the liquid atoms adjacent to a solid substrate may have a finite average tangential velocity relative to the substrate. This so-called slip has been frequently observed. However, the particular molecular-level mechanisms that give ri
Externí odkaz:
http://arxiv.org/abs/2409.04445
We study the refutation complexity of graph isomorphism in the tree-like resolution calculus. Tor\'an and W\"orz (TOCL 2023) showed that there is a resolution refutation of narrow width $k$ for two graphs if and only if they can be distinguished in (
Externí odkaz:
http://arxiv.org/abs/2407.17947
Autor:
Lichter, Moritz, Pago, Benedikt
We show that various known algorithms for finite-domain constraint satisfaction problems (CSP), which are based on solving systems of linear equations over the integers, fail to solve all tractable CSPs correctly. The algorithms include $\mathbb{Z}$-
Externí odkaz:
http://arxiv.org/abs/2407.09097
Autor:
Gal, Rinon, Lichter, Or, Richardson, Elad, Patashnik, Or, Bermano, Amit H., Chechik, Gal, Cohen-Or, Daniel
Recent advancements in diffusion models have introduced fast sampling methods that can effectively produce high-quality images in just one or a few denoising steps. Interestingly, when these are distilled from existing diffusion models, they often ma
Externí odkaz:
http://arxiv.org/abs/2404.03620
Jupyter Notebook is an interactive development environment commonly used for rapid experimentation of machine learning (ML) solutions. Describing the ML activities performed along code cells improves the readability and understanding of Notebooks. Ma
Externí odkaz:
http://arxiv.org/abs/2403.07562
The Weisfeiler-Leman dimension of a graph $G$ is the least number $k$ such that the $k$-dimensional Weisfeiler-Leman algorithm distinguishes $G$ from every other non-isomorphic graph. The dimension is a standard measure of the descriptive complexity
Externí odkaz:
http://arxiv.org/abs/2402.11531
Autor:
Siegmann, Daniel, Edzards, Frank, Bruch, Christina, Biassoni, Matteo, Carminati, Marco, Descher, Martin, Fiorini, Carlo, Forstner, Christian, Gavin, Andrew, Gugiatti, Matteo, Hiller, Roman, Hinz, Dominic, Houdy, Thibaut, Huber, Anton, King, Pietro, Lechner, Peter, Lichter, Steffen, Mießner, Danilo, Nava, Andrea, Onillon, Anthony, Radford, David C., Spreng, Daniela, Steidl, Markus, Trigilio, Paolo, Urban, Korbinian, Vénos, Drahos, Wolf, Joachim, Mertens, Susanne
Publikováno v:
2024 J. Phys. G: Nucl. Part. Phys. 51 085202
Sterile neutrinos in the keV mass range present a viable candidate for dark matter. They can be detected through single $\beta$ decay, where they cause small spectral distortions. The Karlsruhe Tritium Neutrino (KATRIN) experiment aims to search for
Externí odkaz:
http://arxiv.org/abs/2401.14114
Autor:
Dana Yelin, Nassem Ghantous, Muhammad Awwad, Vered Daitch, Talya Kalfon, Michal Mor, Shira Buchrits, Yair Shafir, Irit Shapira-Lichter, Leonard Leibovici, Dafna Yahav, Ili Margalit, Dorit Shitenberg
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-6 (2024)
Abstract Impaired pulmonary diffusing capacity for carbon monoxide (DLCO) following COVID-19 has been consistently reported among individuals recovering from severe-critical infection. However, most long COVID cases follow non-severe COVID-19. We ass
Externí odkaz:
https://doaj.org/article/e36fe4b821db4cf99655b498fda6fff6
The $k$-dimensional Weisfeiler-Leman ($k$-WL) algorithm is a simple combinatorial algorithm that was originally designed as a graph isomorphism heuristic. It naturally finds applications in Babai's quasipolynomial time isomorphism algorithm, practica
Externí odkaz:
http://arxiv.org/abs/2308.11970
Abramsky, Dawar, and Wang (2017) introduced the pebbling comonad for k-variable counting logic and thereby initiated a line of work that imports category theoretic machinery to finite model theory. Such game comonads have been developed for various l
Externí odkaz:
http://arxiv.org/abs/2308.05693