Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Libby Taylor"'
Autor:
Gillian Rhodes, Hanne C Lie, Nishta Thevaraja, Libby Taylor, Natasha Iredell, Christine Curran, Shi Qin Claire Tan, Pia Carnemolla, Leigh W Simmons
Publikováno v:
PLoS ONE, Vol 6, Iss 11, p e26653 (2011)
Most of what we know about what makes a face attractive and why we have the preferences we do is based on attractiveness ratings of static images of faces, usually photographs. However, several reports that such ratings fail to correlate significantl
Externí odkaz:
https://doaj.org/article/ec85a5898d2e4070a51072e05c3e10fd
Publikováno v:
manuscripta mathematica.
Let $p$ be a prime, let $r$ and $q$ be powers of $p$, and let $a$ and $b$ be relatively prime integers not divisible by $p$. Let $C/\mathbb F_{r}(t)$ be the superelliptic curve with affine equation $y^b+x^a=t^q-t$. Let $J$ be the Jacobian of $C$. By
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::338faff685ee915e299e6fdbea10bfc2
https://doi.org/10.1007/s00229-022-01424-9
https://doi.org/10.1007/s00229-022-01424-9
Autor:
Carolina Araujo, Roya Beheshti, Ana-Maria Castravet, Kelly Jabbusch, Svetlana Makarova, Enrica Mazzon, Libby Taylor, Nivedita Viswanathan
Publikováno v:
Revista de la Union Matematica Argentina
In this paper we address Fano manifolds with positive higher Chern characters. They are expected to enjoy stronger versions of several of the nice properties of Fano manifolds. For instance, they should be covered by higher dimensional rational varie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e035c8622f06d2877e126226d84fdcd1
https://hdl.handle.net/21.11116/0000-000B-4661-921.11116/0000-000B-465C-0
https://hdl.handle.net/21.11116/0000-000B-4661-921.11116/0000-000B-465C-0
Autor:
Shannon Talbott, Pamela E. Harris, Bethany Kubik, Libby Taylor, William T. Trotter, Rebecca Garcia, Fidel Barrera-Cruz, Heather C. Smith
Publikováno v:
Order. 36:621-652
There is a natural way to associate with a poset P a hypergraph , called the hypergraph of critical pairs, so that the dimension of P is exactly equal to the chromatic number of . The edges of have variable sizes, but it is of interest to consider th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4396b51e1d0cffebfc79ebacc247b09
https://doi.org/10.1007/s11083-019-09485-4
https://doi.org/10.1007/s11083-019-09485-4
Autor:
Arran Hamm, John Asplund, Éva Czabarka, Garner Cochran, László A. Székely, Gwen Spencer, Zhiyu Wang, Gregory J. Clark, Libby Taylor
The crossing number ${\mbox {cr}}(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, ${\mbox {cr}}_k(G)$, is defined as the minimum of ${\m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46e0f88916d09d353a9201b89703973f
https://ora.ox.ac.uk/objects/uuid:15bd2865-951b-4af7-870a-49d4a3eb6ec2
https://ora.ox.ac.uk/objects/uuid:15bd2865-951b-4af7-870a-49d4a3eb6ec2
Publikováno v:
Discrete Applied Mathematics. 247:419-422
We give an explicit extension of Spencer’s result on the biplanar crossing number of the Erdős–Renyi random graph G ( n , p ) . In particular, we show that the k -planar crossing number of G ( n , p ) is almost surely Ω ( ( n 2 p ) 2 ) . Along
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1ffb3659a7d9e6d75d72c5fb30d7388
https://doi.org/10.1016/j.dam.2018.04.007
https://doi.org/10.1016/j.dam.2018.04.007
Autor:
William T. Trotter, Fidel Barrera-Cruz, Libby Taylor, Stefan Felsner, Heather C. Smith, Piotr Micek, Tamás Mészáros
We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~$2$ while the path-chromatic number is unbounded. This resolves a problem posed by Seymour.
Comment: reviewers comments included
Comment: reviewers comments included
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35ef35bbdbcde63041b14119a99b545a
https://ruj.uj.edu.pl/xmlui/handle/item/252945
https://ruj.uj.edu.pl/xmlui/handle/item/252945
Individuals with autism spectrum disorder (ASD) can have difficulty recognizing emotional expressions. Here, we asked whether the underlying perceptual coding of expression is disrupted. Typical individuals code expression relative to a perceptual (a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6123a848c69774c49bcaa2eef27f0a0
https://ueaeprints.uea.ac.uk/id/eprint/63685/
https://ueaeprints.uea.ac.uk/id/eprint/63685/
Autor:
Roberta Daini, Bronwyn Hall, Libby Taylor, Andrea Albonico, Manuela Malaspina, Renaud Laguesse, Davide Rivolta, Gillian Rhodes, Shahd Al-Janabi, Romina Palermo, Tolga Tez, Elinor McKone, Jessica Irons, Bruno Rossion
Diagnosis of developmental or congenital prosopagnosia (CP) involves self-report of everyday face recognition difficulties, which are corroborated with poor performance on behavioural tests. This approach requires accurate self-evaluation. We examine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4223ae04a3aaea42687d7e010c000f9
http://hdl.handle.net/10281/120009
http://hdl.handle.net/10281/120009
Autor:
Libby Taylor
We present two characterizations of regular matroids among orientable matroids and use them to give a measure of "how far" an orientable matroid is from being regular.
Comment: Final version, to appear in Discrete Mathematics
Comment: Final version, to appear in Discrete Mathematics
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e698237d3ed71f1a3fdfeb776f8a406