Zobrazeno 1 - 10
of 1 061
pro vyhledávání: '"Duarte,Rui"'
A parking function of length $n$ is prime if we obtain a parking function of length $n-1$ by deleting one 1 from it. In this note we give a new direct proof that the number of prime parking functions of length $n$ is $(n-1)^{n-1}$. This proof leads t
Externí odkaz:
http://arxiv.org/abs/2302.04210
The $n$-Queens graph, $\mathcal{Q}(n)$, is the graph obtained from a $n\times n$ chessboard where each of its $n^2$ squares is a vertex and two vertices are adjacent if and only if they are in the same row, column or diagonal. In a previous work the
Externí odkaz:
http://arxiv.org/abs/2301.08106
Autor:
Bresnahan, Rebecca, Copley, Sue, Eldabe, Sam, Thomson, Simon, North, Richard B., Baranidharan, Ganesan, Levy, Robert M., Collins, Gary S., Taylor, Rod S., Duarte, Rui V.
Publikováno v:
In eClinicalMedicine December 2024 78
Autor:
Duarte, Rui V., Bresnahan, Rebecca, Copley, Sue, Eldabe, Sam, Thomson, Simon, North, Richard B., Baranidharan, Ganesan, Levy, Robert M., Collins, Gary S., Taylor, Rod S.
Publikováno v:
In eClinicalMedicine December 2024 78
Autor:
Levy, Robert M., Mekhail, Nagy A., Kapural, Leonardo, Gilmore, Christopher A., Petersen, Erika A., Goree, Johnathan H., Pope, Jason E., Costandi, Shrif J., Kallewaard, Jan Willem, Thomson, Simon, Gilligan, Christopher, AlFarra, Tariq, Broachwala, Mustafa Y., Chopra, Harman, Hunter, Corey W., Rosen, Steven M., Amirdelfan, Kasra, Falowski, Steven M., Li, Sean, Scowcroft, James, Lad, Shivanand P., Sayed, Dawood, Antony, Ajay, Deer, Timothy R., Hayek, Salim M., Guirguis, Maged N., Boeding, Ronald B., Calodney, Aaron K., Bruel, Brian, Buchanan, Patrick, Soliday, Nicole, Duarte, Rui V., Leitner, Angela, Staats, Peter S.
Publikováno v:
In Neuromodulation: Technology at the Neural Interface December 2024 27(8):1393-1405
Autor:
Deer, Timothy R., Hayek, Salim M., Grider, Jay S., Hagedorn, Jonathan M., McDowell, Gladstone C., II, Kim, Philip, Dupoiron, Denis, Goel, Vasudha, Duarte, Rui, Pilitsis, Julie G., Leong, Michael S., De Andrés, Jose, Perruchoud, Christophe, Sukumaran, Harry, Abd-Elsayed, Alaa, Saulino, Michael, Patin, Dennis, Poree, Lawrence R., Strand, Natalie, Gritsenko, Karina, Osborn, Jill A., Dones, Ivano, Bux, Anjum, Shah, Jay M., Lindsey, Brad L., Shaw, Erik, Yaksh, Tony L., Levy, Robert M.
Publikováno v:
In Neuromodulation: Technology at the Neural Interface October 2024 27(7):1107-1139
Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions. As an application, we prove that the
Externí odkaz:
http://arxiv.org/abs/2201.01224
Publikováno v:
In Discrete Mathematics September 2024 347(9)
Autor:
Puzzolo, Elisa *, Fleeman, Nigel, Lorenzetti, Federico, Rubinstein, Fernando, Li, Yaojie, Xing, Ran, Shen, Guofeng, Nix, Emily, Maden, Michelle, Bresnahan, Rebecca, Duarte, Rui, Abebe, Lydia, Lewis, Jessica, Williams, Kendra N, Adahir-Rohani, Heather, Pope, Daniel
Publikováno v:
In The Lancet Respiratory Medicine April 2024 12(4):281-293
Autor:
Amon, Andreas, Marjenin, Timothy, Duarte, Rui V., Gilligan, Christopher, Thomson, Simon James, Eldabe, Sam, Alesch, François
Publikováno v:
In Neuromodulation: Technology at the Neural Interface April 2024 27(3):447-454