Zobrazeno 1 - 10
of 9 506
pro vyhledávání: '"Pitz"'
Autor:
Pitz, Max, Stegemann, Jacob
In 1960, Nash-Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of directed paths between any two vertices is at least half the number of undirected paths between them (rounded down). Nash-W
Externí odkaz:
http://arxiv.org/abs/2409.10378
In this work we investigate the properties of neutron stars admixed with selfinteracting scalar bosonic dark matter. The dark matter interaction is described by a generalized $\phi^n$ power-law potential. We perform a stability analysis of these two-
Externí odkaz:
http://arxiv.org/abs/2408.13157
Autor:
Lewen, Jan, Pargmann, Max, Cherti, Mehdi, Jitsev, Jenia, Pitz-Paal, Robert, Quinto, Daniel Maldonado
Concentrating Solar Power (CSP) plants play a crucial role in the global transition towards sustainable energy. A key factor in ensuring the safe and efficient operation of CSP plants is the distribution of concentrated flux density on the receiver.
Externí odkaz:
http://arxiv.org/abs/2408.10802
Reorienting diverse objects with a multi-fingered hand is a challenging task. Current methods in robotic in-hand manipulation are either object-specific or require permanent supervision of the object state from visual sensors. This is far from human
Externí odkaz:
http://arxiv.org/abs/2407.18834
Publikováno v:
Biotechnologie, Agronomie, Société et Environnement, Vol 23, Iss 3, Pp 160-164 (2019)
Description of the subject. Vegetation of high conservation value can establish in quarries, during or after exploitation. Alien plants could hamper this process and cause additional rehabilitation costs. However, the situation of plant invasion in q
Externí odkaz:
https://doaj.org/article/ce63d8f6f59f463183d12e9326d3c1d8
Kriz and Thomas showed that every (finite or infinite) graph of tree-width $k \in \mathbb{N}$ admits a lean tree-decomposition of width $k$. We discuss a number of counterexamples demonstrating the limits of possible generalisations of their result t
Externí odkaz:
http://arxiv.org/abs/2405.06755
We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has a lean tr
Externí odkaz:
http://arxiv.org/abs/2405.06753
Autor:
Bowler, Nathan, Pitz, Max
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
Comment: 3 pages; V2 corrects a mistake in the last line of the proof
Comment: 3 pages; V2 corrects a mistake in the last line of the proof
Externí odkaz:
http://arxiv.org/abs/2402.05984