Zobrazeno 1 - 10
of 777
pro vyhledávání: '"Nisse P"'
Publikováno v:
Theoretical Computer Science, 943:102-120, 2023
Given a graph $G$ and $k \in \mathbb{N}$, we introduce the following game played in $G$. Each round, Alice colours an uncoloured vertex of $G$ red, and then Bob colours one blue (if any remain). Once every vertex is coloured, Alice wins if there is a
Externí odkaz:
http://arxiv.org/abs/2402.12811
Autor:
Lim, Yen-Kheng, Nisse, Mounir
The prime motivation behind this paper is to prove that any torus link $\mathcal{L}$ can be realized as the union of the one-dimensional connected components of the set of critical values of the argument map restricted to a complex algebraic plane cu
Externí odkaz:
http://arxiv.org/abs/2311.11835
Publikováno v:
International Journal of Theoretical Physics, vol 63 176 (2024)
We show that the free energy $\mathcal{F}$ and temperature $T$ of black holes, considered as a thermodynamic system, can be viewed as an $A$-discriminant of an appropriately-defined polynomial. As such, mathematical results about $A$-discriminants ma
Externí odkaz:
http://arxiv.org/abs/2311.11801
Hunters and Rabbit game is played on a graph $G$ where the Hunter player shoots at $k$ vertices in every round while the Rabbit player occupies an unknown vertex and, if not shot, must move to a neighbouring vertex after each round. The Rabbit player
Externí odkaz:
http://arxiv.org/abs/2309.16533
Communicating finite-state machines (CFMs) are a Turing powerful model of asynchronous message-passing distributed systems. In weakly synchronous systems, processes communicate through phases in which messages are first sent and then received, for ea
Externí odkaz:
http://arxiv.org/abs/2308.10578
Lee-Yang (LY) zeros, points on the complex plane of physical parameters where the partition function goes to zero, have found diverse applications across multiple disciplines like statistical physics, protein folding, percolation, complex networks et
Externí odkaz:
http://arxiv.org/abs/2308.12302
Given a digraph $D=(V,A)$ on $n$ vertices and a vertex $v\in V$, the cycle-degree of $v$ is the minimum size of a set $S \subseteq V(D) \setminus \{v\}$ intersecting every directed cycle of $D$ containing $v$. From this definition of cycle-degree, we
Externí odkaz:
http://arxiv.org/abs/2307.06700
Autor:
Hervé Laborde-Castérot, Dominique Vodovar, Adrian Ortiz De Zevallos, Weniko Caré, Patrick Nisse, Sophie Bargel, Marie-Odile Rambourg, Jérôme Langrand, The French PCC Research Group
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-6 (2024)
Abstract Bed bugs are pervasive global pests that have reemerged in the last 20 years as a significant public health concern, especially in densely populated urban areas. Beyond financial losses, expenses, inconvenience, and psychological distress, b
Externí odkaz:
https://doaj.org/article/8d560f0b9b6d4984aef71b74a66e483c
Autor:
Duchêne, Eric, Gledel, Valentin, Inerney, Fionn Mc, Nisse, Nicolas, Oijid, Nacim, Parreau, Aline, Stojaković, Miloš
We study the algorithmic complexity of Maker-Breaker games played on the edge sets of general graphs. We mainly consider the perfect matching game and the $H$-game. Maker wins if she claims the edges of a perfect matching in the first, and a copy of
Externí odkaz:
http://arxiv.org/abs/2302.10972
Autor:
Bousquet, Nicolas, Havet, Frédéric, Nisse, Nicolas, Picasarri-Arrieta, Lucas, Reinald, Amadeus
Given two $k$-dicolourings of a digraph $D$, we prove that it is PSPACE-complete to decide whether we can transform one into the other by recolouring one vertex at each step while maintaining a dicolouring at any step even for $k=2$ and for digraphs
Externí odkaz:
http://arxiv.org/abs/2301.03417