Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Davi Castro-Silva"'
Autor:
Jop Briët, Davi Castro-Silva
Publikováno v:
Discrete Analysis (2024)
Random restrictions of high-rank tensors and polynomial maps, Discrete Analysis 2024:9, 24 pp. Let $A$ be an $n\times n$ matrix of rank $r$. The following argument shows that if we randomly restrict $A$ by picking each row and each column independen
Externí odkaz:
https://doaj.org/article/61bdbb9c3d3e4b24ba13ab3407a75dca
Autor:
Davi Castro-Silva
Publikováno v:
Forum of Mathematics, Sigma, Vol 11 (2023)
Given finite configurations $P_1, \dots , P_n \subset \mathbb {R}^d$ , let us denote by $\mathbf {m}_{\mathbb {R}^d}(P_1, \dots , P_n)$ the maximum density a set $A \subseteq \mathbb {R}^d$ can have without containing congruent copies of any
Externí odkaz:
https://doaj.org/article/c9e4bb692bc246698e1efa43ef442268
Publikováno v:
American Mathematical Society. Proceedings. 150(8)
We recursively extend the Lov\'asz theta number to geometric hypergraphs on the unit sphere and on Euclidean space, obtaining an upper bound for the independence ratio of these hypergraphs. As an application we reprove a result in Euclidean Ramsey th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7330eea5a25e78cd32f5b60653fe7587
https://doi.org/10.1090/proc/15940
https://doi.org/10.1090/proc/15940
Autor:
Davi Castro-Silva, Eric Gourdin
We consider several extensions of the fractional bin packing problem, a relaxation of the traditional bin packing problem where the objects may be split across multiple bins. In these extensions, we introduce load-balancing constraints imposing that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48a078dd01afbc6cd10b01e0cfae535f
http://arxiv.org/abs/1810.12086
http://arxiv.org/abs/1810.12086
