Zobrazeno 1 - 10
of 4 910
pro vyhledávání: '"Zerbib, A"'
Autor:
McGinnis, Daniel, Zerbib, Shira
The KKM theorem, due to Knaster, Kuratowski, and Mazurkiewicz in 1929, is a fundamental result in fixed-point theory, which has seen numerous extensions and applications. In this paper we survey old and recent generalizations of the KKM theorem and t
Externí odkaz:
http://arxiv.org/abs/2408.03921
Given a $k$-uniform hypergraph $G$ and a set of $k$-uniform hypergraphs $\mathcal{H}$, the generalized Ramsey number $f(G,\mathcal{H},q)$ is the minimum number of colors needed to edge-color $G$ so that every copy of every hypergraph $H\in \mathcal{H
Externí odkaz:
http://arxiv.org/abs/2405.15904
Autor:
Soberón, Pablo, Zerbib, Shira
A theorem of Gr\"unbaum, which states that every $m$-polytope is a refinement of an $m$-simplex, implies the following generalization of Tverberg's theorem: if $f$ is a linear function from an $m$-dimensional polytope $P$ to $\mathbb{R}^d$ and $m \ge
Externí odkaz:
http://arxiv.org/abs/2404.11533
Sivaraman conjectured that if $G$ is a graph with no induced even cycle then there exist sets $X_1, X_2 \subseteq V(G)$ satisfying $V(G) = X_1 \cup X_2$ such that the induced graphs $G[X_1]$ and $G[X_2]$ are both chordal. We prove this conjecture in
Externí odkaz:
http://arxiv.org/abs/2310.05903
A pair $(A,B)$ of hypergraphs is called orthogonal if $|a \cap b|=1$ for every pair of edges $a \in A$ and $b \in B$. An orthogonal pair of hypergraphs is called a loom if each of its two members is the set of minimum covers of the other. Looms appea
Externí odkaz:
http://arxiv.org/abs/2309.03735
Autor:
Johanna Zerbib, Marica Rosaria Ippolito, Yonatan Eliezer, Giuseppina De Feudis, Eli Reuveni, Anouk Savir Kadmon, Sara Martin, Sonia Viganò, Gil Leor, James Berstler, Julia Muenzner, Michael Mülleder, Emma M. Campagnolo, Eldad D. Shulman, Tiangen Chang, Carmela Rubolino, Kathrin Laue, Yael Cohen-Sharir, Simone Scorzoni, Silvia Taglietti, Alice Ratti, Chani Stossel, Talia Golan, Francesco Nicassio, Eytan Ruppin, Markus Ralser, Francisca Vazquez, Uri Ben-David, Stefano Santaguida
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-20 (2024)
Abstract Aneuploidy is a hallmark of human cancer, yet the molecular mechanisms to cope with aneuploidy-induced cellular stresses remain largely unknown. Here, we induce chromosome mis-segregation in non-transformed RPE1-hTERT cells and derive multip
Externí odkaz:
https://doaj.org/article/39fb3782127942b7a41803d50388bb0d
Let $f(n,p,q)$ denote the minimum number of colors needed to color the edges of $K_n$ so that every copy of $K_p$ receives at least $q$ distinct colors. In this note, we show $\frac{6}{7}(n-1) \leq f(n,5,8) \leq n + o(n)$. The upper bound is proven u
Externí odkaz:
http://arxiv.org/abs/2308.16365
Recently, Alon introduced the notion of an $H$-code for a graph $H$: a collection of graphs on vertex set $[n]$ is an $H$-code if it contains no two members whose symmetric difference is isomorphic to $H$. Let $D_{H}(n)$ denote the maximum possible c
Externí odkaz:
http://arxiv.org/abs/2307.01314
Autor:
Zerbib, M., Hoang, V. T., Beugnot, J. C., Huy, K. P., Little, B., Chu, S. T., Moss, D. J., Morandotti, R., Wetzel, B., Sylvestre, T.
We report the observation of Brillouin backscattering in a 50-cm long spiral high-index doped silica chip waveguide and measured a Brillouin frequency shift of 16 GHz which is in very good agreement with theoretical predictions and numerical simulati
Externí odkaz:
http://arxiv.org/abs/2305.11502
Autor:
Yuhala, Peterson, Paper, Michael, Zerbib, Timothée, Felber, Pascal, Schiavoni, Valerio, Tchana, Alain
Intel's software guard extensions (SGX) provide hardware enclaves to guarantee confidentiality and integrity for sensitive code and data. However, systems leveraging such security mechanisms must often pay high performance overheads. A major source o
Externí odkaz:
http://arxiv.org/abs/2305.00763